The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew Klapper: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrew Klapper
    The Vulnerability of Geometric Sequences Based on Fields on Odd Characteristic. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1992, pp:327-338 [Conf]
  2. Andrew Klapper, Mark Goresky
    Revealing Information with Partial Period Correlations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1991, pp:277-287 [Conf]
  3. Andrew Klapper, Mark Goresky
    Cryptoanalysis Based on 2-Adic Rational Approximation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1995, pp:262-273 [Conf]
  4. Agnes Hui Chan, Mark Goresky, Andrew Klapper
    On the Linear Complexity of Feedback Registers (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:563-570 [Conf]
  5. Agnes Hui Chan, Mark Goresky, Andrew Klapper
    Correlation Functions of Geometric Sequences. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:214-221 [Conf]
  6. Mark Goresky, Andrew Klapper
    Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1994, pp:215-222 [Conf]
  7. Andrew Klapper
    On the Existence of Secure Feedback Registers (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1996, pp:256-267 [Conf]
  8. Andrew Klapper, Mark Goresky
    Large Periods Nearly de Bruijn FCSR Sequences. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1995, pp:263-273 [Conf]
  9. Andrew Klapper
    Feedback with Carry Shift Registers over Finite Fields (extended abstract). [Citation Graph (0, 0)][DBLP]
    Fast Software Encryption, 1994, pp:170-178 [Conf]
  10. Andrew Klapper, Mark Goresky
    2-Adic Shift Registers. [Citation Graph (0, 0)][DBLP]
    Fast Software Encryption, 1993, pp:174-178 [Conf]
  11. Mark Goresky, Andrew Klapper
    Periodicity and Distribution Properties of Combined FCSR Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:334-341 [Conf]
  12. Andrew Klapper
    A Survey of Feedback with Carry Shift Registers. [Citation Graph (0, 0)][DBLP]
    SETA, 2004, pp:56-71 [Conf]
  13. Andrew Klapper
    Algebraic Feedback Shift Registers Based on Function Fields. [Citation Graph (0, 0)][DBLP]
    SETA, 2004, pp:282-297 [Conf]
  14. Andrew Klapper, Agnes Hui Chan, Mark Goresky
    Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:1, pp:1-20 [Journal]
  15. Mark Goresky, Andrew Klapper
    Periodicity and Correlation Properties of d-FCSR Sequences. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:33, n:2, pp:123-148 [Journal]
  16. Iiro S. Honkala, Andrew Klapper
    Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:23, n:2, pp:131-146 [Journal]
  17. Andrew Klapper
    Cross-Correlations of Geometric Sequences in Characteristic Two. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1993, v:3, n:4, pp:347-377 [Journal]
  18. Andrew Klapper
    Cross-Correlations of Quadratic Form Sequences in Odd Characteristic. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:11, n:3, pp:289-305 [Journal]
  19. Andrew Klapper, Jinzhong Xu
    Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:3, pp:227-250 [Journal]
  20. Margaret M. Bayer, Andrew Klapper
    A New Index for Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:33-47 [Journal]
  21. Andrew Klapper
    A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:3, pp:159-161 [Journal]
  22. Andrew Klapper
    Distributional properties of d-FCSR sequences. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:305-317 [Journal]
  23. Andrew Klapper
    Distributed Event Algebras. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:3, pp:411-424 [Journal]
  24. Andrew Klapper
    On the Existence of Secure Keystream Generators. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2001, v:14, n:1, pp:1-15 [Journal]
  25. Andrew Klapper
    The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1994, v:7, n:1, pp:33-51 [Journal]
  26. Andrew Klapper, Mark Goresky
    Feedback Shift Registers, 2-Adic Span, and Combiners with Memory. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1997, v:10, n:2, pp:111-147 [Journal]
  27. Luke O'Connor, Andrew Klapper
    Algebraic Nonlinearity and Its Applications to Cryptography. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1994, v:7, n:4, pp:213-227 [Journal]
  28. Andrew Klapper
    Generalized Lowness and Highness and Probabilistic Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1989, v:22, n:1, pp:37-45 [Journal]
  29. Mark Goresky, Andrew Klapper, Ram Murty, Igor Shparlinski
    On Decimations of l-Sequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:130-140 [Journal]
  30. Iiro S. Honkala, Andrew Klapper
    Multicovering Bounds from Relative Covering Radii. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:228-234 [Journal]
  31. Andrew Klapper, Jinzhong Xu
    Algebraic Feedback Shift Registers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:226, n:1-2, pp:61-92 [Journal]
  32. Agnes Hui Chan, Mark Goresky, Andrew Klapper
    On the linear complexity of feedback registers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:640-0 [Journal]
  33. Mark Goresky, Andrew Klapper
    Fibonacci and Galois representations of feedback-with-carry shift registers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:11, pp:2826-2836 [Journal]
  34. Mark Goresky, Andrew Klapper
    Pseudonoise sequences based on algebraic feedback shift registers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:4, pp:1649-1662 [Journal]
  35. Mark Goresky, Andrew Klapper
    Arithmetic crosscorrelations of feedback with carry shift register sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1342-1345 [Journal]
  36. Mark Goresky, Andrew Klapper, Lawrence Washington
    Fourier transforms and the 2-adic span of periodic binary sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:687-691 [Journal]
  37. Andrew Klapper
    Improved lower bounds for multicovering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2532-2534 [Journal]
  38. Andrew Klapper, Claude Cartel
    Spectral methods for cross correlations of geometric sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:1, pp:229-232 [Journal]
  39. Andrew Klapper, Agnes Hui Chan, Mark Goresky
    Cascaded GMW sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:177-183 [Journal]
  40. Andrew Klapper, Mark Goresky
    Partial period autocorrelations of geometric sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:494-502 [Journal]
  41. Andrew Klapper
    Partial period crosscorrelations of geometric sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:256-260 [Journal]
  42. Andrew Klapper
    Large families of sequences with near-optimal correlations and large linear span. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1241-1248 [Journal]
  43. Andrew Klapper
    The multicovering radii of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1372-1377 [Journal]
  44. Andrew Klapper
    Improved multicovering bounds from linear inequalities and supercodes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:20, n:3, pp:532-536 [Journal]
  45. Andrew Klapper
    d-form sequences: families of sequences with low correlation values and large linear spans. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:423-431 [Journal]
  46. Wei Sun, Andrew Klapper, Yi Xian Yang
    On correlations of a family of generalized geometric sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2609-2618 [Journal]
  47. Mark Goresky, Andrew Klapper
    Efficient multiply-with-carry random number generators with maximal period. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Model. Comput. Simul., 2003, v:13, n:4, pp:310-321 [Journal]

  48. On the k -Operation Linear Complexity of Periodic Sequences. [Citation Graph (, )][DBLP]


  49. Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences. [Citation Graph (, )][DBLP]


  50. Some Results on the Arithmetic Correlation of Sequences. [Citation Graph (, )][DBLP]


  51. Expected pi-Adic Security Measures of Sequences. [Citation Graph (, )][DBLP]


  52. The Asymptotic Behavior of pi-Adic Complexity with pi2 = - 2. [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002