Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic Curves
In 1997, H. Sakazaki, E. Okamato and M. Mambo  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.
Unable to display preview. Download preview PDF.
- 1.E. Bach and J. Shallit. Algorithmic Number Theory. Volume 1: Efficient Algorithms, MIT Press, 1996.Google Scholar
- 2.D. Knuth. The Art of Computer Programming, Volume 2, Seminumerical Algorithms ( Third Edition ), Addison-Wesley, 1998.Google Scholar
- 3.N. Koblitz. A Course in Number Theory and Cryptography (Second Edition), Springer-Verlag, 1994.Google Scholar
- 4.National Institute of Standards and Technology. Secure Hash Standard (SHS),FIPS Publication 180–1, 1995.Google Scholar
- 5.E. Okamoto. Key distribution systems based on identification information, Crypto’87 194–202Google Scholar
- 6.H. Sakazaki, E. Okamato and M. Mambo. ID-based key distribution system over an elliptic curve.. Contemporary Mathematics 225 (1999), 215–223 (Fourth International Conference on Finite Fields).Google Scholar