PhD, Cambridge University, Cryptography, number theory and combinatorics
Cryptography, number theory, Diophantine approximation
Tom Cusick's research is in cryptography, especially Boolean function applications; number theory, particularly Diophantine approximation and algebraic number theory; and combinatorics.
Finding Hamming weights without looking at truth tables,
Cryptography and Communications
5 (2013), 7-18.
(with Younhwan Cheon) Affine equivalence of quartic homogeneous
rotation symmetric Boolean
functions, Information Sciences 259 (2014), 192-211.
(with K. V. Lakshmy and M. Sethumadhavan) Counting rotation symmetric functions using
Polya’s theorem, Discrete Applied Mathematics 169 (2014), 162-167.
(with Younhwan Cheon) Affine equivalence for cubic
rotation symmetric Boolean functions
with n = pq variables, Discrete Mathematics 327 (2014), 51-61.
(with Guangpu Gao and Wenfen Liu) Families of rotation symmetric
functions with useful
cryptographic properties, IET Information Security 8 (2014), 297-302.
(with Bryan Johns) Theory of 2-rotation symmetric cubic Boolean functions, Designs,
Codes and Cryptography 76 (2015), 113-133.
Permutation equivalence of cubic rotation symmetric functions, International Journal of
Computer Mathematics 92 (2015), 1568-1573.
(with Younhwan Cheon) Theory of 3-rotation symmetric cubic Boolean functions,
Journal of Mathematical Cryptology 9 (2015), 45-62
(with Bryan Johns) Recursion orders for weights of Boolean cubic rotation
symmetric functions, Discrete Applied Mathematics 186 (2015), 1-6.
(with P. Stanica) Counting equivalence classes for monomial rotation symmetric
Boolean functions with prime dimension, Cryptography and Communications 8
Highly nonlinear plateaued functions, IET Information Security accepted Apr 2016.