Skip to main content

Quasigroups as Boolean Functions, Their Equation Systems and Gröbner Bases

  • Chapter
  • First Online:
Gröbner Bases, Coding, and Cryptography

Abstract

In this short note we represent quasigroups of order 2n as vector valued Boolean functions f:{0,1}2n→{0,1}n. The representation of finite quasigroups as vector valued Boolean functions allows us systems of quasigroup equations to be solved by using Gröbner bases.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • M. Brickenstein and A. Dreyer, PolyBoRi: A framework for Gröbner basis computations with Boolean polynomials, Elec. Proc. of MEGA 2007, 2007, http://www.ricam.oeaw.ac.at/mega2007/electronic/26.pdf.

  • C. J. Colbourn and J. Dinitz, CRC Handbook of Combinatorial Design, CRC, Boca Raton, 1996.

    Book  Google Scholar 

  • J. Dénes and A. D. Keedwell, Latin squares and their applications, Academic, New York, 1974.

    MATH  Google Scholar 

  • V. Dimitrova, Kvazigrupni transformacii i nivni primeni (Quasigroup transformations and their applications), Msc thesis, Ss. Cyril and Methodius University, Skopje, 2005.

    Google Scholar 

  • D. Gligoroski, S. Markovski, and S. J. Knapskog, A new measure to estimate pseudo-randomness of Boolean functions and relations with Gröbner bases, this volume, 2009, pp. 421–425.

    Google Scholar 

  • S. Markovski, D. Gligoroski, and J. Markovski, Classification of quasigroups by random walk on torus, J. Appl. Math. Comput. 19 (2005), nos. 1–2, 57–75.

    Article  MathSciNet  MATH  Google Scholar 

  • B. McKay, Latin squares, 2009, http://cs.anu.edu.au/bdm/data/latin.html.

  • T. Mora, Gröbner technology, this volume, 2009, pp. 11–25.

    Google Scholar 

  • I. Simonetti, On the non-linearity of Boolean functions, this volume, 2009, pp. 409–413.

    Google Scholar 

  • M. Sala and I. Simonetti, An algebraic description of boolean functions, Proc. of WCC 2007 (2007), 343–349.

    Google Scholar 

  • White paper, The Encyclopaedia of Design Theory, 2009, http://www.designtheory.org/library/encyc/topics/lsee.pdf.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. Gligoroski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gligoroski, D., Dimitrova, V., Markovski, S. (2009). Quasigroups as Boolean Functions, Their Equation Systems and Gröbner Bases. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds) Gröbner Bases, Coding, and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_31

Download citation

Publish with us

Policies and ethics