ACM Home Page
Please provide us with feedback. Feedback
How to break Gifford's cipher (extended abstract)
Full text PdfPdf (1.14 MB)
Source Conference on Computer and Communications Security archive
Proceedings of the 2nd ACM Conference on Computer and communications security table of contents
Fairfax, Virginia, United States
Pages: 198 - 209  
Year of Publication: 1994
ISBN:0-89791-732-4
Authors
Thomas R. Cain  Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland
Alan T. Sherman  Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland
Sponsor
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 22,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/191177.191227
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Beker, Henry; and Fred Piper, Cipher Systems: The Protection of Communications, John Wiley (New York, 1982).
 
2
Berlekamp, Elwyn R., Algebraic Coding Theory, Aegean Park Press (Laguna Hills, CA, 1984).
 
3
Brickell, Ernest F.; and Andrew M. Odlyzko, "Cryptanalysis: A survey of recent results" in {36}, Chapter 10 (1992), 501-540.
 
4
Cain, Thomas R., "How to break Gifford's cipher," CMSC-693 Project, Computer Science Department, University of Maryland Baltimore County (May 28, 1993). 57 pages.
 
5
Cain, Thomas R.; and Alan T. Sherman, "How to break Gifford's cipher" (June 2, 1994), submitted to Cryptologia. Available as Technical Report CS TR-94-07, University of Maryland Baltimore County. 49 pages.
 
6
Cain, Thomas R.; and Alan T. Sherman, "Cryptanalysis of filter generators using the rational canonical decomposition of the feedback function" (1994), in preparation.
 
7
 
8
Dawson, Ed; and Andrew Clark, "Divide and conquer attacks on certain classes of stream ciphers," Cryptologia, XVIII: 1 (January 1994), 25-40.
 
9
Ganesan, Ravi; and Alan T. Sherman, "Statistical techniques for language recognition: An introduction and guide for cryptanalysts," Cryptologia, XVII:4 (October 1993), 321-366.
 
10
Ganesan, Ravi; and Alan T. Sherman, "Statistical techniques for language recognition" An empirical study using real and simulated English" (September 27, 1993), Cryptologia, to appear.
 
11
Giesbrecht, Mark, "Fast algorithms for matrix normal forms" in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, ACM Press (1992), 121-130.
 
12
 
13
Gifford, David K.; John M. Lucassen; and Stephen T. Berlin, "The application of digital broadcast communication to large scale information systems," IEEE Journal on Selected Areas in Communications, SAC-3:3 (May 1985), 457-467.
 
14
 
15
Gill, Arthur, Linear Sequential Circuits: Analysis, Synthesis, and Applications, McGraw-Hill (New York, 1966).
 
16
Goli~, Jovan Dj.; and Miodrag J. Mihaljevi6, "A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance," Journal of Cryptology, 3:3 (1991), 201-212.
 
17
Gollmann, Dieter; and William G. Chambers, "Clock-controlled shift registers: A review," IEEE Journal on Selected Areas in Communications, 7:4 (May 1989), 525-533.
 
18
 
19
Hellman, Martin E., "A cryptanalytic timememory trade-off," IEEE Transactions on Information Theory, IT-26:4 (1980), 401-406.
 
20
Hoffman, Kenneth; and Ray Kunze, Linear Algebra, second edition, Prentice-Hall (1971).
 
21
Hungerford, Thomas W., Algebra, Springer-Verlag (New York, 1974).
 
22
Jacob, Bill, Linear Algebra, W. H. Freeman and Company (New York, 1990).
 
23
Key, Edwin L., "An analysis of the structure and complexity of nonlinear binary sequence generators," 1EEE Transactions on Information Theory, IT-22:6 (November 1976), 732-736.
 
24
Klapper, Andrew, "The vulnerability of geometric sequences based on fields of odd characteristic," Journal of Cryptology, 7:1 (winter 1994), 33-51.
 
25
 
26
 
27
Macsyma Reference Manual, version ten, Mathlab Group, MIT Laboratory for Computer Science (January 1983 ).
 
28
Marsh, R. W., Table of Irreducible Polynomials Over GF(2) Through Degree 19, National Security Agency (Washington D.C., 1957).
 
29
 
30
Peterson, W. Wesley; and E. J. Weldon, Error- Correcting Codes, MIT Press (Cambridge, Mass. 1972).
 
31
 
32
Rouse, Christian, Feedback Shift Registers, Lecture Notes in Computer Science 169, G. Goos and J. Hartmanis, eds., Springer-Verlag (Berlin, 1984).
 
33
 
34
Rueppel, Rainer A., "Stream ciphers" in {36}, Chapter 2 (1992), 65-134.
 
35
Siegenthaler, T., "Decrypting a class of stream ciphers using ciphertext only," IEEE Transactions on Computers, C-34:1 (January 1985), 81-85.
 
36
 
37


Collaborative Colleagues:
Thomas R. Cain: colleagues
Alan T. Sherman: colleagues