Non-linear Complexity of the Naor-Reingold Pseudo-random Function. - William D. Banks; Frances Griffin; Daniel Lieman; Igor E. Shparlinski (ICISC, 1999)

An Extremely Small and Efficient Identification Scheme. - William D. Banks; Daniel Lieman; Igor E. Shparlinski (ACISP, 2000)

Cryptographic Applications of Sparse Polynomials over Finite Rings. - William D. Banks; Daniel Lieman; Igor E. Shparlinski; Van Thuong To (ICISC, 2000)

An Identification Scheme Based on Sparse Polynomials. - William D. Banks; Daniel Lieman; Igor E. Shparlinski (Public Key Cryptography, 2000)

A Variant of NTRU with Non-invertible Polynomials. - William D. Banks; Igor E. Shparlinski (INDOCRYPT, 2002)

Number Theoretic Designs for Directed Regular Graphs of Small Diameter. - William D. Banks; Alessandro Conflitti; Igor E. Shparlinski (SIAM J. Discret. Math., 2004)

Prime divisors of palindromes. - William D. Banks; Igor E. Shparlinski (Period. Math. Hung., 2005)

Power Totients With Almost Primes. - William D. Banks; Florian Luca (Integers, 2011)

On Repeated Values of the Riemann Zeta Function on the Critical Line. - William D. Banks; Sarah Kang (Exp. Math., 2012)

On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields. - William D. Banks; Francesco Pappalardi; Igor E. Shparlinski (Exp. Math., 2012)

Optimal Primitive Sets with Restricted Primes. - William D. Banks; Greg Martin (Integers, 2013)

Every Natural Number is the Sum of Forty-nine Palindromes. - William D. Banks (Integers, 2016)

On Gauss sums and the evaluation of Stechkin's constant. - William D. Banks; Igor E. Shparlinski (Math. Comput., 2016)