Advances in Cryptology — EUROCRYPT ’99

We show that if the private exponent d used in the RSA public-key cryptosystem is less than N then the system is insecure. This is the first improvement over an old result of Wiener showing that when d < N the RSA system is insecure. We hope our approach can be used to eventually improve the bound to d < N.

[1]  K. McCurley,et al.  A rigorous subexponential algorithm for computation of class groups , 1989 .

[2]  C. P. Schnorr,et al.  Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.

[3]  Jerome A. Solinas.  An Improved Algorithm for Arithmetic on a Family of Elliptic Curves , 1997, CRYPTO.

[4]  Neal Koblitz,et al.  Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.

[5]  Takakazu Satoh,et al.  Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves , 1998 .

[6]  Nigel P. Smart,et al.  Elliptic Curves over small fields of odd characteristic , 1999 .

[7]  J. Pila.  Frobenius maps of Abelian varieties and finding roots of unity in finite fields , 1990 .

[8]  J. Igusa,et al.  Arithmetic Variety of Moduli for Genus Two , 1960 .

[9]  Hermann-Josef Weber.  Algorithmische Konstruktion hyperelliptischer Kurven mit kryptographischer Relevanz und einem Endomorphismenring echt grösser als Z , 1997 .

[10]  Kouichi Sakurai,et al.  Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2n , 1998, ASIACRYPT.

[11]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[12]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1993, IEEE Trans. Inf. Theory.

[13]  Serge Vaudenay,et al.  An experiment on DES statistical cryptanalysis , 1996, CCS '96.

[14]  Andreas Enge,et al.  The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems , 2001, Des. Codes Cryptogr..

[15]  Leonard M. Adleman,et al.  Counting Rational Points on Curves and Abelian Varieties over Finite Fields , 1996, ANTS.

[16]  G. S. Vernam.  Cipher printing telegraph systems: For secret wire and radio telegraphic communications , 2022, Journal of the A.I.E.E..

[17]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[18]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[19]  G. Frey,et al.  A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .

[20]  Kouichi Sakurai,et al.  Secure Hyperelliptic Cryptosystems and Their Performances , 1998, Public Key Cryptography.

[21]  Sachar Paulus.  An Algorithm of Subexponential Type Computing the Class Group of Quadratic Orders over Principal Ideal Domains , 1996, ANTS.

[22]  Gerhard Frey,et al.  Arithmetic of Modular Curves and Applications , 1997, Algorithmic Algebra and Number Theory.

[23]  Volker Müller.  Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two , 1998, Journal of Cryptology.

[24]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

[25]  Jacques Patarin,et al.  About Feistel Schemes with Six (or More) Rounds , 1998, FSE.

[26]  Victor Shoup,et al.  Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.

[27]  Jinhui Chao,et al.  Efficient construction of secure hyperelliptic discrete logarithm problems , 1997, ICICS.

[28]  Sachar Paulus,et al.  Comparing Real and Imaginary Arithmetics for Divisor Class Groups of Hyperelliptic Curves , 1998, ANTS.

[29]  Leonard M. Adleman,et al.  A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields , 1994, ANTS.

[30]  Serge Vaudenay,et al.  Provable Security for Block Ciphers by Decorrelation , 1998, STACS.

[31]  Nigel P. Smart,et al.  The Discrete Logarithm Problem on Elliptic Curves of Trace One , 1999, Journal of Cryptology.