Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrew Klapper
2010 – today
- 2012
[j41]Xiaoni Du, Andrew Klapper, Zhixiong Chen: Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations. Inf. Process. Lett. 112(6): 233-237 (2012)- [j40]Andrew Klapper, Mark Goresky: Arithmetic Correlations and Walsh Transforms. IEEE Transactions on Information Theory 58(1): 479-492 (2012)
- [c21]Nicholas Mattei, Judy Goldsmith, Andrew Klapper: On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. FLAIRS Conference 2012
- [c20]Andrew Klapper: Arithmetic Walsh Transform of Quadratic Boolean Functions - (Extended Abstract). SETA 2012: 65-76
- 2011
- [j39]Mark Goresky, Andrew Klapper: Statistical Properties of the Arithmetic Correlation of Sequences. Int. J. Found. Comput. Sci. 22(6): 1297-1315 (2011)
- 2010
- [j38]Andrew Klapper: Expected pi-adic security measures of sequences. IEEE Transactions on Information Theory 56(5): 2486-2501 (2010)
- [c19]Andrew Klapper, Mark Goresky: A With-Carry Walsh Transform - (Extended Abstract). SETA 2010: 217-228
2000 – 2009
- 2009
- [j37]Ramakanth Kavuluru, Andrew Klapper: Lower bounds on error complexity measures for periodic LFSR and FCSR sequences. Cryptography and Communications 1(1): 95-116 (2009)
- 2008
- [c18]Ramakanth Kavuluru, Andrew Klapper: Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences. Selected Areas in Cryptography 2008: 151-164
- [c17]Mark Goresky, Andrew Klapper: Some Results on the Arithmetic Correlation of Sequences. SETA 2008: 71-80
- [c16]
- 2007
- [c15]Ramakanth Kavuluru, Andrew Klapper: On the k -Operation Linear Complexity of Periodic Sequences. INDOCRYPT 2007: 322-330
- [c14]
- 2006
- [j36]Andrew Klapper: Linear Complexity of Sequences under Different Interpretations. IEICE Transactions 89-A(9): 2254-2257 (2006)
- [j35]Mark Goresky, Andrew Klapper: Pseudonoise sequences based on algebraic feedback shift registers. IEEE Transactions on Information Theory 52(4): 1649-1662 (2006)
- [c13]Mark Goresky, Andrew Klapper: Periodicity and Distribution Properties of Combined FCSR Sequences. SETA 2006: 334-341
- 2004
- [j34]Andrew Klapper, Jinzhong Xu: Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes. Des. Codes Cryptography 31(3): 227-250 (2004)
- [j33]Mark Goresky, Andrew Klapper: Periodicity and Correlation Properties of d-FCSR Sequences. Des. Codes Cryptography 33(2): 123-148 (2004)
- [j32]Andrew Klapper: Distributional properties of d-FCSR sequences. J. Complexity 20(2-3): 305-317 (2004)
- [j31]Mark Goresky, Andrew Klapper, Ram Murty, Igor Shparlinski: On Decimations of l-Sequences. SIAM J. Discrete Math. 18(1): 130-140 (2004)
- [j30]Andrew Klapper: Improved multicovering bounds from linear inequalities and supercodes. IEEE Transactions on Information Theory 20(3): 532-536 (2004)
- [j29]Andrew Klapper, Claude Carlet: Spectral methods for cross correlations of geometric sequences. IEEE Transactions on Information Theory 50(1): 229-232 (2004)
- [c12]
- [c11]
- 2003
- [j28]Mark Goresky, Andrew Klapper: Efficient multiply-with-carry random number generators with maximal period. ACM Trans. Model. Comput. Simul. 13(4): 310-321 (2003)
- 2002
- [j27]Iiro S. Honkala, Andrew Klapper: Multicovering Bounds from Relative Covering Radii. SIAM J. Discrete Math. 15(2): 228-234 (2002)
- [j26]Mark Goresky, Andrew Klapper: Fibonacci and Galois representations of feedback-with-carry shift registers. IEEE Transactions on Information Theory 48(11): 2826-2836 (2002)
- 2001
- [j25]Iiro S. Honkala, Andrew Klapper: Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. Des. Codes Cryptography 23(2): 131-146 (2001)
- [j24]Andrew Klapper: Multicovering Bounds from Linear Inequalities (Extended Abstract). Electronic Notes in Discrete Mathematics 6: 25-34 (2001)
- [j23]
- [j22]Wei Sun, Andrew Klapper, Yi Xian Yang: On correlations of a family of generalized geometric sequences. IEEE Transactions on Information Theory 47(6): 2609-2618 (2001)
- 2000
- [j21]Mark Goresky, Andrew Klapper, Lawrence Washington: Fourier transforms and the 2-adic span of periodic binary sequences. IEEE Transactions on Information Theory 46(2): 687-691 (2000)
1990 – 1999
- 1999
- [j20]Andrew Klapper, Jinzhong Xu: Algebraic Feedback Shift Registers. Theor. Comput. Sci. 226(1-2): 61-92 (1999)
- [j19]Andrew Klapper: Improved lower bounds for multicovering codes. IEEE Transactions on Information Theory 45(7): 2532-2534 (1999)
- 1997
- [j18]Andrew Klapper: Cross-Correlations of Quadratic Form Sequences in Odd Characteristic. Des. Codes Cryptography 11(3): 289-305 (1997)
- [j17]Andrew Klapper, Mark Goresky: Feedback Shift Registers, 2-Adic Span, and Combiners with Memory. J. Cryptology 10(2): 111-147 (1997)
- [j16]Mark Goresky, Andrew Klapper: Arithmetic crosscorrelations of feedback with carry shift register sequences. IEEE Transactions on Information Theory 43(4): 1342-1345 (1997)
- [j15]Andrew Klapper: The multicovering radii of codes. IEEE Transactions on Information Theory 43(4): 1372-1377 (1997)
- 1996
- [j14]Andrew Klapper: Partial period crosscorrelations of geometric sequences. IEEE Transactions on Information Theory 42(1): 256-260 (1996)
- [j13]Andrew Klapper: Large families of sequences with near-optimal correlations and large linear span. IEEE Transactions on Information Theory 42(4): 1241-1248 (1996)
- [c10]Andrew Klapper: On the Existence of Secure Feedback Registers (Extended Abstract). EUROCRYPT 1996: 256-267
- 1995
- [j12]Andrew Klapper: d-form sequences: families of sequences with low correlation values and large linear spans. IEEE Transactions on Information Theory 41(2): 423-431 (1995)
- [c9]Andrew Klapper, Mark Goresky: Cryptoanalysis Based on 2-Adic Rational Approximation. CRYPTO 1995: 262-273
- [c8]Andrew Klapper, Mark Goresky: Large Periods Nearly de Bruijn FCSR Sequences. EUROCRYPT 1995: 263-273
- 1994
- [j11]Andrew Klapper: The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic. J. Cryptology 7(1): 33-51 (1994)
- [j10]Luke O'Connor, Andrew Klapper: Algebraic Nonlinearity and Its Applications to Cryptography. J. Cryptology 7(4): 213-227 (1994)
- [j9]Andrew Klapper, Mark Goresky: Partial period autocorrelations of geometric sequences. IEEE Transactions on Information Theory 40(2): 494-502 (1994)
- [c7]Mark Goresky, Andrew Klapper: Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract). EUROCRYPT 1994: 215-222
- [c6]Andrew Klapper: Feedback with Carry Shift Registers over Finite Fields (extended abstract). FSE 1994: 170-178
- 1993
- [j8]Andrew Klapper, Agnes Hui Chan, Mark Goresky: Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences. Discrete Applied Mathematics 46(1): 1-20 (1993)
- [j7]Andrew Klapper: Cross-Correlations of Geometric Sequences in Characteristic Two. Des. Codes Cryptography 3(4): 347-377 (1993)
- [j6]Andrew Klapper, Agnes Hui Chan, Mark Goresky: Cascaded GMW sequences. IEEE Transactions on Information Theory 39(1): 177-183 (1993)
- [c5]
- 1992
- [j5]
- [c4]Andrew Klapper: The Vulnerability of Geometric Sequences Based on Fields on Odd Characteristic. AUSCRYPT 1992: 327-338
- 1991
- [j4]Margaret M. Bayer, Andrew Klapper: A New Index for Polytopes. Discrete & Computational Geometry 6: 33-47 (1991)
- [c3]Andrew Klapper, Mark Goresky: Revealing Information with Partial Period Correlations (Extended Abstract). ASIACRYPT 1991: 277-287
- 1990
- [j3]Agnes Hui Chan, Mark Goresky, Andrew Klapper: On the linear complexity of feedback registers. IEEE Transactions on Information Theory 36(3): 640-644 (1990)
- [c2]Agnes Hui Chan, Mark Goresky, Andrew Klapper: Correlation Functions of Geometric Sequences. EUROCRYPT 1990: 214-221
1980 – 1989
- 1989
- [j2]Andrew Klapper: Generalized Lowness and Highness and Probabilistic Complexity Classes. Mathematical Systems Theory 22(1): 37-45 (1989)
- [c1]Agnes Hui Chan, Mark Goresky, Andrew Klapper: On the Linear Complexity of Feedback Registers (Extended Abstract). EUROCRYPT 1989: 563-570
- 1987
- [j1]Andrew Klapper: A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra. Inf. Process. Lett. 25(3): 159-161 (1987)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-19 13:21 CET by the dblp team