Why you cannot even hope to use Gröbner bases in public key cryptography: An open letter to a scientist who failed and a challenge to those who have not yet failed

DOI10.1006/jsco.1994.1061zbMath0900.94024OpenAlexW1986389505WikidataQ57318843 ScholiaQ57318843MaRDI QIDQ1897562

Deh Cac Can, Julia Ecks, R. F. Ree, Ferdinando Mora, Moss Eisenberg Sweedler

Publication date: 7 July 1997

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/aab49f22ed522d16111eca29ae8d5f47323de258

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (8)

Polly cracker, revisited ⋮ A global view of residues in the torus ⋮ Mathematicians who never were ⋮ Lattice polly cracker cryptosystems ⋮ Polly Two: a new algebraic polynomial-based public-key scheme ⋮ Gröbner basis cryptosystems ⋮ Incomplete Gröbner basis as a preconditioner for polynomial systems ⋮ Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures

This page was built for publication: Why you cannot even hope to use Gröbner bases in public key cryptography: An open letter to a scientist who failed and a challenge to those who have not yet failed