Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Nonsingular plane cubic curves over finite fields
Journal of Combinatorial Theory Series A
Reducing elliptic curve logarithms to logarithms in a finite field
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Discrete logarithms in GF(P) using the number field sieve
SIAM Journal on Discrete Mathematics
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
Mathematics of Computation
Mathematics of Computation
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Robustness Principles for Public Key Protocols
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Schoof's algorithm and isogeny cycles
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
Discrete Logarithms: The Effectiveness of the Index Calculus Method
ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
Comparing the MOV and FR reductions in elliptic curve cryptography
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Twin Signature Schemes, Revisited
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Building efficient fully collusion-resilient traitor tracing and revocation schemes
Proceedings of the 17th ACM conference on Computer and communications security
A practical (non-interactive) publicly verifiable secret sharing scheme
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Generating prime order elliptic curves: difficulties and efficiency considerations
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Fully collusion resistant black-box traitor revocable broadcast encryption with short private keys
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Controlled joining on encrypted relational database
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Shorter IBE and signatures via asymmetric pairings
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Practical constructions and new proof methods for large universe attribute-based encryption
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.01 |
Elliptic curve cryptosystems([19,25]) are based on the elliptic curve discrete logarithm problem (ECDLP). If elliptic curve cryptosystems avoid FR-reduction([11,17]) and anomalous elliptic curve over Fq ([34,3,36]), then with current knowledge we can construct elliptic curve cryptosystems over a smaller definition field. ECDLP has an interesting property that the security deeply depends on elliptic curve traces rather than definition fields, which does not occur in the case of the discrete logarithm problem (DLP). Therefore it is important to characterize elliptic curve traces explicitly from the security point of view. As for FR-reduction, supersingular elliptic curves or elliptic curve E/Fq with trace 2 have been reported to be vulnerable. However unfortunately these have been only results that characterize elliptic curve traces explicitly for FR- or MOV-reductions. More importantly, the secure trace against FR-reduction has not been reported at all. Elliptic curves with the secure trace means that the reduced extension degree is always higher than a certain level.In this paper, we aim at characterizing elliptic curve traces by FR-reduction and investigate explicit conditions of traces vulnerable or secure against FR-reduction. We show new explicit conditions of elliptic curve traces for FR-reduction. We also present algorithms to construct such elliptic curves, which have relation to famous number theory problems.