Liam Keliher's Publications

PhD Thesis

• Linear Cryptanalysis of Substitution-Permutation Networks,
  Liam Keliher, Ph.D. Thesis, Queen's University, Canada, 2003.  [PostScript(1.4MB),  PDF(770KB)]
  
  

Book Chapters

• Toward the true random cipher: On expected linear probability values for SPNs with randomly selected s-boxes,
  L. Keliher, H. Meijer, and S. Tavares, in Communications, Information and Network Security, V. Bhargava, H.V. Poor, V. Tarokh, and S. Yoon (Eds.), pp. 123–146, Kluwer Academic Publishers, 2003.  [PostScript,  PDF].
  
  

Refereed Papers

• Toward provable security against differential and linear cryptanalysis for Camellia and related ciphers,
  L. Keliher, International Journal of Network Security, Vol. 5, No. 2, pp. 167-175, Sept. 2007.  [PDF]
  
  
• Exact maximum expected differential and linear cryptanalysis for two-round Advanced Encryption Standard,
  L. Keliher and J. Sui, IET Information Security, Vol. 1, No. 2, pp. 53-57, June. 2007.  [PDF]
  
  
• Refined analysis of bounds related to linear and differential cryptanalysis for the AES,
  L. Keliher, Fourth Conference on the Advanced Encryption Standard (AES4), Lecture Notes in Computer Science, Vol. 3373, © Springer-Verlag, pp. 42-57, 2005.  [PostScript,  PDF]
  
  
• High probability linear hulls in Q,
  L. Keliher, H. Meijer, and S. Tavares, Proceedings of Second Open NESSIE Workshop, to appear in Lecture Notes in Computer Science volume for the NESSIE project, Springer-Verlag.  [PostScript,  PDF]
  
  
• Improving the upper bound on the maximum average linear hull probability for Rijndael,
  L. Keliher, H. Meijer, and S. Tavares, Eighth Annual International Workshop on Selected Areas in Cryptography (SAC 2001), Lecture Notes in Computer Science, Vol. 2259, © Springer-Verlag, pp. 112-128, 2001.  [PostScript,  PDF].
  
  
• New method for upper bounding the maximum average linear hull probability for SPNs,
  L. Keliher, H. Meijer, and S. Tavares, Advances in Cryptology--EUROCRYPT 2001, Lecture Notes in Computer Science, Vol. 2045, © Springer-Verlag, pp. 420-436, 2001. (© IACR)   [PDF]
  
  
• Modeling linear characteristics of substitution-permutation networks,
  L. Keliher, H. Meijer, and S. Tavares, Sixth Annual International Workshop on Selected Areas in Cryptography (SAC'99), Lecture Notes in Computer Science, Vol. 1758, © Springer-Verlag, pp. 78-91, 2000.  [PostScript,  PDF]
  
  
• A new substitution-permutation network cryptosystem using key-dependent s-boxes,
  L. Keliher, H. Meijer, and S. Tavares, Proceedings of Fourth International Workshop on Selected Areas in Cryptography (SAC'97), Carleton University, Canada, pp. 13-26, 1997.

Technical Reports

• Exact maximum expected differential and linear probability for 2-round Advanced Encryption Standard (AES),
  L. Keliher and J. Sui, IACR ePrint Archive, Paper # 2005/321.  [PDF]
  
  
• Completion of computation of improved upper bound on the maximum average linear hull probability for Rijndael,
  L. Keliher, H. Meijer, and S. Tavares, IACR ePrint Archive, Paper # 2004/074.  [PDF]
  
  
• Dual of new method for upper bounding the maximum average linear hull probability for SPNs,
  L. Keliher, H. Meijer, and S. Tavares, IACR ePrint Archive, Paper # 2001/033.  [PDF]