A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra. - Andrew Klapper (Inf. Process. Lett., 1987)

On the Linear Complexity of Feedback Registers (Extended Abstract). - Agnes Hui Chan; Mark Goresky; Andrew Klapper (EUROCRYPT, 1989)

Generalized Lowness and Highness and Probabilistic Complexity Classes. - Andrew Klapper (Math. Syst. Theory, 1989)

Correlation Functions of Geometric Sequences. - Agnes Hui Chan; Mark Goresky; Andrew Klapper (EUROCRYPT, 1990)

On the linear complexity of feedback registers. - Agnes Hui Chan; Mark Goresky; Andrew Klapper (IEEE Trans. Inf. Theory, 1990)

Revealing Information with Partial Period Correlations (Extended Abstract). - Andrew Klapper; Mark Goresky (ASIACRYPT, 1991)

A New Index for Polytopes. - Margaret M. Bayer; Andrew Klapper (Discret. Comput. Geom., 1991)

Distributed Event Algebras. - Andrew Klapper (J. Comput. Syst. Sci., 1992)

2-Adic Shift Registers. - Andrew Klapper; Mark Goresky (FSE, 1993)

Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences. - Andrew Klapper; Agnes Hui Chan; Mark Goresky (Discret. Appl. Math., 1993)

Cross-Correlations of Geometric Sequences in Characteristic Two. - Andrew Klapper (Des. Codes Cryptogr., 1993)

Cascaded GMW sequences. - Andrew Klapper; Agnes Hui Chan; Mark Goresky (IEEE Trans. Inf. Theory, 1993)

Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract). - Mark Goresky; Andrew Klapper (EUROCRYPT, 1994)

Feedback with Carry Shift Registers over Finite Fields (extended abstract). - Andrew Klapper (FSE, 1994)

The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic. - Andrew Klapper (J. Cryptol., 1994)

Algebraic Nonlinearity and Its Applications to Cryptography. - Luke O'Connor; Andrew Klapper (J. Cryptol., 1994)

Partial period autocorrelations of geometric sequences. - Andrew Klapper; Mark Goresky (IEEE Trans. Inf. Theory, 1994)

Cryptanalysis Based on 2-Adic Rational Approximation. - Andrew Klapper; Mark Goresky (CRYPTO, 1995)

Large Periods Nearly de Bruijn FCSR Sequences. - Andrew Klapper; Mark Goresky (EUROCRYPT, 1995)

d-form sequences: families of sequences with low correlation values and large linear spans. - Andrew Klapper (IEEE Trans. Inf. Theory, 1995)

On the Existence of Secure Feedback Registers (Extended Abstract). - Andrew Klapper (EUROCRYPT, 1996)

Partial period crosscorrelations of geometric sequences. - Andrew Klapper (IEEE Trans. Inf. Theory, 1996)

Large families of sequences with near-optimal correlations and large linear span. - Andrew Klapper (IEEE Trans. Inf. Theory, 1996)

Cross-Correlations of Quadratic Form Sequences in Odd Characteristic. - Andrew Klapper (Des. Codes Cryptogr., 1997)

Feedback Shift Registers, 2-Adic Span, and Combiners with Memory. - Andrew Klapper; Mark Goresky (J. Cryptol., 1997)

Arithmetic crosscorrelations of feedback with carry shift register sequences. - Mark Goresky; Andrew Klapper (IEEE Trans. Inf. Theory, 1997)

The multicovering radii of codes. - Andrew Klapper (IEEE Trans. Inf. Theory, 1997)

Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract). - Iiro S. Honkala; Andrew Klapper (SETA, 1998)

Feedback with Carry Shift Registers over Z / (N). - Jinzhong Xu; Andrew Klapper (SETA, 1998)

Pseudorandom Sequences and Stream Ciphers. - Andrew Klapper (Algorithms and Theory of Computation Handbook, 1999)

Algebraic Feedback Shift Registers. - Andrew Klapper; Jinzhong Xu (Theor. Comput. Sci., 1999)

Improved lower bounds for multicovering codes. - Andrew Klapper (IEEE Trans. Inf. Theory, 1999)

Fourier transforms and the 2-adic span of periodic binary sequences. - Mark Goresky; Andrew Klapper; Lawrence C. Washington (IEEE Trans. Inf. Theory, 2000)

On the Distinctness of Decimations of ℓ-Sequences. - Mark Goresky; Andrew Klapper; Ram Murty (SETA, 2001)

Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. - Iiro S. Honkala; Andrew Klapper (Des. Codes Cryptogr., 2001)

Multicovering Bounds from Linear Inequalities (Extended Abstract). - Andrew Klapper (Electron. Notes Discret. Math., 2001)

On the Existence of Secure Keystream Generators. - Andrew Klapper (J. Cryptol., 2001)

On correlations of a family of generalized geometric sequences. - Wei Sun; Andrew Klapper; Yixian Yang (IEEE Trans. Inf. Theory, 2001)

Multicovering Bounds from Relative Covering Radii. - Iiro S. Honkala; Andrew Klapper (SIAM J. Discret. Math., 2002)

Fibonacci and Galois representations of feedback-with-carry shift registers. - Mark Goresky; Andrew Klapper (IEEE Trans. Inf. Theory, 2002)

Efficient multiply-with-carry random number generators with maximal period. - Mark Goresky; Andrew Klapper (ACM Trans. Model. Comput. Simul., 2003)

Pseudonoise sequences based on algebraic function fields. - Andrew Klapper (ISIT, 2004)

