| 2008 |
|---|
| 53 | EE | Andrew Klapper:
Expected pi-Adic Security Measures of Sequences.
SETA 2008: 219-229 |
| 52 | EE | Mark Goresky,
Andrew Klapper:
Some Results on the Arithmetic Correlation of Sequences.
SETA 2008: 71-80 |
| 2007 |
|---|
| 51 | EE | Ramakanth Kavuluru,
Andrew Klapper:
On the k -Operation Linear Complexity of Periodic Sequences.
INDOCRYPT 2007: 322-330 |
| 50 | EE | Andrew Klapper:
The Asymptotic Behavior of pi-Adic Complexity with pi2 = - 2.
SSC 2007: 134-146 |
| 2006 |
|---|
| 49 | EE | Mark Goresky,
Andrew Klapper:
Periodicity and Distribution Properties of Combined FCSR Sequences.
SETA 2006: 334-341 |
| 48 | EE | Mark Goresky,
Andrew Klapper:
Pseudonoise sequences based on algebraic feedback shift registers.
IEEE Transactions on Information Theory 52(4): 1649-1662 (2006) |
| 47 | EE | Andrew Klapper:
Linear Complexity of Sequences under Different Interpretations.
IEICE Transactions 89-A(9): 2254-2257 (2006) |
| 2004 |
|---|
| 46 | EE | Andrew Klapper:
Algebraic Feedback Shift Registers Based on Function Fields.
SETA 2004: 282-297 |
| 45 | EE | Andrew Klapper:
A Survey of Feedback with Carry Shift Registers.
SETA 2004: 56-71 |
| 44 | EE | Andrew Klapper,
Jinzhong Xu:
Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes.
Des. Codes Cryptography 31(3): 227-250 (2004) |
| 43 | EE | Mark Goresky,
Andrew Klapper:
Periodicity and Correlation Properties of d-FCSR Sequences.
Des. Codes Cryptography 33(2): 123-148 (2004) |
| 42 | | Andrew Klapper:
Improved multicovering bounds from linear inequalities and supercodes.
IEEE Transactions on Information Theory 20(3): 532-536 (2004) |
| 41 | | Andrew Klapper,
Claude Cartel:
Spectral methods for cross correlations of geometric sequences.
IEEE Transactions on Information Theory 50(1): 229-232 (2004) |
| 40 | EE | Andrew Klapper:
Distributional properties of d-FCSR sequences.
J. Complexity 20(2-3): 305-317 (2004) |
| 39 | EE | Mark Goresky,
Andrew Klapper,
Ram Murty,
Igor Shparlinski:
On Decimations of l-Sequences.
SIAM J. Discrete Math. 18(1): 130-140 (2004) |
| 2003 |
|---|
| 38 | EE | 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 |
|---|
| 37 | | Mark Goresky,
Andrew Klapper:
Fibonacci and Galois representations of feedback-with-carry shift registers.
IEEE Transactions on Information Theory 48(11): 2826-2836 (2002) |
| 36 | EE | Iiro S. Honkala,
Andrew Klapper:
Multicovering Bounds from Relative Covering Radii.
SIAM J. Discrete Math. 15(2): 228-234 (2002) |
| 2001 |
|---|
| 35 | | 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) |
| 34 | EE | Andrew Klapper:
Multicovering Bounds from Linear Inequalities (Extended Abstract).
Electronic Notes in Discrete Mathematics 6: 25-34 (2001) |
| 33 | | 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) |
| 32 | EE | Andrew Klapper:
On the Existence of Secure Keystream Generators.
J. Cryptology 14(1): 1-15 (2001) |
| 2000 |
|---|
| 31 | | 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) |
| 1999 |
|---|
| 30 | | Andrew Klapper:
Improved lower bounds for multicovering codes.
IEEE Transactions on Information Theory 45(7): 2532-2534 (1999) |
| 29 | EE | Andrew Klapper,
Jinzhong Xu:
Algebraic Feedback Shift Registers.
Theor. Comput. Sci. 226(1-2): 61-92 (1999) |
| 1997 |
|---|
| 28 | | Andrew Klapper:
Cross-Correlations of Quadratic Form Sequences in Odd Characteristic.
Des. Codes Cryptography 11(3): 289-305 (1997) |
| 27 | | Mark Goresky,
Andrew Klapper:
Arithmetic crosscorrelations of feedback with carry shift register sequences.
IEEE Transactions on Information Theory 43(4): 1342-1345 (1997) |
| 26 | | Andrew Klapper:
The multicovering radii of codes.
IEEE Transactions on Information Theory 43(4): 1372-1377 (1997) |
| 25 | | Andrew Klapper,
Mark Goresky:
Feedback Shift Registers, 2-Adic Span, and Combiners with Memory.
J. Cryptology 10(2): 111-147 (1997) |
| 1996 |
|---|
| 24 | EE | Andrew Klapper:
On the Existence of Secure Feedback Registers (Extended Abstract).
EUROCRYPT 1996: 256-267 |
| 23 | | Andrew Klapper:
Partial period crosscorrelations of geometric sequences.
IEEE Transactions on Information Theory 42(1): 256-260 (1996) |
| 22 | | Andrew Klapper:
Large families of sequences with near-optimal correlations and large linear span.
IEEE Transactions on Information Theory 42(4): 1241-1248 (1996) |
| 1995 |
|---|
| 21 | EE | Andrew Klapper,
Mark Goresky:
Cryptoanalysis Based on 2-Adic Rational Approximation.
CRYPTO 1995: 262-273 |
| 20 | EE | Andrew Klapper,
Mark Goresky:
Large Periods Nearly de Bruijn FCSR Sequences.
EUROCRYPT 1995: 263-273 |
| 19 | | 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) |
| 1994 |
|---|
| 18 | EE | Mark Goresky,
Andrew Klapper:
Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract).
EUROCRYPT 1994: 215-222 |
| 17 | | Andrew Klapper:
Feedback with Carry Shift Registers over Finite Fields (extended abstract).
FSE 1994: 170-178 |
| 16 | | Andrew Klapper,
Mark Goresky:
Partial period autocorrelations of geometric sequences.
IEEE Transactions on Information Theory 40(2): 494-502 (1994) |
| 15 | | Andrew Klapper:
The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic.
J. Cryptology 7(1): 33-51 (1994) |
| 14 | | Luke O'Connor,
Andrew Klapper:
Algebraic Nonlinearity and Its Applications to Cryptography.
J. Cryptology 7(4): 213-227 (1994) |
| 1993 |
|---|
| 13 | | Andrew Klapper,
Mark Goresky:
2-Adic Shift Registers.
FSE 1993: 174-178 |
| 12 | | Andrew Klapper:
Cross-Correlations of Geometric Sequences in Characteristic Two.
Des. Codes Cryptography 3(4): 347-377 (1993) |
| 11 | EE | 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) |
| 10 | | Andrew Klapper,
Agnes Hui Chan,
Mark Goresky:
Cascaded GMW sequences.
IEEE Transactions on Information Theory 39(1): 177-183 (1993) |
| 1992 |
|---|
| 9 | | Andrew Klapper:
The Vulnerability of Geometric Sequences Based on Fields on Odd Characteristic.
AUSCRYPT 1992: 327-338 |
| 8 | | Andrew Klapper:
Distributed Event Algebras.
J. Comput. Syst. Sci. 44(3): 411-424 (1992) |
| 1991 |
|---|
| 7 | | Andrew Klapper,
Mark Goresky:
Revealing Information with Partial Period Correlations (Extended Abstract).
ASIACRYPT 1991: 277-287 |
| 6 | | Margaret M. Bayer,
Andrew Klapper:
A New Index for Polytopes.
Discrete & Computational Geometry 6: 33-47 (1991) |
| 1990 |
|---|
| 5 | EE | Agnes Hui Chan,
Mark Goresky,
Andrew Klapper:
Correlation Functions of Geometric Sequences.
EUROCRYPT 1990: 214-221 |
| 4 | | Agnes Hui Chan,
Mark Goresky,
Andrew Klapper:
On the linear complexity of feedback registers.
IEEE Transactions on Information Theory 36(3): 640- (1990) |
| 1989 |
|---|
| 3 | EE | Agnes Hui Chan,
Mark Goresky,
Andrew Klapper:
On the Linear Complexity of Feedback Registers (Extended Abstract).
EUROCRYPT 1989: 563-570 |
| 2 | | Andrew Klapper:
Generalized Lowness and Highness and Probabilistic Complexity Classes.
Mathematical Systems Theory 22(1): 37-45 (1989) |
| 1987 |
|---|
| 1 | | Andrew Klapper:
A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra.
Inf. Process. Lett. 25(3): 159-161 (1987) |
