Skip to main content
SpringerLink
Log in

XOR ciphers model and the attack to it

  • Original Paper
  • Published:
Journal of Computer Virology and Hacking Techniques Aims and scope Submit manuscript

Abstract

This paper will propose a natural language model based on all coherent (meaningful) texts of fixed length used in encryption. We use Shannon's cipher model to describe XOR ciphers by incorporating equinumerous alphabets of plaintexts, keys, and ciphertexts. The encryption function between the plaintext alphabet and the key should be defined as bijective with regard to each variable. The selection of key symbols from the key alphabet to encrypt a text of finite length is made randomly (and possibly randomly and with equal probability). The supposed attack consists of identifying at least two plaintext segments with a given length D in a known ciphertext of a given length. Further, we will estimate the complexity of the attack and calculate the reliability of the attack lower estimate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Babash, A.V., Baranova, E.K.: Assumptions and approximation models in public key cryptography. Is it possible to believe the results and conclusions? Methods and means of technical security of information. In: Proceedings of the 26th Scientific and Technical Conference, Saint-Petersburg. June 26–29, 2017, Saint-Peterburg, Polytechnic University Press, pp. 30–32 (2017)

  2. Babash, A.V., Baranova, E.K.: Selected issues of cryptanalysis of random keystream cipher. Methods and technical means of information security. In: Proceedings of the 28th Scientific and Technical Conference, Saint-Petersburg. June 24–27, 2019, Saint-Petersburg, Polytechnic University Press, pp. 76–77 (2019)

  3. Babash, A.V., Sizov, V.A., Baranova, E.K., Mikrukov, A.A.: Theoretically unbreakable ciphers as they should be understood. Theor. Quest. Comput. Sci. Comput. Math. Comput. Sci. Cogn. Inf. 14(3), 573–577 (2018)

    Google Scholar 

  4. Babash, A.V., Shankin, G.P.: Cryptography. Aspects of defense. SOLON-R, Moscow (2007)

    Google Scholar 

  5. Shannon, C.: Communication theory of secrecy systems. Bell Syst. Techn. J. 28(4), 656–715 (1949)

    Article  MathSciNet  Google Scholar 

  6. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms 3. The MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  7. J. Katz, Y. Lindell. Introduction to modern cryptography, p. 553 (2008)

  8. Hellman, E.: Privacy and authentication: an introduction to cryptography. Proc. IEEE 67(3), 32 (1979)

    Google Scholar 

  9. Claude Elwood Shannon (1916–2001) / S. Golomb [и дp.]. Notices of the American Mathematical Society, January. pp. 8–16 (2002)

  10. Schneier, B.: Applied Cryptography, Second Edition: Protocols, Algorthms, and Source Code in C by Wiley Computer Publishing, p. 666. Wiley (1996)

    Google Scholar 

  11. Martin, K.M.: Everyday Cryptography (aнгл.). Oxford University Press (2012)

    Book  Google Scholar 

  12. Kasiski, F.W.: Die Geheimschriften und die Dechiffrir-Kunst. Mittler & Sohn, Berlin (1863)

    Google Scholar 

  13. Menezes, A. J. (Alfred J.): Handbook of Applied Cryptography. CRC Press, Boca Raton, xxviii, 780 pages (1997)

  14. Friedman, W.F.: The Index of Coincidence and Its Applications in Cryptology. Riverbank Laboratories, Geneva (1922)

    Google Scholar 

  15. Babash, A.V.: Cryptographic Methods of Information Protection, vol. 1, p. 413p. RIOR INFRA-M, Moscow (2013)

    Google Scholar 

  16. https://www.ericfiliol.site/megiddo.html

  17. https://www.blackhat.com/html/bh-eu-10/bh-eu-10-archives.html#Filiol

  18. Filiol, E.: How to operationally detect misuse or flawed implementation of weak stream ciphers (and even block ciphers sometimes) and break them -Application to the Office Encryption Cryptanalysis, ESIEA Laval Operational Cryptology and Virology Lab (C + V)O http://www.esiea-recherche.eu/

  19. Dodge, Y.: Premiers pas en statistiques. Springer France Publishing (1999)

    MATH  Google Scholar 

  20. Babash, A.V.: Attacks on the random gamming cipher Problems of information security. Comput. Syst. 3, 74–81 (2020)

    Google Scholar 

  21. Babash, A.V.: Attacks on the random gamming cipher. Math. Math. Model. 6(219), 35–58 (2020)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research University Higher School of Economics, Plekhanov Russian University of Economics, Moscow, Russian Federation

    A. V. Babash

Authors
  1. A. V. Babash
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Babash.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Babash, A.V. XOR ciphers model and the attack to it. J Comput Virol Hack Tech 18, 275–283 (2022). https://doi.org/10.1007/s11416-022-00419-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11416-022-00419-0

Keywords

Search

Navigation