A Survey on Polly Cracker Systems

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

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

关键词:

摘要: In 1993 Boo Barkee and others have written a paper “Why you cannot even hope to use Grobner Bases in Public Key Cryptography: an open letter scientist who failed challenge those not yet failed.” Since 1994, further attempts been made, that gave rise several cryptosystems now known as Polly Cracker systems. None of these proposals successful, while are established tool for cryptanalysis, the still stands w.r.t. design point view. We outline description how all failed.

参考文章(51)
Rainer Steinwandt, Willi Geiselmann, Regine Endsuleit, Attacking a polynomial-based cryptosystem: Polly Cracker International Journal of Information Security. ,vol. 1, pp. 143- 148 ,(2002) , 10.1007/S10207-002-0012-2
Françoise Levy-dit-Vehel, Ludovic Perret, A Polly Cracker System Based on Satisfiability Birkhäuser, Basel. pp. 177- 192 ,(2004) , 10.1007/978-3-0348-7865-4_11
Olivier Billet, Jintai Ding, Overview of Cryptanalysis Techniques in Multivariate Public Key Cryptography Gröbner Bases, Coding, and Cryptography. pp. 263- 283 ,(2009) , 10.1007/978-3-540-93806-4_15
Ferruh Özbudak, Harald Niederreiter, "Coding, Cryptography and Combinatorics" ,(2012)
Pasqualina Conti, Carlo Traverso, Buchberger Algorithm and Integer Programming Applicable Algebra in Engineering, Communication and Computing. pp. 130- 139 ,(1991) , 10.1007/3-540-54522-0_102
Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu, Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems public key cryptography. ,vol. 1992, pp. 153- 164 ,(2001) , 10.1007/3-540-44586-2_11