arXiv · 1911.01830
Breaking the Hidden Irreducible Polynomials Scheme
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.
Explore related subjects
Keep this discovery
Christian Eder. 2019-11-05. Breaking the Hidden Irreducible Polynomials Scheme. https://arxiv.org/abs/1911.01830
Cite the original work for its findings. Save a collection to share your selection of sources.