论文信息 - Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic Curves

Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic Curves

In 1997, H. Sakazaki, E. Okamato and M. Mambo [6] proposed an ID-based key distribution system on an elliptic curve over ℤ n . We will cryptanalyze the scheme and demonstrate that when the hashed ID length is about 160 bits, the scheme is insecure. To be specific, after requesting a small number of keys from the Center, our attack allows a new valid key to be constructed without any further interaction with the Center.

[1] Neal Koblitz,et al. A course in number theory and cryptography, Second Edition , 1994 .

[2] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

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

[4] Eiji Okamoto,et al. Key Distribution Systems Based on Identification Information , 1987, CRYPTO.

[5] David Thomas,et al. The Art in Computer Programming , 2001 .

[6] Eiji Okamoto,et al. Key distribution system based on identification information , 1989, IEEE J. Sel. Areas Commun..

[7] N. Koblitz. A Course in Number Theory and Cryptography , 1987 .

[8] Jeffrey Shallit,et al. Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.