A Survey of Feedback with Carry Shift Registers. - Andrew Klapper (SETA, 2004)

Algebraic Feedback Shift Registers Based on Function Fields. - Andrew Klapper (SETA, 2004)

Periodicity and Correlation Properties of d-FCSR Sequences. - Mark Goresky; Andrew Klapper (Des. Codes Cryptogr., 2004)

Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes. - Andrew Klapper; Jinzhong Xu (Des. Codes Cryptogr., 2004)

Distributional properties of d-FCSR sequences. - Andrew Klapper (J. Complex., 2004)

On Decimations of l-Sequences. - Mark Goresky; Andrew Klapper; Ram Murty; Igor E. Shparlinski (SIAM J. Discret. Math., 2004)

Improved multicovering bounds from linear inequalities and supercodes. - Andrew Klapper (IEEE Trans. Inf. Theory, 2004)

Spectral methods for cross correlations of geometric sequences. - Andrew Klapper; Claude Carlet (IEEE Trans. Inf. Theory, 2004)

Periodicity and Distribution Properties of Combined FCSR Sequences. - Mark Goresky; Andrew Klapper (SETA, 2006)

Linear Complexity of Sequences under Different Interpretations. - Andrew Klapper (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Pseudonoise sequences based on algebraic feedback shift registers. - Mark Goresky; Andrew Klapper (IEEE Trans. Inf. Theory, 2006)

On the k -Operation Linear Complexity of Periodic Sequences. - Ramakanth Kavuluru; Andrew Klapper (INDOCRYPT, 2007)

The Asymptotic Behavior of pi-Adic Complexity with pi2 = - 2. - Andrew Klapper (SSC, 2007)

The asymptotic behavior of N-adic complexity. - Andrew Klapper (Adv. Math. Commun., 2007)

Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences. - Ramakanth Kavuluru; Andrew Klapper (Selected Areas in Cryptography, 2008)

Some Results on the Arithmetic Correlation of Sequences. - Mark Goresky; Andrew Klapper (SETA, 2008)

The two covering radius of the two error correcting BCH code. - Andrew Klapper; Andrew Mertz (Adv. Math. Commun., 2009)

Lower bounds on error complexity measures for periodic LFSR and FCSR sequences. - Ramakanth Kavuluru; Andrew Klapper (Cryptogr. Commun., 2009)

A With-Carry Walsh Transform - (Extended Abstract). - Andrew Klapper; Mark Goresky (SETA, 2010)

Expected pi-adic security measures of sequences. - Andrew Klapper (IEEE Trans. Inf. Theory, 2010)

Statistical Properties of the Arithmetic Correlation of Sequences. - Mark Goresky; Andrew Klapper (Int. J. Found. Comput. Sci., 2011)

On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. - Nicholas Mattei; Judy Goldsmith; Andrew Klapper (FLAIRS, 2012)

Arithmetic Walsh Transform of Quadratic Boolean Functions - (Extended Abstract). - Andrew Klapper (SETA, 2012)

Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations. - Xiaoni Du; Andrew Klapper; Zhixiong Chen 002 (Inf. Process. Lett., 2012)

Arithmetic Correlations and Walsh Transforms. - Andrew Klapper; Mark Goresky (IEEE Trans. Inf. Theory, 2012)

Open Problems on With-Carry Sequence Generators. - Andrew Klapper (Open Problems in Mathematics and Computational Science, 2014)

Distribution Properties of Half- ell -Sequence. - Ting Gu; Andrew Klapper (SETA, 2014)

A New Transform Related to Distance from a Boolean Function (Extended Abstract). - Andrew Klapper (SETA, 2014)

A Lattice Rational Approximation Algorithm for AFSRs Over Quadratic Integer Rings. - Weihua Liu; Andrew Klapper (SETA, 2014)

On the arithmetic Walsh coefficients of Boolean functions. - Claude Carlet; Andrew Klapper (Des. Codes Cryptogr., 2014)

On the complexity of bribery and manipulation in tournaments with uncertain information. - Nicholas Mattei; Judy Goldsmith; Andrew Klapper; Martin Mundhenk (J. Appl. Log., 2015)

Statistical properties of half-ℓ-sequences. - Ting Gu; Andrew Klapper (Cryptogr. Commun., 2016)

A New Transform Related to Distance From a Boolean Function. - Andrew Klapper (IEEE Trans. Inf. Theory, 2016)

Editorial. - Francis N. Castro; Domingo Gómez-Pérez; Andrew Klapper; Ivelisse Rubio; Min Sha; Andrew Z. Tirkel (Adv. Math. Commun., 2017)

AFSRs synthesis with the extended Euclidean rational approximation algorithm. - Weihua Liu; Andrew Klapper (Adv. Math. Commun., 2017)

Correlation immune functions with respect to the q-transform. - Ting Gu; Zhixiong Chen 002; Andrew Klapper (Cryptogr. Commun., 2018)

Matrix parametrized shift registers. - Andrew Klapper (Cryptogr. Commun., 2018)

Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction. - Weihua Liu; Andrew Klapper; Zhixiong Chen 002 (Des. Codes Cryptogr., 2018)

On the Nonexistence of q-Bent Boolean Functions. - Andrew Klapper; Zhixiong Chen 002 (IEEE Trans. Inf. Theory, 2018)

On the q-bentness of Boolean functions. - Zhixiong Chen 002; Ting Gu; Andrew Klapper (Des. Codes Cryptogr., 2019)

On q-nearly bent Boolean functions. - Zhixiong Chen 002; Andrew Klapper (Discret. Appl. Math., 2020)