Name
Abstract | ||
|---|---|---|
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computationally unfeasible when elliptic curves are suitably chosen. This paper provides an algorithm to obtain cryptographically good elliptic curves from a given one. The core of such a procedure lies on the usage of successive chains of isogenies, visiting different volcanoes of isogenies which are located in different l-cordilleras. |
Year | Venue | Keywords |
|---|---|---|
2007 | ACSW Frontiers | different volcano,elliptic curve,elliptic curve discrete logarithm,elliptic curve cryptosystems,isogeny cordillera algorithm,successive chain,computationally unfeasible,different l-cordilleras,cryptographically good elliptic curve,elliptic curves,cryptography |
Field | DocType | ISBN |
Discrete mathematics,Supersingular elliptic curve,Twists of curves,Modular elliptic curve,Algorithm,Elliptic curve point multiplication,Elliptic curve cryptography,Hessian form of an elliptic curve,Counting points on elliptic curves,Mathematics,Schoof's algorithm | Conference | 1-920-68285-X |
Citations | PageRank | References |
2 | 0.40 | 5 |
Authors | ||
5 | ||