A Survey on Polly Cracker Systems

DOI10.1007/978-3-540-93806-4_16zbMath1177.94159OpenAlexW185004445MaRDI QIDQ3652823

Maria Grazia Marinari, Carlo Traverso, Ludovic Perret, Françoise Levy-dit-Vehel

Publication date: 16 December 2009

Published in: Gröbner Bases, Coding, and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93806-4_16

zbMATH Keywords

combinatorial-algebraic cryptosystemsPolly Cracker systems

Mathematics Subject Classification ID

Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Development of contemporary mathematics (01A65) History of information and communication theory (94-03) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (7)

Polly cracker, revisited ⋮ Mathematicians who never were ⋮ Cryptanalysis of the TRMS Signature Scheme of PKC’05 ⋮ Lattice polly cracker cryptosystems ⋮ Privacy-preserving data splitting: a combinatorial approach ⋮ Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures ⋮ Homomorphic Encryption

This page was built for publication: A Survey on Polly Cracker Systems