Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Elliptic Curves Suitable for Pairing Based Cryptography
Designs, Codes and Cryptography
Constructing elliptic curves with prescribed embedding degrees
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Constructing pairing-friendly elliptic curves with embedding degree 10
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Pairing-Friendly elliptic curves of prime order
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
IEEE Transactions on Information Theory
Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Generating Pairing-Friendly Curves with the CM Equation of Degree 1
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Faster Pairings on Special Weierstrass Curves
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Fast Hashing to G2 on Pairing-Friendly Curves
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Constructing tower extensions of finite fields for implementation of pairing-based cryptography
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Designing a code generator for pairing based cryptographic functions
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Generating more Kawazoe-Takahashi genus 2 pairing-friendly hyperelliptic curves
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
FPGA implementation of pairings using residue number system and lazy reduction
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Faster squaring in the cyclotomic subgroup of sixth degree extensions
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
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
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
On the efficient implementation of pairing-based protocols
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
On constructing families of pairing-friendly elliptic curves with variable discriminant
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Indifferentiable hashing to barreto---naehrig curves
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
An improved twisted ate pairing over KSS curves with k=18
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Implementing pairings at the 192-bit security level
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Speeding up ate pairing computation in affine coordinates
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
We describe a new method for constructing Brezing-Weng-like pairing-friendly elliptic curves. The new construction uses the minimal polynomials of elements in a cyclotomic field. Using this new construction we present new "record breaking" families of pairing-friendly curves with embedding degrees of k茂戮驴 {16,18,36,40}, and some interesting new constructions for the cases k茂戮驴 {8,32}.