How to break gifford’s cipher

Cryptologia

Volumn 21, Issue 3, 1997, Pages 237-286

  Cain, Thomas R ^a,b   Sherman, Alan T ^a,c  

^a University of Marylandw Baltimore County   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Algorithms over finite fields; Boston community information system (bcis); Correlation attack; Cryptanalysis; Cryptography; Cryptology; Filter generators; Gifford s cipher; Linear algebra over gf(2); Linear feedback shift registers (lfsrs); Matrix decompositions; Primary rational canonical form; Similar matrices; Similarity transformations; Stream ciphers

Indexed keywords

EID: 84892242375     PISSN: 01611194     EISSN: 15581586     Source Type: Journal    
DOI: 10.1080/0161-119791885931     Document Type: Article

References (49)

1. Beker, Henry, and Fred Piper. 1982. Cipher Systems: The Protection of Communications. New York: John Wiley.
2. Berlekamp, Elwyn R. 1984. Algebraic Coding Theory. Laguna Hills, CA: Aegean Park Press.
3. Brickell, Ernest F., and Andrew M. Odlyzko. 1992. Cryptanalysis: A survey of recent results. In [47]. Chapter 10. 501-540.
4. Cain, Thomas R. 1993. How to break Gifford’s Cipher. CMSC-693 Project, Computer Science Department, University of Maryland Baltimore County. 57.
5. Cain, Thomas, and Alan T. Sherman. 1994. How to break Gifford’s Cipher. Technical Report TR CS-94-7, Computer Science Department, University of Maryland Baltimore County. 49.
6. Cain, Thomas, and Alan T. Sherman. 1994. How to break Gifford’s Cipher (extended abstract). In Second Annual ACM Conference on Computer and Communications Security. New York: ACM Press, 198-209.
7. Char, Bruce W., K. Geddes, G. Gonnet, B. Leong, M. Monagan, and S. Watt. 1992. First Leaves: A Tutorial Introduction to Maple V. New York: Springer-Verlag.
8. Chepyzhov, Vladimir, and Ben Smeets. 1991. On a fast correlation attack on certain stream ciphers. In Advances in Cryptology: Eurocrypt 91. New York: Springer-Verlag. 176-185.
9. Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest. 1990. Introduction to Algorithms. Cambridge MA, and New York: MIT Press and McGraw-Hill.
10. Cullen, Charles G. 1972. Matrices and Linear Transformations. Second edition. Reading MA: Addison-Wesley.
11. Dawson, Ed. 1990. Linear feedback shift registers and stream ciphers. In [34]. Chapter 8, 106-119.
12. Dawson, Ed, and Andrew Clark, 1994. Divide and conquer attacks on certain classes of stream ciphers. Cryptologia. 18(1): 25-40.
13. Forre, Rejane. 1989. A fast correlation attack on nonlinearly feedforward filtered shift-register sequences. In Advances in Cryptology: Eurocrypt ’89. New York: Springer-Verlag. 586-595.
14. Ganesan, Ravi, and Alan T. Sherman. 1993. Statistical techniques for language recognition: An introduction and guide for cryptanalysts. Cryptologia. 17(4): 321-366.
15. Ganesan, Ravi, and Alan T. Sherman. 1994. Statistical techniques for language recognition: An empirical study using real and simulated English. Cryp-tologia. 18(4): 289-331.
16. Gary, Michael R., and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman.
17. Giesbrecht, Mark. 1992. Fast algorithms for matrix normal forms. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. New York: ACM Press. 121-130.
18. Gifford, David K., Dawn Heitmann, David A. Segal, Robert G. Cote, Kendra Tanacea, and David E. Burmaster. 1987. Boston Community Information System 1986 experimental test results, Technical Report MIT/LCS/TR-397, MIT Laboratory for Computer Science.
19. Gilford, David K., John M. Lucassen, and Stephen T. Berlin. 1985. The application of digital broadcast communication to large scale information systems. IEEE Journal on Selected Areas in Communications. SAC-3(3): 457-467.
20. Gifford, David K., and David Andrew Segal. 1989. Boston Community Information System 1987-1988 experimental test results. Technical Report MIT/LCS/TR-422, MIT Laboratory for Computer Science.
21. Gill, Arthur. 1966. Linear Sequential Circuits: Analysis, Synthesis, and Applications. New York: McGraw-Hill.
22. Golic, Jovan Dj., and Miodrag J. Mihaljevic. 1991. A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance. Journal of Cryptology. 3(3): 201-212.
23. Gollmann, Dieter, and William G. Chambers. 1989. Clock-controlled shift registers: A review. IEEE Journal on Selected Areas in Communications. 7(4): 525-533.
24. Golomb, Solomon. 1982. Shift Register Sequences. Laguna Hills, CA: Aegean Park Press.
25. Heilman, Martin E. 1980. A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory. IT-26(4): 401-406.
26. Hoffman, Kenneth, and Ray Kunze. 1971. Linear Algebra. Second edition. Englewood Cliffs: Prentice-Hall.
27. Hungerford, Thomas W. 1974. Algebra. New York: Springer-Verlag.
28. Jacob, Bill. 1990. Linear Algebra. New York: W. H. Freeman and Company.
29. Key, Edwin L. 1976. An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Transactions on Information Theory. IT-22(6): 732-736.
30. Klapper, Andrew. 1994. The vulnerability of geometric sequences based on fields of odd characteristic. Journal of Cryptology. 7(1): 33-51.
31. Knuth, Donald E. 1981. Seminumerical Algorithms in The Art of Computer Programming. Vol. 2, second edition. Reading MA: Addison-Wesley.
32. Koblitz, Neal. 1987. A Course in Number Theory and Cryptography. New York: Springer-Verlag.
33. Lomonaco, Samuel J. Jr. 1989. Factoring large integers by solving Boolean equations. Unpublished manuscript, Computer Science Department, University of Maryland Baltimore County.
34. Loxton, J. H., ed. 1990. Number Theory and Cryptography. London Mathematical Society Lecture Note Series, No. 154. Cambridge, Great Britain: Cambridge University Press.
35. Macsyma Reference Manual. Version ten. Mathlab Group, MIT Laboratory for Computer Science.
36. Marsh, R. W. 1957. Table of Irreducible Polynomials Over GF(2) Through Degree 19. Washington DC: National Security Agency.
37. Meier, Willi, and Othmar Stafelbach. 1989. Fast correlation attacks on certain stream ciphers. Journal of Cryptology. 1(3): 159-176.
38. Nivan, Ivan, and Herbert S. Zuckerman. 1980. An Introduction to the Theory of Numbers. New York: John Wiley.
39. Peterson, W. Wesley, and E. J. Weldon. 1972. Error-Correcting Codes. Cambridge MA: MIT Press.
40. Rhee, Man Young. 1994. Cryptography and Secure Communications. Singapore: McGraw-Hill.
41. Ronse, Christian. 1984. Feedback Shift Registers. Lecture Notes in Computer Science 169, G. Goos and J. Hartmanis, eds. Berlin: Springer-Verlag.
42. Rueppel, Rainer A. 1986. Analysis and Design of Stream Ciphers. New York: Springer-Verlag.
43. Rueppel, Rainer A. 1992. Stream ciphers. In [47]. Chapter 2. 65-134.
44. Shannon, Claude E. 1949. Communication theory of secrecy systems. Bell System Technical Journal. 28: 656-715.
45. Siegenthaler, T. 1985. Decrypting a class of stream ciphers using ciphertext only. IEEE Transactions on Computers. C-34(l): 81-85.
46. Siegenthaler, T. 1985. Cryptanalyst’s representation of nonlinearly filtered ML-sequences. Advances in Cryptology—Eurocrypt ’85, Springer-Verlag. 103-110.
47. Simmons, Gustavus J. Editor. 1992. Contemporary Cryptology: The Science of Information Integrity. Piscataway NJ: IEEE Press.
48. Watkins, David S. 1991. Fundamentals of Matrix Computations. New York: Wiley and Sons.
49. Zeng, Kencheng, Chung-Huang Yang, Dah-Yea Wei, and T. R. N. Rao. 1991. Pseudorandom bit generators in stream-cipher cryptography. Computer. 24(2): 8-17.