Liam Keliher

Associate Professor

Liam Keliher

Contact Information

E-mail
lkeliher@mta.ca
Phone
(506) 364-2534
Office
Dunn 223
Office hours
Other websites

I am an Associate Professor in the Department of Mathematics and Computer Science at Mount Allison University.  My research is primarily in cryptography, but I am also interested in algorithms and complexity.  I am the coach for Mount Allison's computer programming teams.

◯  2016-11-19:  Mount Allison advances to World Finals

Teaching

In 2008 I was awarded the J.E.A. Crake Teaching Award for the Faculty of Science.

Here are the Computer Science courses I have taught at Mount Allison:

  • COMP 1631: Introduction to Computer Science
  • COMP 1731: Programming Techniques and Algorithms
  • COMP 2611: Data Structures and Algorithms I
  • COMP 2631: Data Structures and Algorithms II
  • COMP 3611: Algorithm Analysis
  • COMP 3831: Computer Graphics
  • COMP 3851: Computers and Society
  • COMP 3911: Operating Systems
  • COMP 3971: Computer Organization and Architecture
  • COMP 4651: Cryptography
  • COMP 4951: Advanced Cryptography (Independent Study)
  • COMP 4951: Complexity Theory (Independent Study)
  • COMP 4951: Advanced Problem Solving (Independent Study)

I have also taught the following Mathematics courses:

  • MATH 1111: Calculus I
  • MATH 1121: Calculus II
  • MATH 2221: Linear Algebra

 

Publications

Here is a list of my research publications:

  • Dunkelman, O., and Keliher, L. (Eds.)  Revised Selected Papers, 22nd Annual International Workshop on Selected Areas in Cryptography (SAC 2015), Lecture Notes in Computer Science, Vol. 9566, Springer.
  • Keliher, L. Differential Cryptanalysis of the BSPN Block Cipher Structure, National Institute of Standards and Technology (NIST) Lightweight Cryptography Workshop 2015, Gaithersburg, USA.
  • Korstanje, K. and Keliher, L. Weak Keys and Plaintext Recovery for the Dhall-Pal Block Cipher, 20th IEEE Symposium on Computers and Communications (ISCC 2015), Larnaca, Cyprus, IEEE Press.
  • Colburn, M. and Keliher, L. Linear Cryptanalysis of the PP-1 and PP-2 Block Ciphers, 15th International Conference on Cryptology in India (Indocrypt 2014), Lecture Notes in Computer Science, Vol. 8885, Springer.
  • Keliher, L. and Delaney, A.Z. Cryptanalysis of the Toorani-Falahati Hill Ciphers, 18th IEEE Symposium on Computers and Communications (ISCC 2013), IEEE Press.
  • Keliher, L. and Thibodeau, S. Slide Attacks against Iterated Hill Ciphers, International Symposium on Security in Computing and Communications (SSCC 2013), Communications in Computer and Information Science, Vol. 377, Springer.
  • Vogel, D., Cudmore, M., Casiez, G., Balakrishnan, R., and Keliher, L.  Hand Occlusion with Tablet-Sized Direct Pen Input, CHI 2009, ACM CHI Proceedings on Human Factors in Computing Systems.
  • Avanzi, R., Keliher, L., and Sica, F. (Eds.)  Revised Selected Papers, 15th Annual International Workshop on Selected Areas in Cryptography (SAC 2008), Lecture Notes in Computer Science, Vol. 5381, Springer.
  • Keliher, L.  Toward Provable Security against Differential and Linear Cryptanalysis for Camellia and Related Ciphers, International Journal of Network Security (IJNS), Vol. 5, No. 2, pp. 167-175, Sept. 2007.
  • Keliher, L., and Sui, J.  Exact Maximum Expected Differential and Linear Cryptanalysis for Two-Round Advanced Encryption Standard, IET Information Security, Vol. 1, No. 2, pp. 53-57, June 2007.
  • Keliher, L.  Refined Analysis of Bounds Related to Linear and Differential Cryptanalysis for the AES, Fourth Conference on the Advanced Encryption Standard (AES4), Lecture Notes in Computer Science, Vol. 3373, pp. 42-57, Springer, 2005.
  • Keliher, L., Meijer, H., and Tavares, S.  Toward the True Random Cipher: On Expected Linear Probability Values for SPNs with Randomly Selected S-boxes, chapter in Communications, Information and Network Security, V. Bhargava, H. Poor, V. Tarokh, and S. Yoon (Eds.), pp. 123-146, Kluwer Academic, 2003.
  • Keliher, L., Meijer, H., and Tavares, S.  High Probability Linear Hulls in Q, Proceedings of Second Open NESSIE Workshop, Royal Holloway College, University of London, U.K., 2001.
  • Keliher, L., Meijer, H., and Tavares, S.  Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael, Eighth Workshop on Selected Areas in Cryptography (SAC 2001), Lecture Notes in Computer Science, Vol. 2259, pp. 112-128, Springer.
  • Keliher, L., Meijer, H., and Tavares, S.  New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs, Advances in Cryptology (EUROCRYPT 2001), Lecture Notes in Computer Science, Vol. 2045, pp. 420-436, Springer.
  • Keliher, L., Meijer, H., and Tavares, S.  Modeling Linear Characteristics of Substitution-Permutation Networks, Workshop on Selected Areas in cryptography (SAC 1999), Lecture Notes in Computer Science, Vol. 1758, pp. 78-91, Springer.

 

Education

PhD (Computer Science), Queen's University
MSc (Computer Science), Queen's University
MSc (Mathematics), McGill University
BSc Honours (Mathematics), St Francis Xavier University