Paper 2008/245

Cryptanalysis of an Authentication Scheme Using Truncated Polynomials

Markus Grassl and Rainer Steinwandt

Abstract

An attack on a recently proposed authentication scheme of Shpilrain and Ushakov is presented. The public information allows the derivation of a system of polynomial equations for the secret key bits. Our attack uses simple elimination techniques to distill linear equations. For the proposed parameter choice, the attack often finds secret keys or alternative secret keys within minutes with moderate resources.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
cryptanalysisauthentication schememultivariate polynomials
Contact author(s)
rsteinwa @ fau edu
History
2008-06-03: received
Short URL
https://ia.cr/2008/245
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/245,
      author = {Markus Grassl and Rainer Steinwandt},
      title = {Cryptanalysis of an Authentication Scheme Using Truncated Polynomials},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/245},
      year = {2008},
      url = {https://eprint.iacr.org/2008/245}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.