Abstract
Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, it makes it an interesting tool for the application in computer security and for production of pseudorandom sequences. Prior implementations of quasigroups were based on look-up table of the quasigroup, on system of distinct representatives etc. Such representations are infeasible for large quasigroups. In contrast, presented analytic quasigroup can be implemented easily. It allows the generation of pseudorandom sequences without storing large amount of data (look-up table). The concept of isotopy enables consideration of many quasigroups and genetic algorithms allow efficient search for good ones.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Knuth, D.E.: The art of computer programming. In: Seminumerical Algorithms, 3rd edn., vol. 2, Addison-Wesley/Longman Publishing Co., Inc. (1997)
Marsaglia, G., Tsang, W.W.: Some Difficult-to-pass Tests of Randomness. Journal of Statistical Software 7(i03)
Markovski, S.: Quasigroup String Processing and Applications in Cryptography. In: Proceedings 1st Conference of Mathematics and Informatics for Industry, Thessaloniki, Greece, pp. 278–290 (2003)
Dimitrova, V., Markovski, J.: On quasigroup pseudo random sequence generator. In: Manolopoulos, Y., Spirakis, P. (eds.) Proc. of the 1-st Balkan Conference in Informatics, Thessaloniki, November 2004, pp. 393–401 (2004)
Bäck, T., Hammel, U., Schwefel, H.-P.: Evolutionary computation: comments on the history and current state. IEEE Transactions on Evolutionary Computation 1, 3–17 (1997)
Belousov, V.D.: Osnovi teorii kvazigrup i lup, Nauka, Moscow (1967) (in Russian)
Bodenhofer, U.: Genetic Algorithms: Theory and Applications. Lecture Notes, Fuzzy Logic Laboratorium Linz-Hagenberg (Winter 2003/2004)
Dianati, M., Song, I., Treiber, M.: An introduction to genetic algorithms and evolution strategies, technical report, University of Waterloo, Ontario, N2L 3G1, Canada (July 2002)
Dénes, J., Keedwell, A.: Latin Squares and their Applications. In: Akadémiai Kiadó, Budapest. Academic Press, New York (1974)
Dénes, J., Keedwell, A.: A new authentication scheme based on Latin squares. Discrete Mathematics (106/107), 157–161 (1992)
Dvorský, J., Ochodková, E., Snášel, V.: Hash Functions Based on Large Quasigroups. In: Proceedings of Velikonoční kryptologie, Brno, pp. 1–8 (2002)
Hilewitz, Y., Shi, Z.J., Lee, R.B.: Comparing fast implementations of bit permutation instructions. In: Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, Pacific Grove, California, USA, November 2004, pp. 1856–1863 (2004)
Gligoroski, D., et al.: EdonR cryptographic hash function. Submition to NIST’s SHA-3 hash function competition (2008), http://csrc.nist.gov/groups/ST/hash/sha-3/index.html
Gligoroski, D., Markovski, S., Kocarev, L., Svein, 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)
Snášel, V., Abraham, A., Dvorský, J., Krömer, P., Platoš, J.: Hash functions based on large quasigroups. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009, Part I. LNCS, vol. 5544, pp. 521–529. Springer, Heidelberg (2009)
Jones, G.: Genetic and evolutionary algorithms. In: von Rague, P. (ed.) Encyclopedia of Computational Chemistry. John Wiley and Sons, Chichester (1998)
Knapskog, S.J.: New cryptographic primitives. In: CISIM 2008: Proceedings of the 2008 7th Computer Information Systems and Industrial Management Applications, pp. 3–7. IEEE Computer Society, Washington (2008)
Koza, J.: Genetic programming: A paradigm for genetically breeding populations of computer programs to solve problems. Technical Report STAN-CS-90-1314, Dept. of Computer Science, Stanford University (1990)
McKay, B.D., Wanless, I.M.: On the Number of Latin Squares. Journal Annals of Combinatorics 9(3), 335–344 (2005)
Merkle, R.C.: Secrecy, authentication, and public key systems. Stanford Ph.D. thesis, pp. 13-15 (1979), http://www.merkle.com/papers/Thesis1979.pdf
Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)
Ochodková, E., Snášel, V.: Using Quasigroups for Secure Encoding of File System. In: Proceedings of the International Scientific NATO PfP/PWP Conference Security and Information Protection 2001, Brno, Czech Republic, May 9-11, pp. 175–181 (2001)
Smith, J.D.H.: An introduction to quasigroups and their representations. Chapman & Hall/CRC (2007)
Snyder, L.V., Daskin, M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research 174(1), 38–53 (2006)
Vojvoda, M.: Cryptanalysis of One Hash Function Based on quasigroup. In: Conference Mikulášská kryptobesídka, Praha, pp. 23–28 (2003)
TREC Web Corpus: GOV (2009), http://ir.dcs.gla.ac.uk/test_collections/govinfo.html
Snášel, V., Abraham, A., Dvorský, J., Ochodková, E., Platoš, J., Krömer, P.: Searching for Quasigroups for Hash Functions with Genetic Algorithms. In: Proceedings of the 2009 World Congress on Nature & Biologically Inspired Computing, pp. 367–372. IEEE Computer Society, Los Alamitos (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Snášel, V., Dvorský, J., Ochodková, E., Krömer, P., Platoš, J., Abraham, A. (2010). Genetic Algorithms Evolving Quasigroups with Good Pseudorandom Properties. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds) Computational Science and Its Applications – ICCSA 2010. ICCSA 2010. Lecture Notes in Computer Science, vol 6018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12179-1_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-12179-1_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12178-4
Online ISBN: 978-3-642-12179-1
eBook Packages: Computer ScienceComputer Science (R0)