Andrew Klapper

Publication Activity (10 Years)

Years Active: 1987-2020
Publications (10 Years): 13

Top Topics

Boolean Functions

Extended Abstract

Prime Implicants

Top Venues

IEEE Trans. Inf. Theory

Des. Codes Cryptogr.

Cryptogr. Commun.

Publications

Zhixiong Chen, Andrew Klapper
On q-nearly bent Boolean functions. Discret. Appl. Math. 279 (2020)
Zhixiong Chen, Ting Gu, Andrew Klapper
On the q-bentness of Boolean functions. Des. Codes Cryptogr. 87 (1) (2019)
Zhixiong Chen, Andrew Klapper
On q-nearly bent Boolean functions. CoRR (2019)
Ting Gu, Zhixiong Chen, Andrew Klapper
Correlation immune functions with respect to the q-transform. Cryptogr. Commun. 10 (6) (2018)
Andrew Klapper, Zhixiong Chen
On the Nonexistence of q-Bent Boolean Functions. IEEE Trans. Inf. Theory 64 (4) (2018)
Andrew Klapper
Matrix parametrized shift registers. Cryptogr. Commun. 10 (2) (2018)
Weihua Liu, Andrew Klapper, Zhixiong Chen
Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction. Des. Codes Cryptogr. 86 (5) (2018)
Francis N. Castro, Domingo Gómez-Pérez, Andrew Klapper, Ivelisse Rubio, Min Sha, Andrew Z. Tirkel
Editorial. Adv. Math. Commun. 11 (2) (2017)
Weihua Liu, Andrew Klapper
AFSRs synthesis with the extended Euclidean rational approximation algorithm. Adv. Math. Commun. 11 (1) (2017)
Zhixiong Chen, Ting Gu, Andrew Klapper
On the q-Bentness of Boolean Functions. CoRR (2017)
Ting Gu, Andrew Klapper
Statistical properties of half-ℓ-sequences. Cryptogr. Commun. 8 (3) (2016)
Andrew Klapper
A New Transform Related to Distance From a Boolean Function. IEEE Trans. Inf. Theory 62 (5) (2016)
Nicholas Mattei, Judy Goldsmith, Andrew Klapper, Martin Mundhenk
On the complexity of bribery and manipulation in tournaments with uncertain information. J. Appl. Log. 13 (4) (2015)
Weihua Liu, Andrew Klapper
A Lattice Rational Approximation Algorithm for AFSRs Over Quadratic Integer Rings. SETA (2014)
Andrew Klapper
A New Transform Related to Distance from a Boolean Function (Extended Abstract). SETA (2014)
Claude Carlet, Andrew Klapper
On the arithmetic Walsh coefficients of Boolean functions. Des. Codes Cryptogr. 73 (2) (2014)
Ting Gu, Andrew Klapper
Distribution Properties of Half- \ell -Sequence. SETA (2014)
Xiaoni Du, Andrew Klapper, Zhixiong Chen
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations. Inf. Process. Lett. 112 (6) (2012)
Nicholas Mattei, Judy Goldsmith, Andrew Klapper
On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. FLAIRS Conference (2012)
Andrew Klapper, Mark Goresky
Arithmetic Correlations and Walsh Transforms. IEEE Trans. Inf. Theory 58 (1) (2012)
Andrew Klapper
Arithmetic Walsh Transform of Quadratic Boolean Functions - (Extended Abstract). SETA (2012)
Nicholas Scott Mattei, Judy Goldsmith, Andrew Klapper
On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. AAAI Fall Symposium: Machine Aggregation of Human Judgment (2012)
Mark Goresky, Andrew Klapper
Statistical Properties of the Arithmetic Correlation of Sequences. Int. J. Found. Comput. Sci. 22 (6) (2011)
Andrew Klapper, Mark Goresky
A With-Carry Walsh Transform - (Extended Abstract). SETA (2010)
Andrew Klapper
Expected pi-adic security measures of sequences. IEEE Trans. Inf. Theory 56 (5) (2010)
Andrew Klapper, Andrew Mertz
The two covering radius of the two error correcting BCH code. Adv. Math. Commun. 3 (1) (2009)
Ramakanth Kavuluru, Andrew Klapper
Lower bounds on error complexity measures for periodic LFSR and FCSR sequences. Cryptogr. Commun. 1 (1) (2009)
Mark Goresky, Andrew Klapper
Some Results on the Arithmetic Correlation of Sequences. SETA (2008)
Ramakanth Kavuluru, Andrew Klapper
-Periodic Binary Sequences. Selected Areas in Cryptography (2008)
Andrew Klapper
Expected pi-Adic Security Measures of Sequences. SETA (2008)
Ramakanth Kavuluru, Andrew Klapper
-Operation Linear Complexity of Periodic Sequences. INDOCRYPT (2007)
Andrew Klapper
= - 2. SSC (2007)
Andrew Klapper
The asymptotic behavior of N-adic complexity. Adv. Math. Commun. 1 (3) (2007)
Andrew Klapper
Linear Complexity of Sequences under Different Interpretations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2006)
Mark Goresky, Andrew Klapper
Periodicity and Distribution Properties of Combined FCSR Sequences. SETA (2006)
Andrew Klapper, Andrew Mertz
The Two Covering Radius of the Two Error Correcting BCH Code. ISIT (2006)
Mark Goresky, Andrew Klapper
Pseudonoise sequences based on algebraic feedback shift registers. IEEE Trans. Inf. Theory 52 (4) (2006)
Mark Goresky, Andrew Klapper, Ram Murty, Igor E. Shparlinski
On Decimations of l-Sequences. SIAM J. Discret. Math. 18 (1) (2004)
Mark Goresky, Andrew Klapper
-FCSR Sequences. Des. Codes Cryptogr. 33 (2) (2004)
Andrew Klapper
Pseudonoise sequences based on algebraic function fields. ISIT (2004)
Andrew Klapper
A Survey of Feedback with Carry Shift Registers. SETA (2004)
Andrew Klapper
Algebraic Feedback Shift Registers Based on Function Fields. SETA (2004)
Andrew Klapper, Claude Carlet
Spectral methods for cross correlations of geometric sequences. IEEE Trans. Inf. Theory 50 (1) (2004)
Andrew Klapper
Improved multicovering bounds from linear inequalities and supercodes. IEEE Trans. Inf. Theory 50 (3) (2004)
Andrew Klapper
-FCSR sequences. J. Complex. 20 (2-3) (2004)
Andrew Klapper, Jinzhong Xu
Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes. Des. Codes Cryptogr. 31 (3) (2004)
Mark Goresky, Andrew Klapper
Efficient multiply-with-carry random number generators with maximal period. ACM Trans. Model. Comput. Simul. 13 (4) (2003)
Iiro S. Honkala, Andrew Klapper
Multicovering Bounds from Relative Covering Radii. SIAM J. Discret. Math. 15 (2) (2002)
Mark Goresky, Andrew Klapper
Fibonacci and Galois representations of feedback-with-carry shift registers. IEEE Trans. Inf. Theory 48 (11) (2002)
Iiro S. Honkala, Andrew Klapper
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. Des. Codes Cryptogr. 23 (2) (2001)
Wei Sun, Andrew Klapper, Yixian Yang
On correlations of a family of generalized geometric sequences. IEEE Trans. Inf. Theory 47 (6) (2001)
Andrew Klapper
Multicovering Bounds from Linear Inequalities (Extended Abstract). Electron. Notes Discret. Math. 6 (2001)
Andrew Klapper
On the Existence of Secure Keystream Generators. J. Cryptol. 14 (1) (2001)
Mark Goresky, Andrew Klapper, Ram Murty
On the Distinctness of Decimations of ℓ-Sequences. SETA (2001)
Mark Goresky, Andrew Klapper, Lawrence C. Washington
Fourier transforms and the 2-adic span of periodic binary sequences. IEEE Trans. Inf. Theory 46 (2) (2000)
Andrew Klapper
Improved lower bounds for multicovering codes. IEEE Trans. Inf. Theory 45 (7) (1999)
Andrew Klapper, Jinzhong Xu
Algebraic Feedback Shift Registers. Theor. Comput. Sci. 226 (1-2) (1999)
Iiro S. Honkala, Andrew Klapper
Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract). SETA (1998)
Jinzhong Xu, Andrew Klapper
Feedback with Carry Shift Registers over Z / (N). SETA (1998)
Andrew Klapper
Cross-Correlations of Quadratic Form Sequences in Odd Characteristic. Des. Codes Cryptogr. 11 (3) (1997)
Mark Goresky, Andrew Klapper
Arithmetic crosscorrelations of feedback with carry shift register sequences. IEEE Trans. Inf. Theory 43 (4) (1997)
Andrew Klapper
The multicovering radii of codes. IEEE Trans. Inf. Theory 43 (4) (1997)
Andrew Klapper, Mark Goresky
Feedback Shift Registers, 2-Adic Span, and Combiners with Memory. J. Cryptol. 10 (2) (1997)
Andrew Klapper
Large families of sequences with near-optimal correlations and large linear span. IEEE Trans. Inf. Theory 42 (4) (1996)
Andrew Klapper
Partial period crosscorrelations of geometric sequences. IEEE Trans. Inf. Theory 42 (1) (1996)
Andrew Klapper
On the Existence of Secure Feedback Registers (Extended Abstract). EUROCRYPT (1996)
Andrew Klapper, Mark Goresky
Cryptanalysis Based on 2-Adic Rational Approximation. CRYPTO (1995)
Andrew Klapper
d-form sequences: families of sequences with low correlation values and large linear spans. IEEE Trans. Inf. Theory 41 (2) (1995)
Andrew Klapper, Mark Goresky
Large Periods Nearly de Bruijn FCSR Sequences. EUROCRYPT (1995)
Luke O'Connor, Andrew Klapper
Algebraic Nonlinearity and Its Applications to Cryptography. J. Cryptol. 7 (4) (1994)
Mark Goresky, Andrew Klapper
Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract). EUROCRYPT (1994)
Andrew Klapper, Mark Goresky
Partial period autocorrelations of geometric sequences. IEEE Trans. Inf. Theory 40 (2) (1994)
Andrew Klapper
The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic. J. Cryptol. 7 (1) (1994)
Andrew Klapper
Feedback with Carry Shift Registers over Finite Fields (extended abstract). FSE (1994)
Andrew Klapper, Agnes Hui Chan, Mark Goresky
Cascaded GMW sequences. IEEE Trans. Inf. Theory 39 (1) (1993)
Andrew Klapper, Agnes Hui Chan, Mark Goresky
Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences. Discret. Appl. Math. 46 (1) (1993)
Andrew Klapper
Cross-Correlations of Geometric Sequences in Characteristic Two. Des. Codes Cryptogr. 3 (4) (1993)
Andrew Klapper, Mark Goresky
2-Adic Shift Registers. FSE (1993)
Andrew Klapper
The Vulnerability of Geometric Sequences Based on Fields on Odd Characteristic. AUSCRYPT (1992)
Andrew Klapper
Distributed Event Algebras. J. Comput. Syst. Sci. 44 (3) (1992)
Margaret M. Bayer, Andrew Klapper
A New Index for Polytopes. Discret. Comput. Geom. 6 (1991)
Andrew Klapper, Mark Goresky
Revealing Information with Partial Period Correlations (Extended Abstract). ASIACRYPT (1991)
Agnes Hui Chan, Mark Goresky, Andrew Klapper
On the linear complexity of feedback registers. IEEE Trans. Inf. Theory 36 (3) (1990)
Agnes Hui Chan, Mark Goresky, Andrew Klapper
Correlation Functions of Geometric Sequences. EUROCRYPT (1990)
Agnes Hui Chan, Mark Goresky, Andrew Klapper
On the Linear Complexity of Feedback Registers (Extended Abstract). EUROCRYPT (1989)
Andrew Klapper
Generalized Lowness and Highness and Probabilistic Complexity Classes. Math. Syst. Theory 22 (1) (1989)
Andrew Klapper
A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra. Inf. Process. Lett. 25 (3) (1987)