A Survey on Polly Cracker Systems

Françoise Levy-dit-Vehel (), Maria Grazia Marinari (), Ludovic Perret () and Carlo Traverso ()
Additional contact information
Françoise Levy-dit-Vehel: ENSTA
Maria Grazia Marinari: Università di Genova, DIMA
Ludovic Perret: Univ. Paris 06, CNRS, UMR 7606, LIP6, SALSA Project, INRIA, Centre Paris-Rocquencourt UPMC
Carlo Traverso: Università di Pisa, Dipartimento di Matematica “Leonida Tonelli”

A chapter in Gröbner Bases, Coding, and Cryptography, 2009, pp 285-305 from Springer

Abstract: Abstract In 1993 Boo Barkee and others have written a paper “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.” Since 1994, further attempts have been made, that gave rise to several cryptosystems now known as Polly Cracker systems. None of these proposals have been successful, and while Gröbner Bases are now an established tool for cryptanalysis, the challenge of Boo Barkee still stands w.r.t. the design point of view. We outline a description of how all these attempts have failed.

Keywords: Polly Cracker systems; Combinatorial-algebraic cryptosystems (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-93806-4_16

Ordering information: This item can be ordered from
http://www.springer.com/9783540938064

DOI: 10.1007/978-3-540-93806-4_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().