Indian Journal of Science and Technology

Open Access Open Access  Restricted Access Subscription Access

Generation of Quasigroup for Cryptographic Application


Affiliations
1 Shri Shankaracharya College of Engineering & Technology, Bhilai, (CG), India
2 Bhilai Institute of Technology, Durg (CG), India
 

A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary order using the computer algebra system Maple 7 is presented. This problem is crucial to cryptography and its solution permits to implement practical quasigroup-based endomorphic cryptosystems. The order of a quasigroup usually equals the number of characters of the alphabet used for recording both the plaintext and the cipher text. Moreover, it can be used for varied information viz. text, image, etc. Many of the on going algorithms uses NLFSR to generate pseudo random sequence and thus the suggested method can be integrated in any of the existing pseudo random sequence to further enhance their complexity. The implementation of PRSG using quasi group processing is highly scalable and fairly unpredictable. It has passed all publicly available random sequence generator tests. That is exactly what this paper provides: fast and easy ways of generating quasigroups of order up to 256 and a little more.

Keywords

Quasigroup, Cryptography, Pseudo Random Sequence Generator (PRSG's), QPRSG, Non Linear Feedback Shift Register (NLFSR)
User

  • Brotherton-Ratcliffe R (April 1995, December 1994) Using quasi-random sequences in Monte-Carlo valuation of pathdependent options. Canadian Treasurer. 11 (2), 36-38.

  • Dimitrova V and Markovski J (2003) On quasigroup pseudo random sequence generators, Instt. of Info. Faculty of Natural Sci. & Maths, Ss. Cyril & Methodius Univ., Arhimedova 5, Macedonia.

  • Gligoroski D, Markovski S and Knapskog L (2005) A fix of the MD4 family of Hash functions - quasigroup fold. NIST Cryptographic Hash Workshop. 31 Oct-1 Nov.

  • Gligoroski D, Markovski S, Kocarev L and Edon-R (2009) An infinite family of cryptographic Hash functions. Intl. J. Network Security. 8 (3), 293-300.

  • Gutmann P (2001) Random number generation. Available at http://www.cypherpunks.to/~peter/06 _random.pdf

  • Markovski S and Gligoroski D (2003) Differential cryptanalysis of the quasigroup cipher. Univ. of Kuopio, Finland, Ss Cyril & Methodius Univ., Republic of Macedonia.

  • Markovski S and Gligoroski D (2007) Construction of quasi groups of huge order. Ss Cyril & Methodius University Skopje, Macedonia, ICDMA7. June-17-20.

  • Menezes AJ, van Oorschot PC and Vanstone SA (2001) Handbook of applied cryptography. CRC Press, Canada.

  • Navin Rajpal, Anil Kumar, Sureka Dudhani and Pravesh Raja Jindal (2002) Copyright protection using non-linear forward feedback shift register and error-correction technique. In: Map India Conference, Taj Palace New Delhi,India, Feb 6-8

  • Ritter Terry (1991) The efficient generation of cryptographic confusion sequences. Cryptologia. l XV (2), 81-139.

  • Tony Warnock (1987) Random-number generators. Los Alamos Sci. Special issue, Vol 1, issue 1.


Abstract Views: 390

PDF Views: 91




  • Generation of Quasigroup for Cryptographic Application

Abstract Views: 390  |  PDF Views: 91

Authors

Monisha Sharma
Shri Shankaracharya College of Engineering & Technology, Bhilai, (CG), India
M. K. Kowar
Bhilai Institute of Technology, Durg (CG), India

Abstract


A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary order using the computer algebra system Maple 7 is presented. This problem is crucial to cryptography and its solution permits to implement practical quasigroup-based endomorphic cryptosystems. The order of a quasigroup usually equals the number of characters of the alphabet used for recording both the plaintext and the cipher text. Moreover, it can be used for varied information viz. text, image, etc. Many of the on going algorithms uses NLFSR to generate pseudo random sequence and thus the suggested method can be integrated in any of the existing pseudo random sequence to further enhance their complexity. The implementation of PRSG using quasi group processing is highly scalable and fairly unpredictable. It has passed all publicly available random sequence generator tests. That is exactly what this paper provides: fast and easy ways of generating quasigroups of order up to 256 and a little more.

Keywords


Quasigroup, Cryptography, Pseudo Random Sequence Generator (PRSG's), QPRSG, Non Linear Feedback Shift Register (NLFSR)

References





DOI: https://doi.org/10.17485/ijst%2F2009%2Fv2i11%2F29533