Some Algebraic Aspects of the Advanced Encryption Standard
暂无分享,去创建一个
[1] Eli Biham,et al. In How Many Ways Can You Write Rijndael? , 2002, ASIACRYPT.
[2] Claus Diem,et al. The XL-Algorithm and a Conjecture from Commutative Algebra , 2004, ASIACRYPT.
[3] Bo-Yin Yang,et al. Theoretical Analysis of XL over Small Fields , 2004, ACISP.
[4] Josef Pieprzyk,et al. Cryptanalysis of Block Ciphers with Overdefined Systems of Equations , 2002, ASIACRYPT.
[5] Matthew J. B. Robshaw,et al. Essential Algebraic Structure within the AES , 2002, CRYPTO.
[6] Sean Murphy,et al. Computational and Algebraic Aspects of the Advanced Encryption Standard , 2004 .
[7] Alex Biryukov,et al. Block Ciphers and Systems of Quadratic Equations , 2003, FSE.
[8] David A. Cox,et al. Ideals, Varieties, and Algorithms , 1997 .
[9] Niels Ferguson,et al. A Simple Algebraic Representation of Rijndael , 2001, Selected Areas in Cryptography.
[10] Sean Murphy. Comments on the Security of the AES and the XSL Technique , 2002 .
[11] Adi Shamir,et al. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations , 2000, EUROCRYPT.
[12] Jean Charles Faugère,et al. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.
[13] Vincent Rijmen,et al. The Design of Rijndael , 2002, Information Security and Cryptography.