4212 search results - page 12 / 843 » On Compressible Pairings and Their Computation |
88
Voted
AMC
2007
15 years 17 days ago
2007
In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate Pairings. In this paper we extend their work and propose a generalized algo...
92
Voted
IEICET
2008
15 years 15 days ago
2008
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
EMNLP
2008
15 years 1 months ago
2008
Knowing the degree of antonymy between words has widespread applications in natural language processing. Manually-created lexicons have limited coverage and do not include most se...
105
Voted
TPDS
2010
14 years 10 months ago
2010
s: An Abstraction for Data Intensive Computing on Campus Grids Christopher Moretti, Hoang Bui, Karen Hollingsworth, Brandon Rich, Patrick Flynn, and Douglas Thain Department of Com...
104
Voted
AFRICACRYPT
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...