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

Minghua Qu, Doug Stinson and Scott Vanstone
Additional contact information
Minghua Qu: CerticomResearch
Doug Stinson: University of Waterloo, Department of C&O
Scott Vanstone: CerticomResearch

A chapter in Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, 2002, pp 263-269 from Springer

Abstract: Abstract 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.

Date: 2002
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-59435-9_21

Ordering information: This item can be ordered from
http://www.springer.com/9783642594359

DOI: 10.1007/978-3-642-59435-9_21

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().