Paper 2002/143

An Attack on the Isomorphisms of Polynomials Problem with One Secret

Willi Geiselmann, Willi Meier, and Rainer Steinwandt

Abstract

At EUROCRYPT '96 J. Patarin introduced the "Isomorphisms of Polynomials (IP)" problem as a basis of authentication and signature schemes. We describe an attack on the secret key of "IP with one secret" and demonstrate its efficiency through examples with realistic parameter sizes. To prevent our attack, additional restrictions on the suggested parameters should be imposed.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
cryptanalysismultivariate polynomials
Contact author(s)
steinwan @ ira uka de
History
2002-09-20: received
Short URL
https://ia.cr/2002/143
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2002/143,
      author = {Willi Geiselmann and Willi Meier and Rainer Steinwandt},
      title = {An Attack on the Isomorphisms of Polynomials Problem with One Secret},
      howpublished = {Cryptology ePrint Archive, Paper 2002/143},
      year = {2002},
      note = {\url{https://eprint.iacr.org/2002/143}},
      url = {https://eprint.iacr.org/2002/143}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.