CRNov 5, 2019

Breaking the Hidden Irreducible Polynomials Scheme

arXiv:1911.01830v13 citations
Originality Synthesis-oriented
AI Analysis

This work exposes a critical vulnerability in a recent cryptographic scheme, potentially impacting its security applications.

The paper identifies a flaw in Gómez's 2019 public key cryptography scheme based on hidden irreducible polynomials, enabling an attacker to directly recover the private key from the public key.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes