L. Keliher, H. Meijer, and S. Tavares, "New method for upper bounding the maximum average linear hull probability for SPNs," Advances in Cryptology, Proceedings of Eurocrypt '01, LNCS  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Exact Maximum Expected Differential and Linear Probability for .. - Keliher, Sui (2005) Self-citation (Keliher) (Correct)
No context found.
L. Keliher, H. Meijer, and S. Tavares, New method for upper bounding the maximum average linear hull probability for SPNs, Advances in Cryptology--- EUROCRYPT
Completion of Computation of Improved Upper Bound on the .. - Keliher, Meijer, Tavares (2004) Self-citation (Keliher Meijer Tavares) (Correct)
No context found.
L. Keliher, H. Meijer, and S. Tavares, New method for upper bounding the maximum average linear hull probability for SPNs, Advances in Cryptology--- EUROCRYPT 2001, LNCS 2045, pp. 420--436, Springer-Verlag, 2001.
Improving the Upper Bound on the Maximum Average Linear.. - Keliher, Meijer, Tavares (2001) (3 citations) Self-citation (Keliher Meijer Tavares) (Correct)
....Tavares 2 1 Department of Computing and Information Science Queen s University at Kingston, Ontario, Canada, K7L 3N6 fkeliher,henkg cs.queensu.ca 2 Department of Electrical and Computer Engineering Queen s University at Kingston, Ontario, Canada, K7L 3N6 tavares ee.queensu.ca Abstract. In [15], Keliher et al. present a new method for upper bounding the maximum average linear hull probability (MALHP) for SPNs, a value which is required to make claims about provable security against linear cryptanalysis. Application of this method to Rijndael (AES) yields an upper bound of UB = 2 ....
....consider linear hulls instead of linear characteristics, and the maximum average linear hull probability (MALHP) instead of the ELCP of the best linear characteristic. Since the MALHP is difficult, if not infeasible, to compute exactly, researchers have adopted the approach of upper bounding it [2, 13, 15]. In [15] Keliher et al. present a new general method for upper bounding the MALHP for SPNs. They apply their method to Rijndael, obtaining an upper bound on the MALHP of UB = 2 Gamma75 when 7 or more rounds are approximated, corresponding to a lower bound on the data complexity of 32 UB = ....
[Article contains additional citation context not shown here]
L. Keliher, H. Meijer, and S. Tavares, New method for upper bounding the maximum average linear hull probability for SPNs, Advances in Cryptology--- EUROCRYPT
Probability Distributions of Correlation and Differentials in .. - Daemen, Rijmen (2005) (Correct)
No context found.
L. Keliher, H. Meijer, and S. Tavares, "New method for upper bounding the maximum average linear hull probability for SPNs," Advances in Cryptology, Proceedings of Eurocrypt '01, LNCS
Statistics of Correlation and Differentials in Block Ciphers - Daemen, Rijmen (2005) (Correct)
No context found.
L. Keliher, H. Meijer, and S. Tavares, "New method for upper bounding the maximum average linear hull probability for SPNs," Advances in Cryptology, Proceedings of Eurocrypt '01, LNCS
On the Differential and Linear Properties of Addition - Wallén (2003) (Correct)
No context found.
Liam Keliher, Henk Meijer, and Stafford Travares. New method for upper bounding the maximum average linear hull probability for SPNs. In Advances in Cryptology---Eurocrypt 2001.
On the Differential and Linear Properties of Addition - Wallén (2003) (Correct)
No context found.
Liam Keliher, Henk Meijer, and Stafford Travares. New method for upper bounding the maximum average linear hull probability for SPNs. In Advances in Cryptology---Eurocrypt 2001.
Cryptanalysis of Block Ciphers: A Survey - Standaert, Piret, al. (2003) (Correct)
No context found.
L.Keliher, H.Meijer, and S.Tavares, New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs, EuroCrypt 2001, LNCS 2045, p. 420 #.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC