AIDA Breaks BIVIUM (A&B) in 1 Minute Dual Core CPU Time
暂无分享,去创建一个
[1] J. Faugère. A new efficient algorithm for computing Gröbner bases (F4) , 1999 .
[2] Adi Shamir,et al. Cube Attacks on Tweakable Black Box Polynomials , 2009, IACR Cryptol. ePrint Arch..
[3] Chris Charnes,et al. An Algebraic Analysis of Trivium Ciphers based on the Boolean Satisfiability Problem , 2007, IACR Cryptol. ePrint Arch..
[4] Jean Charles Faugère,et al. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.
[5] Michael Vielhaber,et al. SPEEDING UP AIDA THE ALGEBRAIC IV DIFFERENTIAL ATTACK BY THE FAST REED-MULLER TRANSFORM , 2009 .
[6] J. Massey,et al. Communications and Cryptography: Two Sides of One Tapestry , 1994 .
[7] Sean O'Neil. Algebraic Structure Defectoscopy , 2007, IACR Cryptol. ePrint Arch..
[8] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[9] Shahram Khazaei,et al. Chosen IV Statistical Analysis for Key Recovery Attacks on Stream Ciphers , 2008, AFRICACRYPT.
[10] R. Drechsler,et al. Transformations amongst the Walsh, Haar, Arithmetic and Reed-Muller Spectral Domains , 2001 .
[11] Michael Vielhaber. Breaking ONE.FIVIUM by AIDA an Algebraic IV Differential Attack , 2007, IACR Cryptol. ePrint Arch..
[12] Meltem Sönmez Turan,et al. Linear Approximations for 2-round Trivium , 2007 .
[13] Wang Lei,et al. Chosen IV algebraic attack on One.Fivium , 2008, 2008 3rd International Conference on Intelligent System and Knowledge Engineering.