Invention Grant
US08213605B2 Trapdoor one-way functions on elliptic curves and their application to shorter signatures and asymmetric encryption
有权
椭圆曲线上的Trapdoor单向函数及其对较短签名和非对称加密的应用
- Patent Title: Trapdoor one-way functions on elliptic curves and their application to shorter signatures and asymmetric encryption
- Patent Title (中): 椭圆曲线上的Trapdoor单向函数及其对较短签名和非对称加密的应用
-
Application No.: US12945234Application Date: 2010-11-12
-
Publication No.: US08213605B2Publication Date: 2012-07-03
- Inventor: Daniel Richard L. Brown , Robert Philip Gallant , Scott Alexander Vanstone , Marinus Struik
- Applicant: Daniel Richard L. Brown , Robert Philip Gallant , Scott Alexander Vanstone , Marinus Struik
- Applicant Address: CA Mississauga
- Assignee: Certicom Corp.
- Current Assignee: Certicom Corp.
- Current Assignee Address: CA Mississauga
- Agency: Blake, Cassels & Graydon LLP
- Agent Brett J. Slaney; John R. S. Orange
- Priority: WOPCT/IB2004/003700 20041111
- Main IPC: H04L9/30
- IPC: H04L9/30

Abstract:
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.
Public/Granted literature
Information query