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.

• (with Alexandru Chirvasitu), Quadratic rotation symmetric Boolean functions, Discrete Applied Mathematics 343 (2024), 91-105
• (with Younhwan Cheon), The weight recursions for the 2-rotation symmetric quartic Boolean functions, Advances in Mathematics of Communications 17 (2023), 598-604.
• (with Alexandru Chirvasitu), Symbolic dynamics and rotation symmetric Boolean functions, Cryptography and Communications 14 (2022), 1091-1115.
• Simpler proof for nonlinearity of majority function, Discrete Applied Mathematics 297 (2021), 55-59.
• (with Younhwan Cheon), Weights for short quartic Boolean functions, Information Sciences 547 (2021), 18-27.
• (with Alexandru Chirvasitu), Affine equivalence for quadratic rotation symmetric Boolean functions, Designs, Codes and Cryptography 88 (2020), 1301-1329.
• (with Younhwan Cheon and Kelly Dougan), Theory of 2-rotation symmetric quartic Boolean Functions, Information Sciences 508 (2020), 358-379.
• Weight recursions for any rotation symmetric Boolean functions, IEEE Transactions on Information Theory 64 (2018), 2962-2968.