Stream cipher based on quasigroup string transformations in Zp*

In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group $\bbbz_p^*$ (where p is a big prime number used in ElGamal algorithm), by defining a quasigroup of order $p-1$ and by doing quasigroup string transformations. The cryptographical strength of the proposed stream cipher is based on the fact that breaking it would be at least as hard as solving systems of multivariate polynomial equations modulo big prime number $p$ which is NP-hard problem and there are no known fast randomized or deterministic algorithms for solving it. Unlikely the speed of known ciphers that work in $\bbbz_p^*$ for big prime numbers $p$, the speed of this stream cipher both in encryption and decryption phase is comparable with the fastest symmetric-key stream ciphers.

[1]  Kazuhiro Yokoyama,et al.  Yet another practical implementation of polynomial factorization over finite fields , 2002, ISSAC '02.

[2]  Manuel Blum,et al.  An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information , 1985, CRYPTO.

[3]  Josef Pieprzyk,et al.  A Message Authentication Code Based on Latin Squares , 1997, ACISP.

[4]  Shuhong Gao,et al.  Factoring multivariate polynomials via partial differential equations , 2003, Math. Comput..

[5]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[6]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[7]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[8]  Serge Vaudenay,et al.  Black Box Cryptanalysis of Hash Networks Based on Multipermutations , 1994, EUROCRYPT.

[9]  Danilo Gligoroski,et al.  Using quasigroups for one one secure encoding , 2002 .

[10]  David A. Plaisted.  Some Polynomial and Integer Divisibility problems are NP-Hard , 1978, SIAM J. Comput..

[11]  Whitfield Diffie,et al.  Multiuser cryptographic techniques , 1976, AFIPS '76.

[12]  Arjen K. Lenstra.  Factoring Multivariate Polynomials over Finite Fields , 1985, J. Comput. Syst. Sci..

[13]  Douglas R Stinson,et al.  New constructions for perfect hash families and related structures using combinatorial designs and codes , 2000 .

[14]  A. D. Keedwell,et al.  Latin Squares: New Developments in the Theory and Applications , 1991 .

[15]  Serge Vaudenay,et al.  On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER , 1994, FSE.

[16]  A. Barbé,et al.  Cellular automata, quasigroups and symmetries , 2001 .

[17]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[18]  Verica Bakeva,et al.  QUASIGROUP STRING PROCESSING: PART 4 , 1999 .

[19]  David A. Plaisted,et al.  Some polynomial and integer divisibility problems are NP-HARD , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[20]  Arjen K. Lenstra,et al.  Factoring multivariate polynomials over finite fields , 1983, J. Comput. Syst. Sci..

[21]  Erich Kaltofen,et al.  Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields , 1983, ICALP.

[22]  Éric Schost,et al.  Complexity issues in bivariate polynomial factorization , 2004, ISSAC '04.

[23]  Erich Kaltofen,et al.  Polynomial factorization: a success story , 2003, ISSAC '03.

[24]  A. Donald Keedwell,et al.  A new authentication scheme based on latin squares , 1992, Discret. Math..

[25]  Brendan D. McKay,et al.  Latin Squares of Order 10 , 1995, Electron. J. Comb..