Article

Free access

How to break Gifford's cipher (extended abstract)

Authors:

Thomas R. Cain,

Alan T. ShermanAuthors Info & Claims

CCS '94: Proceedings of the 2nd ACM Conference on Computer and communications security

Pages 198 - 209

https://doi.org/10.1145/191177.191227

Published: 02 November 1994 Publication History

PDF eReader

References

[1]

Beker, Henry; and Fred Piper, Cipher Systems: The Protection of Communications, John Wiley (New York, 1982).

Google Scholar

[2]

Berlekamp, Elwyn R., Algebraic Coding Theory, Aegean Park Press (Laguna Hills, CA, 1984).

Google Scholar

[3]

Brickell, Ernest F.; and Andrew M. Odlyzko, "Cryptanalysis: A survey of recent results" in {36}, Chapter 10 (1992), 501-540.

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[6]

Cain, Thomas R.; and Alan T. Sherman, "Cryptanalysis of filter generators using the rational canonical decomposition of the feedback function" (1994), in preparation.

Google Scholar

[7]

Dawson, Ed, "Linear feedback shift registers and stream ciphers" in {26}, Chapter 8 (1990), 106-119.

Digital Library

Google Scholar

[8]

Dawson, Ed; and Andrew Clark, "Divide and conquer attacks on certain classes of stream ciphers," Cryptologia, XVIII: 1 (January 1994), 25-40.

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[12]

Gifford, David K.; Dawn Heitmann; David A. Segal; Robert G. Cote; Kendra Tanacea; and David E. Burmaster, "Boston Community Information System 1986 experimental test results," technical report MIT/LCS/TR-397, MIT Laboratory for Computer Science (August 1987).

Digital Library

Google Scholar

