Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A One Round Protocol for Tripartite Diffie–Hellman
Journal of Cryptology
The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
Group signatures with verifier-local revocation
Proceedings of the 11th ACM conference on Computer and communications security
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Elliptic Curves Suitable for Pairing Based Cryptography
Designs, Codes and Cryptography
Pairing Computation on Twisted Edwards Form Elliptic Curves
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Faster addition and doubling on elliptic curves
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
High security pairing-based cryptography revisited
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Pairing-Based cryptography at high security levels
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
IEEE Transactions on Information Theory
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Delaying mismatched field multiplications in pairing computations
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
An analysis of affine coordinates for pairing computation
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A variant of Miller's formula and algorithm
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Another elliptic curve model for faster pairing computation
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Efficient pairing computation on Elliptic curves in Hessian form
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Faster pairing computations on curves with high-degree twists
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Avoiding full extension field arithmetic in pairing computations
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Refinement of miller's algorithm over edwards curves
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Fast tate pairing computation on twisted Jacobi intersections curves
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Tate pairing computation on jacobi's elliptic curves
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Hi-index | 0.00 |
The recent introduction of Edwards curves has significantly reduced the cost of addition on elliptic curves. This paper presents new explicit formulae for pairing implementation in Edwards coordinates. We prove our method gives performances similar to those of Miller's algorithm in Jacobian coordinates and is thus of cryptographic interest when one chooses Edwards curve implementations of protocols in elliptic curve cryptography. The method is faster than the recent proposal of Das and Sarkar for computing pairings on supersingular curves using Edwards coordinates.