Thomas Cusick

Prof. Thomas Cusick

orcid

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 May 2005 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
TCThomas Cusick
Thomas Cusick
YLYuan Li
Yuan Li

1 January 2011 in Integers
Verified
Journal Article
Closed access
TCThomas Cusick
Thomas Cusick
YLYuan Li
Yuan Li
PSPantelimon Stănică
Pantelimon Stănică
Recently, Tu and Deng proposed a combinatorial conjecture about binary strings, and, on the assumption that the conjecture is correct, they obtained two classes of Boolean functions which are both algebraic immunity optimal, the first of which are also bent functions. The second class gives balanced functions, which have optimal algebraic degree and the best nonlinearity known up to now. In this paper, by using three different approaches, we prove the conjecture for many cases. We also propose some problems about the weight equations which are related to this conjecture. Because of the scattered distribution, we predict that an exact count is difficult to obtain, in general.

1 October 2012 in Journal of Mathematical Cryptology
Verified
Journal Article
Open access
PDF file
ABAlyssa Brown
Alyssa Brown
TCThomas Cusick
Thomas Cusick
: This paper studies degree 3 Boolean functions in n variables which are rotation symmetric, that is, invariant under any cyclic shift of the indices of the variables. These rotation symmetric functions have been extensively studied in the last dozen years or so because of their importance in cryptography. Let denote the (Hamming) weight of the Boolean function f . We extend and simplify results of Bileschi, Cusick and Padgett, who gave an algorithm for finding a recursion for the sequence , where is the cubic rotation symmetric function generated by the monomial We show that the weights for the function (note this is just the sum of the first terms in the definition of ) satisfy the same recursion as the weights for . We prove the recursion for the weights of by a method based on the work by Bileschi–Cusick–Padgett, but we are able to avoid a lot of the complications in their proofs. In particular, we do not need the technical notion of “ g terms” or the elaborate proof of similarity of certain matrices.

30 December 2011 in Cryptography and Communications
Verified
Journal Article
Closed access
PDF file
MBMaxwell L. Bileschi
Maxwell L. Bileschi
TCThomas Cusick
Thomas Cusick
DPDaniel Padgett
Daniel Padgett

1 December 2009 in Journal of Mathematical Cryptology
Verified
Journal Article
Open access
TCThomas Cusick
Thomas Cusick
YLYuan Li
Yuan Li
PSPantelimon Stănică
Pantelimon Stănică
We give some results towards the conjecture that are the only nonlinear balanced elementary symmetric polynomials over GF(2), where t and are any positive integers and X ( d, n ) = Σ 1≤ i 1 < i 2 <⋯< i d ≤ n x i 1 x i 2 ⋯ x i d .

31 May 2012 in Finite Fields and Their Applications
Verified
Journal Article
Closed access
TCThomas Cusick
Thomas Cusick
ABAlyssa Brown
Alyssa Brown