[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.

Google Scholar

[14]

Gifford, David K.; and David Andrew Segal, "Boston Community Information System 1987- 1988 experimental test results," technical report MIT/LCS/TR-422, MIT Laboratory for Computer Science (May 1989).

Digital Library

Google Scholar

[15]

Gill, Arthur, Linear Sequential Circuits: Analysis, Synthesis, and Applications, McGraw-Hill (New York, 1966).

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[18]

Golomb, Solomon, Shift Register Sequences, Aegean Park Press (Laguna Hills, CA, 1982).

Digital Library

Google Scholar

[19]

Hellman, Martin E., "A cryptanalytic timememory trade-off," IEEE Transactions on Information Theory, IT-26:4 (1980), 401-406.

Google Scholar

[20]

Hoffman, Kenneth; and Ray Kunze, Linear Algebra, second edition, Prentice-Hall (1971).

Google Scholar

[21]

Hungerford, Thomas W., Algebra, Springer-Verlag (New York, 1974).

Google Scholar

[22]

Jacob, Bill, Linear Algebra, W. H. Freeman and Company (New York, 1990).

Google Scholar

[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.

Google Scholar

[24]

Klapper, Andrew, "The vulnerability of geometric sequences based on fields of odd characteristic," Journal of Cryptology, 7:1 (winter 1994), 33-51.

Digital Library

Google Scholar

[25]

Knuth, Donald E., Seminumerical Algorithms in The Art of Computer Programming, Vol. 2, second edition, Addison-Wesley (Reading, MA, 1981).

Digital Library

Google Scholar

[26]

Loxton, J. H., ed., Number Theory and Cryptography, Cambridge University Press, London Mathematical Society Lecture Note Series, No. 154 (Cambridge, Great Britain, 1990).

Digital Library

Google Scholar

[27]

Macsyma Reference Manual, version ten, Mathlab Group, MIT Laboratory for Computer Science (January 1983 ).

Google Scholar

[28]

Marsh, R. W., Table of Irreducible Polynomials Over GF(2) Through Degree 19, National Security Agency (Washington D.C., 1957).

Google Scholar

[29]

Meier, Willi; and Othmar Stafelbach, "Fast correlation attacks on certain stream ciphers," Journal of Cryptology, 1:3 (1989), 159-176.

Digital Library

Google Scholar

[30]

Peterson, W. Wesley; and E. J. Weldon, Error- Correcting Codes, MIT Press (Cambridge, Mass. 1972).

Google Scholar

[31]

Rhee, Man Young, Cryptography and Secure Communications, McGraw-Hill (Singapore, 1994).

Digital Library

Google Scholar

[32]

Rouse, Christian, Feedback Shift Registers, Lecture Notes in Computer Science 169, G. Goos and J. Hartmanis, eds., Springer-Verlag (Berlin, 1984).

Google Scholar

[33]

Rueppel, Rainer A., Analysis and Design of Stream Ciphers, Springer-Verlag (New York, 1986).

Digital Library

Google Scholar

[34]

Rueppel, Rainer A., "Stream ciphers" in {36}, Chapter 2 (1992), 65-134.

Google Scholar

[35]

Siegenthaler, T., "Decrypting a class of stream ciphers using ciphertext only," IEEE Transactions on Computers, C-34:1 (January 1985), 81-85.

Digital Library

Google Scholar

[36]

Simmons, Gustavus J., editor, Contemporary Cryptology: The Science of Information Integrity, IEEE Press (Piscataway, NJ, 1992).

Digital Library

Google Scholar

[37]

Zeng, Kencheng; Chung-Huang Yang; Dah-Yea Wei; and T. R. N. Rao, "Pseudorandom bit generators in stream-cipher cryptography," Computer, 24:2 (February 1991), 8-17.

Digital Library

Google Scholar

Cited By

View all

Schneier B(2015)ReferencesApplied Cryptography, Second Edition10.1002/9781119183471.refs(675-741)Online publication date: 9-Oct-2015
https://doi.org/10.1002/9781119183471.refs
Rwabutaza AYang MBourbakis N(2012)A Comparative Survey on Cryptology-Based MethodologiesInternational Journal of Information Security and Privacy10.4018/jisp.20120701016:3(1-37)Online publication date: Jul-2012
https://doi.org/10.4018/jisp.2012070101
Castro JViñuela P(2005)Evolutionary computation in computer security and cryptographyNew Generation Computing10.1007/BF0303765423:3(193-199)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1007/BF03037654

Index Terms

How to break Gifford's cipher (extended abstract)

Recommendations

Differential attack on nine rounds of the SEED block cipher

The SEED block cipher has a 128-bit block length, a 128-bit user key and a total number of 16 rounds. It is an ISO international standard. In this letter, we describe two 7-round differentials with a trivially larger probability than the best previously ...
The (related-key) impossible boomerang attack and its application to the AES block cipher

The Advanced Encryption Standard (AES) is a 128-bit block cipher with a user key of 128, 192 or 256 bits, released by NIST in 2001 as the next-generation data encryption standard for use in the USA. It was adopted as an ISO international standard in ...
Biclique cryptanalysis on lightweight block cipher: HIGHT and Piccolo
Advanced Computer Mathematics based Cryptography and Security Technologies

Biclique cryptanalysis is an attack that improves the computational complexity by finding a biclique which is a kind of bipartite graph. We present a single-key full-round attack of lightweight block ciphers, HIGHT and Piccolo by using biclique ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CCS '94: Proceedings of the 2nd ACM Conference on Computer and communications security

November 1994

293 pages

ISBN:0897917324

DOI:10.1145/191177

Chairmen:
Dorothy Denning
Georgetown Univ.
,
Raymond Pyle
Bell Atlantic
,
Ravi Ganesan
Bell Atlantic
,
Ravi Sandhu
George Mason Univ.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 November 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CCS94

Sponsor:

SIGSAC

CCS94: 2nd ACM Conference on Computer & Communications Security

Virginia, Fairfax, USA

Acceptance Rates

CCS '94 Paper Acceptance Rate 31 of 70 submissions, 44%;

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
636
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)10

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Schneier B(2015)ReferencesApplied Cryptography, Second Edition10.1002/9781119183471.refs(675-741)Online publication date: 9-Oct-2015
https://doi.org/10.1002/9781119183471.refs
Rwabutaza AYang MBourbakis N(2012)A Comparative Survey on Cryptology-Based MethodologiesInternational Journal of Information Security and Privacy10.4018/jisp.20120701016:3(1-37)Online publication date: Jul-2012
https://doi.org/10.4018/jisp.2012070101
Castro JViñuela P(2005)Evolutionary computation in computer security and cryptographyNew Generation Computing10.1007/BF0303765423:3(193-199)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1007/BF03037654

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Differential attack on nine rounds of the SEED block cipher

The (related-key) impossible boomerang attack and its application to the AES block cipher

Biclique cryptanalysis on lightweight block cipher: HIGHT and Piccolo