Abstract
Boolean functions are mappings \(\{0,1\}^n\rightarrow \{0,1\}\), where n is a nonnegative integer. It is well known that each Boolean function \(f(x_1,\dots ,x_n)\) with n variables can be presented by its Algebraic Normal Form (ANF). If (G, F) is an algebra of order \(|G|, \ 2^{n-1}\le |G|< 2^n\), where F is a set of finite operations on G, then any operation \(f\in F\) of arity k can be interpreted as a partial vector valued Boolean function \(f_{v.v.}:\{0,1\}^{kn}\rightarrow \{0,1\}^n\). By using the function \(f_{v.v.}\) and ANF of Boolean functions, we can characterize different properties of the finite algebras, and here we mention several applications. We consider especially the case of groupoids, i.e., the case when \(F=\{f\}\) consists of one binary operation and we classify groupoids of order 3 according to the degrees of their Boolean functions. Further on, we give another classification of linear groupoids of order 3 using graphical representation. At the end, we consider an application of Boolean representation for solving a system of equations in an algebra.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Dimitrova, V., Markovski, S.: Classification of quasigroups by image patterns. In: Proceedings of the 5-th Conference CIIT 2007, Bitola, Macedonia, pp. 152–159 (2007)
Gligoroski, D., Dimitrova, V., Markovski, S.: Quasigroups as Boolean functions, their equation systems and Gröbner Bases. In: Sala, M., Mora, T., Perret, L., Sakata, S., Traverso, C. (eds.) Gröbner Bases, Coding, and Cryptography, pp. 415–420. Springer, Heidelberg (2009). doi:10.1007/978-3-540-93806-4_31
Joux, A.: Algorithmic Cryptanalyses, Cryptography and Network Security. Chapman&Hall/CRC (2009)
Lazard, D.: Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. In: van Hulzen, J.A. (ed.) EUROCAL 1983. LNCS, vol. 162, pp. 146–156. Springer, Heidelberg (1983). doi:10.1007/3-540-12868-9_99
Markovski, S.: Quasigroup string processing and applications in cryptography. In: Proceedings of the 1st Conference MII, Thessaloniki, pp. 278–290 (2003)
Markovski, S., Gligoroski, D., Bakeva, V.: Quasigroup string processing: Part 1, Prilozi, Mat.-Tehn. Nauki, MANU Skopje, XX 1–2, pp. 13–28 (1999)
Acknowledgment
This research was partially supported by Faculty of Computer Science and Engineering at “Ss Cyril and Methodius” University in Skopje.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Markovski, S., Bakeva, V., Dimitrova, V., Popovska-Mitrovikj, A. (2017). Representation of Algebraic Structures by Boolean Functions and Its Applications. In: Trajanov, D., Bakeva, V. (eds) ICT Innovations 2017. ICT Innovations 2017. Communications in Computer and Information Science, vol 778. Springer, Cham. https://doi.org/10.1007/978-3-319-67597-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-67597-8_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67596-1
Online ISBN: 978-3-319-67597-8
eBook Packages: Computer ScienceComputer Science (R0)