BREAKING BLOCK AND PRODUCT CIPHERS

Authors

  • Albert H. Carlson
  • Robert E. Hiromoto
  • Richard B. Wells

DOI:

https://doi.org/10.47839/ijc.12.3.607

Keywords:

Set theoretic estimation, block and product cipher, byte boundaries, known ciphertext attack, meta-characters.

Abstract

The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed from two (2) alphabetic characters (meta-characters) where the applications of P and S upon the ASCII byte representation of each of the two characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.

References

E. Fogal, and Y. F. Huang, On the value of information in system identification - bounded noise case, Automatica, (18) 2 (1982), pp. 229-238.

A. Carlson, R. B. Wells, and R. E. Hiromoto, Using set theoretic estimation to implement Shannon secrecy theory, The Proceedings of the Third IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications IDAACS’2005, Sofia, Bulgaria, September 5-7, 2005, pp. 435-438.

C. E. Shannon, Communication theory of secrecy systems, Bell Systems Technical Journal, (28) (1949), pp. 656-715.

B. Schneier, Applied Cryptography: Protocols, Algorithms and Source Code in C, 2nd ed., John Wiley and Sons Inc., New York, NY, 1996.

R. B. Wells, Applied Coding and Information Theory, 1st ed., Prentice Hall, Upper Saddle River, NJ, 1999.

S. Ross, A First Course in Probability, 1st ed., MacMillan Publishing, Inc., New York, NY, 1976.

P. Garrett, The Mathematics of Coding Theory, 1st ed.. Pearson/Prentice Hall, Upper Saddle River, NJ, 2004.

T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed., Wiley-Interscience, Hoboken, NJ, 2001.

D. R. Stinson, Cryptography: Theory and Practice, 3rd ed., Chapman Hall/CRC Press, London, England, 2006.

P. L. Combettes, The foundations of set theoretic estimation, Proceedings of the IEEE, (81) 2 (1993), pp. 182-208.

The Gutenberg Project, Internet, http://www.gutenberg.net

Fred Schweppe, Recursive state estimation: Unknown but bounded errors and system inputs, IEEE Transactions on Automatic Control, (13) 1 (1968), pp. 22-28.

Albert Carlson, Set Theoretic Estimation Applied to the Information Content of Ciphers and Decryption, PhD Thesis, University of Idaho, 2012.

Horst Feistel, Cryptography and computer privacy, Scientific American, (228) 5 (1973), pp. 15-20.

Downloads

Published

2014-08-01

How to Cite

Carlson, A. H., Hiromoto, R. E., & Wells, R. B. (2014). BREAKING BLOCK AND PRODUCT CIPHERS. International Journal of Computing, 12(3), 259-266. https://doi.org/10.47839/ijc.12.3.607

Issue

2013, Volume 12, Issue 3

Section

Articles

License

International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:
•    Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
•    Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
•    Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.