English

Breaking the Hidden Irreducible Polynomials Scheme

Cryptography and Security 2019-11-06 v1

Abstract

In 2019 G\'omez 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.

Keywords

Cite

@article{arxiv.1911.01830,
  title  = {Breaking the Hidden Irreducible Polynomials Scheme},
  author = {Christian Eder},
  journal= {arXiv preprint arXiv:1911.01830},
  year   = {2019}
}

Comments

8 pages

R2 v1 2026-06-23T12:05:52.410Z