Skip to main content

Analyzing the Cryptographic Properties of the Sets of Parastrophic Quasigroups of Order 4

  • Conference paper
ICT Innovations 2013 (ICT Innovations 2013)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 231))

Included in the following conference series:

Abstract

Quasigroups are algebraic structures that are suitable for cryptographic use and their cryptographic properties are intriguing. Looking into these properties we can classify the quasigroups based on different criteria and sort out the ones with best attributes for encryption and resistance to attacks. The Boolean representations of quasigroups allow us to find out more about their cryptographic properties. Some of them are already examined and determined. In this research we will use some previous conclusions in order to find out more about the cryptographic properties of the sets of parastrophic quasigroups.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Dimitrova, V., Trajcheska, Z., Petkovska, M.: Analyzing the Cryptographic Properties of the Boolean Representation of Quasigroups of Order 4. In: 10th Conference for Informatics and Information Technology, CIIT 2013, Bitola (in print, 2013)

    Google Scholar 

  2. Dimitrova, V.: Quasigroup Processed Strings, their Boolean Representations and Application in Cryptography and Coding Theory. PhD Thesis, Ss. Cyril and Methodius University, Skopje, Macedonia (2010)

    Google Scholar 

  3. Dimitrova, V., Bakeva, V., Popovska-Mitrovikj, A., Krapež, A.: Cryptographic Properties of Parastrophic Quasigroup Transformation. In: Markovski, S., Gushev, M. (eds.) ICT Innovations 2012. AISC, vol. 207, pp. 235–243. Springer, Heidelberg (2013)

    Google Scholar 

  4. Dündar, B.G.: Cryptographic Properties of some Highly Nonlinear Balanced Boolean Functions. Master’s Degree Thesis, The Graduate School of Applied Mathematics, The Middle East Technical University, Ankara, Turkey (2006)

    Google Scholar 

  5. Hirose, S., Ikeda, K.: Nonlinearity Criteria of Boolean Functions. KUIS Technical Report, KUIS-94-0002 (1994)

    Google Scholar 

  6. Lafitte, F.: The boolfun Package: Cryptographic Properties of Boolean Functions (2012)

    Google Scholar 

  7. Pommerening, K.: Fourier Analysis of Boolean Maps. A Tutorial, Mainz (2005)

    Google Scholar 

  8. Braeken, A.: Cryptographic Properties of Boolean Functions and S-Boxes. PhD Thesis, Katholieke Universiteit Leuven, Leuven, Belgium (2006)

    Google Scholar 

  9. Zhang, X.-M., Pieprzyk, J., Zheng, Y.: On Algebraic Immunity and Annihilators. In: Rhee, M.S., Lee, B. (eds.) ICISC 2006. LNCS, vol. 4296, pp. 65–80. Springer, Heidelberg (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vesna Dimitrova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Dimitrova, V., Trajcheska, Z., Petkovska, M. (2014). Analyzing the Cryptographic Properties of the Sets of Parastrophic Quasigroups of Order 4. In: Trajkovik, V., Anastas, M. (eds) ICT Innovations 2013. ICT Innovations 2013. Advances in Intelligent Systems and Computing, vol 231. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-01466-1_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01466-1_24

  • Publisher Name: Springer, Heidelberg

  • Print ISBN: 978-3-319-01465-4

  • Online ISBN: 978-3-319-01466-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics