Quantum Grover Attack on the Simplified-AES
暂无分享,去创建一个
Rosni Abdullah | Azman Samsudin | Mishal Almazrooie | Kussay N. Mutter | A. Samsudin | R. Abdullah | K. N. Mutter | Mishal Almazrooie
[1] M. Anwar Hasan,et al. Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m) , 2004, IEEE Transactions on Computers.
[2] Christof Paar,et al. Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes , 2002, Des. Codes Cryptogr..
[3] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[4] Guowu Yang,et al. A Synthesis Method of Quantum Reversible Logic Circuit Based on Elementary Qutrit Quantum Logic Gates , 2015, J. Circuits Syst. Comput..
[5] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[6] H. Ishizuka,et al. Quantum cryptanalysis of block ciphers (Algebraic Systems, Formal Languages and Computations) , 2000 .
[7] Ashraf Bhery,et al. Cryptanalysis of Simplified-AES Using Intelligent Agent , 2015, HAIS.
[8] Colin P. Williams. Explorations in Quantum Computing, Second Edition , 2011, Texts in Computer Science.
[9] Andris Ambainis,et al. Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.
[10] Dhiraj K. Pradhan,et al. On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography , 2007, TQC.
[11] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[12] Isaac L. Chuang,et al. Quantum Computation and Quantum Information (10th Anniversary edition) , 2011 .
[13] T. Itoh,et al. A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..
[14] Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.
[15] Peter W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1999 .
[16] Edward F. Schaefer,et al. A SIMPLIFIED AES ALGORITHM AND ITS LINEAR AND DIFFERENTIAL CRYPTANALYSES , 2003, Cryptologia.
[17] Martin Roetteler,et al. A note on quantum related-key attacks , 2013, Inf. Process. Lett..
[18] Daniel R. Simon,et al. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[19] E. Rieffel,et al. Quantum Computing: A Gentle Introduction , 2011 .
[20] John P. Hayes,et al. Optimal synthesis of linear reversible circuits , 2008, Quantum Inf. Comput..
[21] N. Mermin. Quantum Computer Science: An Introduction , 2007 .
[22] 山村 明弘,et al. Quantum cryptanalysis of block ciphers (Algebraic Systems, Formal Languages and Computations) , 2000 .
[23] Martin Gennis,et al. Explorations in Quantum Computing , 2001, Künstliche Intell..
[24] Marc Kaplan,et al. Quantum attacks against iterated block ciphers , 2014, ArXiv.
[25] Sean Simmons,et al. Algebraic Cryptanalysis of Simplified AES* , 2009, Cryptologia.
[26] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[27] Tanja Lange,et al. Post-quantum cryptography , 2008, Nature.
[28] William Smith,et al. Linear Cryptanalysis of Simplified AES Under Change of S-Box , 2013, Cryptologia.