Elliptic Curves Suitable for Pairing Based Cryptography
Designs, Codes and Cryptography
Generating More MNT Elliptic Curves
Designs, Codes and Cryptography
Provably secure non-interactive key distribution based on pairings
Discrete Applied Mathematics - Special issue: Coding and cryptography
Special polynomial families for generating more suitable pairing-friendly elliptic curves
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Provably secure non-interactive key distribution based on pairings
Discrete Applied Mathematics - Special issue: Coding and cryptography
Deniable authenticated key establishment for internet protocols
Proceedings of the 11th international conference on Security Protocols
A new method of building more non-supersingular elliptic curves
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Fast bilinear maps from the tate-lichtenbaum pairing on hyperelliptic curves
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
Algebraic curves and cryptography
Finite Fields and Their Applications
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
We present a fast algorithm for building ordinary elliptic curves over finite prime fields having arbitrary small MOV degree. The elliptic curves are obtained using complex multiplication by any desired discriminant.