Paper 2019/1283 Original: eprint.iacr.org/2019/1283 ↗

Breaking the Hidden Irreducible Polynomials Scheme

Christian Eder
Abstract

In 2019 Gómez described a new public key cryptography scheme based on ideas from multivariate public key cryptography using hidden irreducible polynomials. We show that the scheme's design has a flaw which lets an attacker recover the private key directly from the public key.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2019-11-05: last updated
2019-11-05: published
Short URL
https://ia.cr/2019/1283
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2019/1283,
      author = {Christian Eder},
      title = {Breaking the Hidden Irreducible Polynomials Scheme},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/1283},
      year = {2019},
      url = {https://eprint.iacr.org/2019/1283}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.