Skip to main content
SpringerLink
Log in

On Some Cryptographic Properties of the Polynomial Quasigroups

  • 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:

  • 880 Accesses

Abstract

A polynomial quasigroup is said to be a quasigroup that can be defined by a polynomial over a ring. The possibility for use of these quasigroups in cryptography mainly relies on their simple properties, easy construction and huge number. The quasigroup string transformations that are usually used in cryptographic primitives make use of the quasigroup operation as well as one of the parastrophic operations. That is why one of the most important questions posed about the polynomial quasigroups is the one concerning the nature of their parastrophic operations. In this paper we investigate the parastrophes of the polynomial quasigroups of order 2w and propose effective algorithm for finding them.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Belousov, V.D.: n-ary Quasigroups, Shtiintsa, Kishinev (1972)

    Google Scholar 

  2. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9, pp. 251–280 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dénes, J., Keedwell, A.D.: Latin Squares and their Applications. English Univer. Press Ltd. (1974)

    Google Scholar 

  4. Gligoroski, D., Markovski, S., Kocarev, L.: Edon-R, An Infinite Family of Cryptographic Hash Functions. International Journal of Network Security 8(3), pp. 293–300 (2009)

    Google Scholar 

  5. Gligoroski, D., Knapskog, S.J.: Edon-R(256,384,512) an efficient implementation of Edon-R family of cryptographic hash functions. Journal: Commentationes Mathematicae Universitatis Carolinae 49(2), pp. 219–239 (2008)

    MathSciNet  MATH  Google Scholar 

  6. Gligoroski, D., Markovski, S., Knapskog, S.J.: The Stream Cipher Edon80. In: Robshaw, M.J.B., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 152–169. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Hafner, J.L., McCurley, K.S.: Asymptotically fast triangularization of matrices over rings. SIAM Journal of Computing 20(6), pp. 1068–1083 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gligoroski, D., Markovski, S., Knapskog, S.J.: Multivariate quadratic trapdoor functions based on multivariate quadratic quasigroups. In: American Conference on Applied Mathematics, Harvard, USA (March 2008)

    Google Scholar 

  9. Hungerbuhler, N., Specker, E.: A generalization of the Smarandache function to several variables. INTEGERS: Electronic Journal of Combinatorial Number Theory 6, A23 (2006)

    MathSciNet  MATH  Google Scholar 

  10. Markovski, S.: Quasigroup string processing and applications in cryptography. In: Proc. 1st Inter. Conf. Mathematics and Informatics for industry MII, Thessaloniki, pp. 278–290 (2003)

    Google Scholar 

  11. Markovski, S., Shunic, Z., Gligoroski, D.: Polynomial functions on the units of \(\mathbb{Z}_{2^n}\). Quasigroups and related systems 18, pp. 59–82 (2010)

    MathSciNet  MATH  Google Scholar 

  12. Markovski, S., Gligoroski, D., Bakeva, V.: Quasigroup String Processing: Part 1. Maced. Acad. of Sci. and Arts, Sc. Math. Tech. Scien. XX 1-2, pp. 13–28 (1999)

    MathSciNet  Google Scholar 

  13. Markovski, S.,Mileva, A.: NaSHA cryptographic hash function, contributors - Samardziska, S., Jakimovski, B., (programmers) SHA-3 Submission and Round-1 candidate, http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/NaSHA.zip , http://en.wikipedia.org/wiki/NaSHA

  14. Rivest, R.L.: Permutation polynomials modulo 2w. Finite Fields and Their Applications 7, pp. 287–292 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  15. Samardziska, S., Markovski, S.: Polynomial n-ary quasigroups. Mathematica Macedonica 5, pp. 77–81 (2007)

    MathSciNet  MATH  Google Scholar 

  16. Samardziska, S., Markovski, S.: On the number of polynomial quasigroups of order 2w. In: Proceedings of the IV Congress of the Mathematicians of R. Macedonia (2008) (in print)

    Google Scholar 

  17. Shekhar, N., Kalla, P., Enescu, F., Gopalakrishnan, S.: Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra. In: Proceedings of the 2005 IEEE/ACM International Conference on Computer-Aided Design, San Jose, CA, pp. 291–296 (2005)

    Google Scholar 

  18. Storjohann, A., Labahn, G.: Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices. In: Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, pp. 259–266 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Telematics, Faculty of Information Technology, Mathematics and Electrical Engineering, NTNU, Trondheim, Norway

    Simona Samardjiska

Authors
  1. Simona Samardjiska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Natural Sciences and Mathematics, Institute of Informatics, University Sts. Cyril and Methodius, Arhimedova 5, 1000, Skopje, Macedonia

    Marjan Gusev

  2. Faculty of Technical Sciences, University of St. Kliment Ohridski, Ivo Lola Ribar bb, 7000, Bitola, Macedonia

    Pece Mitrevski

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Samardjiska, S. (2011). On Some Cryptographic Properties of the Polynomial Quasigroups. 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_6

Download citation

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

  • 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

Search

Navigation