Skip to main content

Some Probabilistic Properties of Quasigroup Processed Strings Useful for Cryptanalysis

  • Conference paper
ICT Innovations 2010 (ICT Innovations 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 83))

Included in the following conference series:

  • 876 Accesses

Abstract

Quasigroup string transformations are already used for designing of several cryptographic primitives. The application of quasigroup transformations as encryption algorithm is based on the previously proved result: the distribution of m-tuples in arbitrary string processed by application of quasigroup E (n)-transformation is uniformly distributed for m ≤ n. In this paper, we give some probabilistic properties of quasigroup processed strings that can be used in cryptanalysis. Namely, we find the distribution of m-tuples in an arbitrary string processed by application of quasigroup E (n)-transformation (m > n). Since this distribution is not uniform, it can be used for statistical attack in order to discover the original message and we give an algorithm for this kind of attack. Suitable experimental results are presented as well.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Markovski, S., Gligoroski, D., Bakeva, V.: Quasigrouop string processing: Part 1. Contributions. Sec. Math. Tech. Sci., MANU XX 1-2, 13–28 (1999)

    MathSciNet  Google Scholar 

  2. Markovski, S., Kusakatov, V.: Quasigroup String Processing: Part 2. Contributions, Sec. Math. Tech.Sci., MANU XXI, 1-2, 15–32 (2000)

    MathSciNet  Google Scholar 

  3. Markovski, S., Kusakatov, V.: Quasigroup String Processing: Part 3. Contributions, Sec. Math. Tech.Sci., MANU XXIII-XXIV, 1-2, 7–27 (2002-2003)

    Google Scholar 

  4. Markovski, S., Bakeva, V.: Quasigrouop string processing: Part 4. Contributions, Sec.Math.Tech.Sci., MANU XXVII-XXVIII, 1-2, 41–53 (2006-2007)

    Google Scholar 

  5. Markovski, S.: Quasigroup string processing and applications in cryptography. In: First Intern. Conf. Mathematics and Informatics for Industry, Thessaloniki, Greece, pp. 278–289 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bakeva, V., Dimitrova, V. (2011). Some Probabilistic Properties of Quasigroup Processed Strings Useful for Cryptanalysis. In: Gusev, M., Mitrevski, P. (eds) ICT Innovations 2010. ICT Innovations 2010. Communications in Computer and Information Science, vol 83. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19325-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19325-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19324-8

  • Online ISBN: 978-3-642-19325-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics