THEORETICALLY UNBREAKABLE CIPHERS AS THEY SHOULD BE UNDERSTOOD
Abstract
Perfectly-secret ciphers according to the Claude Shannon's theory, which are considered as unbreakable, and more specifically random keystream ciphers, are discussed. An analysis of the sources mentioned in the reference list showed that all of them come to the point that the perfect ciphers according to Claude Shannon's theory are unbreakable.The article introduces some concepts, such as: the probabilistic model of cipher; the perfect cipher, which is secure against a plaintext recovery ciphertext-only attack; the perfect cipher, which is secure against a key recovery ciphertext-only attack; effective plaintext or key recovery attack; ineffective plaintext or key recovery attack; decipherable model of cipher; undecipherable model cipher. The introduced concepts were used to clarify Shannon’s mathematical model and to prove that a statement about unbreakability of the perfect ciphers according to the Claude Shannon's theory, including random keystream cipher, were wrong. The purpose of the article is to attract the attention of specialists to the problem of developing methods for decrypting Vizhener cipher and using them in solving the problem of determining the cipher key of a random gamming according to a ciphertext, as well as developing methods for estimating the complexity and reliability of deciphering the cipher class in question.
References
[2] Sсhneier B. Applied Cryptography. Second Edition: Protocols, Algorthms, and Source Code in C. John Wiley & Sons, 1996. 666 p.
[3] Sсhneier B. Secrets & Lies. Digital Security in a Networked World. John Wiley & Sons, 2000. 432 p.
[4] Zapechnikov S.V., Kazarin O.V., Tarasov A.A. Cryptographic Methods of Information Protection. М.: Urait, 2018. 309 p. (In Russian)
[5] Alferov A.P., Zubov A.Yu., Kuzmin A.S., Cheremushkin A.V. Basics of Cryptography. M.: Gelios ARV, 2002. 480 p. (In Russian)
[6] Sсhneier B. Practical Cryptography. John Wiley & Sons, 2003. 432 p.
[7] Henk C.A. van Tilborg, Jajodia S. Encyclopedia of Cryptography and Security. Springer US, 2011. 1416 p.
[8] Godlewsky P., Minimal K. Cryptosystems for Unconditional Secrecy. Journal of Cryptology. 1990; 3(1):1-25. DOI: 10.1007/BF00203966
[9] Zubov A.Yu. Perfect Ciphers. M.: Gelios ARV, 2003. 160 p. (In Russian)
[10] Vasil’eva I.N. Cryptographic Methods of Information Protection. М.: Urait, 2016. 349 p. (In Russian)
[11] Zhdanov O.N., Zolotarev V.V. Methods and Tools of Cryptographic Protection of Information. Siberian State Aerospace Univ., Krasnoyarsk, 2007. 217 р. (In Russian)
[12] Babash A.V. Generalized Cipher Model. Intellectual Systems in the Information Confrontation. Proceedings of the Russian Scientific Conference with International Participation. December 8 -11, 2015. Moscow, Plekhanov Russian University of Economics, 2015. Pp. 9-14. (In Russian)
[13] Babash A.V., Shankin G.P. Cryptography. М.: Solon-Press, 2007. 512 p. (In Russian)
[14] Johansson T., Jonsson F. On the complexity of some cryptographic problems based on the general decoding problem. IEEE Transactions on Information Theory. 2002; 48(10):2669-2678. DOI: 10.1109/TIT.2002.802608
[15] LiangcY., Poor H.V., Shamai S. Information Theoretic Security. Foundations and Trends R in Communications and Information Theory. 2009; 5(4–5):355–580. DOI: 10.1561/0100000036
[16] Maurer U., Wolf S. The intrinsic conditional mutual information and perfect secrecy. Proceedings of IEEE International Symposium on Information Theory. Ulm, Germany, 1997. P. 88. DOI: 10.1109/ISIT.1997.613003
[17] Moulin P., O'Sullivan J.A. Information-theoretic analysis of information hiding. IEEE Transactions on Information Theory. 2003; 49(3):563-593. DOI: 10.1109/TIT.2002.808134
[18] Stallings W. Cryptography and Network Security: Principles and Practice. 5th ed. Pearson, Prentice Hall, Boston, 2011. 744 p.
[19] Stinson D.R. Cryptography: Theory and Practice, 3rd ed. (Discrete Mathematics and Its Applications). Chapman and Hall/CRC, 2006. 616 p.
[20] Trappe W., Washington L.C. Introduction to Cryptography with Coding Theory, 2nd ed. Prentice-Hall, Upper Saddle River, 2006. 577 p.
[21] Beimel A. Secret-Sharing Schemes: A Survey. Y.M. Chee et al. (Eds.) Coding and Cryptology. IWCC 2011. LNCS. Vol. 6639. Springer, Berlin, Heidelberg, 2011. Pp. 11–46. DOI: 10.1007/978-3-642-20901-7_2
[22] Carlet C., Ding C., Yuan J. Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Transactions on Information Theory. 2005; 51(6):2089-2102. DOI: 10.1109/TIT.2005.847722
[23] Cramer R., Damgard I., Maurer U. General Secure Multi-Party Computation from Any Linear Secret-Sharing Scheme. B. Preneel (Ed.) Advances in Cryptology — EUROCRYPT 2000. EUROCRYPT 2000. Lecture Notes in Computer Science. Vol. 1807. Springer, Berlin, Heidelberg, 2000. Pp. 316–334. DOI: 10.1007/3-540-45539-6_22
[24] Cohen G.D., Mesnager S., Patey A. On Minimal and Quasi-minimal Linear Codes. M. Stam (Ed.) Cryptography and Coding. IMACC 2013. Lecture Notes in Computer Science. Vol. 8308. Springer, Berlin, Heidelberg, 2013. Pp. 85-98. DOI: 10.1007/978-3-642-45239-0_6
[25] Cohen G., Mesnager S. On Minimal and Almost-Minimal Linear Codes. Proceedings of the 21st International Symposium on Mathematical Theory of Networks and Systems (MTNS 2014). Session ”Coding theory”. Groningen, Netherlands, 2014. Pp. 928-931. Available at: http://fwn06.housing.rug.nl/mtns2014-papers/fullPapers/0098.pdf (accessed 12.05.2018).
[26] Cohen G., Mesnager S. Variations on Minimal Linear Codes. R. Pinto, P. Rocha Malonek, P. Vettori (Eds.) Coding Theory and Applications. 4th International Castle Meeting, Palmela Castle, Portugal, September 15-18, 2014. CIM Series in Mathematical Sciences. Vol. 3. Springer International Publishing, 2015. Pp. 125-131. DOI: 10.1007/978-3-319-17296-5_12
[27] Ding K., Ding C. A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing. IEEE Transactions on Information Theory. 2015; 61(11):5835-5842. DOI: 10.1109/TIT.2015.2473861
[28] Lee C.-Y., Wang Z.-H., Harn L., Chang C.-C. Secure Key Transfer Protocol Based on Secret Sharing for Group Communications. IEICE Transactions on Information and Systems. 2011; E94-D(11):2069–2076. DOI: 10.1587/transinf.E94.D.2069
[29] Stinson D.R. Cryptography: Theory and Practice. Third Edition. Boca Raton: Chapman & Hall/CRC, 2006. 593 p.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Publication policy of the journal is based on traditional ethical principles of the Russian scientific periodicals and is built in terms of ethical norms of editors and publishers work stated in Code of Conduct and Best Practice Guidelines for Journal Editors and Code of Conduct for Journal Publishers, developed by the Committee on Publication Ethics (COPE). In the course of publishing editorial board of the journal is led by international rules for copyright protection, statutory regulations of the Russian Federation as well as international standards of publishing.
Authors publishing articles in this journal agree to the following: They retain copyright and grant the journal right of first publication of the work, which is automatically licensed under the Creative Commons Attribution License (CC BY license). Users can use, reuse and build upon the material published in this journal provided that such uses are fully attributed.
