Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael-Reference-Cited by-同舟云学术

Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael

Published:2001 Issue: Volume: Page:112-128
ISSN:0302-9743
Container-title:Selected Areas in Cryptography
language:
Short-container-title:

Author:

Keliher Liam,Meijer Henk,Tavares Stafford

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45537-X_9

Reference22 articles.

1. C.M. Adams, A formal and practical design procedure for substitution-permutation network cryptosystems, Ph.D. Thesis, Queen’s University, Kingston, Canada, 1990.

2. K. Aoki and K. Ohta, Strict evaluation of the maximum average of differential probability and the maximum average of linear probability, IEICE Trans. Fundamentals, Vol. E80-A, No. 1, January 1997.

3. Lect Notes Comput Sci;E. Biham,1995

4. E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, Vol. 4, No. 1, pp. 3–72, 1991.

5. Lect Notes Comput Sci;J. Daemen,1995

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The t-wise Independence of Substitution-Permutation Networks;Advances in Cryptology – CRYPTO 2021;2021

2. Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations;Advances in Cryptology – EUROCRYPT 2012;2012

3. ASC-1: An Authenticated Encryption Stream Cipher;Selected Areas in Cryptography;2012

4. Automatic Search of Attacks on Round-Reduced AES and Applications;Advances in Cryptology – CRYPTO 2011;2011

5. FPGA Implementation of a Statistical Saturation Attack against PRESENT;Lecture Notes in Computer Science;2011