Trapdoor one-way functions on elliptic curves and their application to shorter signatures and asymmetric encryption
AssigneeCerticom Corp.
InventorsDaniel Brown, Robert Gallant, Scott Vanstone, Marinus Struik
Life of this patent
Estimating the term…
Loading patent…
AssigneeCerticom Corp.
InventorsDaniel Brown, Robert Gallant, Scott Vanstone, Marinus Struik
Estimating the term…
The present invention provides a new trapdoor one-way function. In a general sense, some quadratic algebraic integer z is used. One then finds a curve E and a rational map defining [z] on E. The rational map [z] is the trapdoor one-way function. A judicious selection of z will ensure that [z] can be efficiently computed, that it is difficult to invert, that determination of [z] from the rational functions defined by [z] is difficult, and knowledge of z allows one to invert [z] on a certain set of elliptic curve points. Every rational map is a composition of a translation and an endomorphism. The most secure part of the rational map is the endomorphism as the translation is easy to invert. If the problem of inverting the endomorphism and thus [z] is as hard as the discrete logarithm problem in E, then the size of the cryptographic group can be smaller than the group used for RSA trapdoor one-way functions.
A cryptographic system operating on an elliptic curve E of order n, said cryptosystem having an endomorphism [z] corresponding to a quadratic algebraic integer z that has the form z2+uz+v=0, where u and v are secret integers, and v is relatively prime to n;
A method for performing cryptographic operations in a cryptographic system operating on an elliptic curve E of order n, said method comprising the steps of deriving an endomorphism [z] corresponding to a quadratic algebraic integer z that has the form z2+uz+v=0, where u and v are secret integers, and v is relatively prime to n;
Dependencies are inferred from the claim text.