89 search results - page 3 / 18 » A note on the Ate pairing |
IACR
2011
12 years 6 months ago
2011
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter...
IPL
2002
13 years 6 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
CCCG
2007
13 years 7 months ago
2007
CRYPTO
2001
Springer
13 years 10 months ago
2001
Springer
in SIAM J. of Computing, Vol. 32, No. 3, pp. 586-615, 2003. An extended abstract of this paper appears in the Proceedings of Crypto 2001, volume 2139 of Lecture Notes in Computer S...
CHES
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...