Cryptanalysis based on 2-adic rational approximation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 963, Issue , 1995, Pages 262-273

  Klapper, Andrew ^a   Goresky, Mark ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

2 adic numbers; Binary sequences; Cryptanalysis; Feedback with carry shift registers; Rational approximation

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BINARY SEQUENCES; SHIFT REGISTERS;

2-ADIC NUMBERS; CRYPTANALYSIS; FEEDBACK WITH CARRY SHIFT REGISTER; RATIONAL APPROXIMATIONS; STREAM CIPHERS;

CRYPTOGRAPHY;

EID: 84957665414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44750-4_21     Document Type: Conference Paper

References (22)

1. E. Biham and A. Shamir: Differential Cryptanalysis of DES-like Cryptosystems, Journal of Cryptology, vol. 4, 1991, pp.3-72.
2. L. Blum, M. Blum, and M. Shub: A simple unpredictable pseudo-random number generator, Siam. J. Comput. vol. 15, pp. 364-383 (1986).
3. U. Cheng: On the continued fraction and Berlekamp's algorithm. IEEE Trans. Info. Theory vol. 30, 1984 pp. 541-544.
4. Z. D. Dai and K. C. Zeng: Continued fractions and the Berlekamp-Massey algorithm. Auscrypt '90, Springer Lecture Notes in Comp. Sci. vol. 453, Springer Verlag, N. Y., 1990.
5. S. Golomb: Shift Register Sequences. Aegean Park Press
6. R. T. Gregory and E. V. Krishnamurthy: Methods and Applications of Error-Free Computation, Springer Verlag, N. Y., 1984.
7. A. Klapper and M. Goresky: 2-Adic Shift Registers, Fast Software Encryption: Proceedings of 1993 Cambridge Security Workshop, Springer-Verlag LNCS, vol. 809, 1994, pp. 174-178.
8. A. Klapper, and M. Goresky: Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers, Proceedings, Eurocrypt 1994, Perugia, Italy
9. A. Klapper and M. Goresky: Feedback Shift Registers, Combiners with Memory, and Arithmetic Codes, University of Kentucky, Deptartment of Computer Science Technical Report No. 239-93.
10. A. Klapper: Feedback with Carry Shift Registers over Finite Fields, Proceedings of Leuven Algorithms Workshop, Leuven, Belgium, December, 1994.
11. N. Koblitz: p-Adic Numbers, p-Adic Analysis, and Zeta Functions. Graduate Texts in Mathematics Vol. 58, Springer Verlag, N. Y. 1984.
12. K. Mahler: On a geometrical representation of p-adic numbers, Ann. of Math. vol. 41, 1940 pp. 8-56.
13. D. Mandelbaum: An approach to an arithmetic analog of Berlekamp's algorithm. IEEE Trans. Info. Theory, vol. IT-30, 1984 pp. 758-762.
14. G. Marsaglia and A. Zaman: A new class of random number generators, Annals of Applied Probability, vol. 1, 1991 pp. 462-480.
15. J.L. Massey: Shift register sequences and BCH decoding, IEEE Transactions on Infoormation Theory, vol. IT-15, pp. 122-127, 1969.
16. J. Massey and R. Rueppel: Method of, and Apparatus for, Transforming a Digital Data Sequence into an Encoded Form, U.S. Patent No. 4,797,922, 1989.
17. W. H. Mills: Continued fractions and linear recurrences, Math. Comp. vol. 29, 1975, pp. 173-180
18. J. Pollard: The Fast Fourier Transform in a Finite Field, Math. Comp., vol. 25, 1971, pp. 365-374.
19. R. Rueppel: Analysis and Design of Stream Ciphers. Springer Verlag, New York, 1986.
20. A. Schönhage and V. Strassen: Schnelle Multiplikation Grosser Zahlen, Computing, vol. 7, 1971, pp. 281-292.
21. B. M. M. de Weger: Approximation lattices of p-adic numbers, J. Num. Th. vol. 24, 1986, pp. 70-88.
22. L. R. Welch and R. A. Scholtz: Continued fractions and Berlekamp's algorithm, IEEE Trans. Info. Theory, vol. 25, 1979 pp. 19-27.