Infinite grobner bases and noncommutative polly cracker cryptosystems

We develop a public key cryptosystem whose security is based on the intractability of the ideal membership problem for a noncommutative algebra over a finite field. We show that this system, which is the noncommutative analogue of the Polly Cracker cryptosystem, is more secure than the commutative version. This is due to the fact that there are a number of ideals of noncommutative algebras (over finite fields) that have infinite reduced Grobner bases, and can be used to generate a public key. We present classes of such ideals and prove that they do not have a finite Grobner basis under any admissible order. We also examine various techniques to realize finite Grobner bases, in order to determine whether these ideals can be used effectively in the design of a public key cryptosystem. We then show how some of these classes of ideals, which have infinite reduced Grobner bases, can be used to design a public key cryptosystem. We also study various techniques of encryption. Finally, we study techniques of cryptanalysis that may be used to attack the cryptosystems that we present. We show how poorly constructed public keys can in fact, reveal the private key, and discuss techniques to design public keys that adequately conceal the private key. We also show how linear algebra can be used in ciphertext attacks and present a technique to overcome such attacks. This is different from the commutative version of the Polly Cracker cryptosystem, which is believed to be susceptible to “intelligent” linear algebra attacks.

[1]  Lenwood S. Heath,et al.  Opal: A System for Computing Noncommutative Gröbner Bases , 1997, RTA.

[2]  Bruno Buchberger,et al.  Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal , 2006, J. Symb. Comput..

[3]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[4]  G. Bergman.  The diamond lemma for ring theory , 1978 .

[5]  Rainer Steinwandt,et al.  Cryptanalysis of Polly Cracker , 2002, IEEE Trans. Inf. Theory.

[6]  Ralf Fröberg,et al.  An introduction to Gröbner bases , 1997, Pure and applied mathematics.

[7]  Rainer Steinwandt,et al.  Attacking a polynomial-based cryptosystem: Polly Cracker , 2002, International Journal of Information Security.

[8]  N. Bose.  Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory , 1995 .

[9]  Friedrich Otto,et al.  String-Rewriting Systems , 1993, Text and Monographs in Computer Science.

[10]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[11]  Patrik Nordbeck,et al.  On the Finiteness of Gröbner Bases Computation in Quotients of the Free Algebra , 2001, Applicable Algebra in Engineering, Communication and Computing.

[12]  Victor Ufnarovski,et al.  The Non-Commutative Gröbner Freaks , 1998 .

[13]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[14]  X. Ren,et al.  Mathematics , 1935, Nature.

[15]  David Naccache,et al.  Why You Cannot Even Hope to use Gröbner Bases in Public Key Cryptography: An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet Failed , 1994, J. Symb. Comput..

[16]  Donal O'Shea,et al.  Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) , 1997, Undergraduate texts in mathematics.

[17]  Wade Trappe,et al.  Introduction to Cryptography with Coding Theory , 2002 .

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

[19]  Heinz Kredel,et al.  Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .

[20]  Silvio Micali,et al.  Probabilistic encryption & how to play mental poker keeping secret all partial information , 1982, STOC '82.

[21]  M. Fellows.  Combinatorial Cryptosystems Galore! , 2022 .

[22]  Jacques Patarin,et al.  Asymmetric Cryptography with a Hidden Monomial , 1996, CRYPTO.

[23]  Edward L. Green,et al.  Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases , 2000, J. Symb. Comput..

[24]  M.I. Aziz,et al.  Introduction to Cryptography , 2002, 2005 International Conference on Microelectronics.

[25]  Ferdinando Mora,et al.  Groebner Bases for Non-Commutative Polynomial Rings , 1985, AAECC.

[26]  Dennis Hofheinz,et al.  A "differential" attack on Polly Cracker , 2002, Proceedings IEEE International Symposium on Information Theory,.

[27]  K. Roberts,et al.  Thesis , 2002 .

[28]  Matthias Jantzen,et al.  Confluent String Rewriting , 1988, EATCS Monographs on Theoretical Computer Science.

[29]  Van-Ly Le,et al.  Polly two - a public key cryptosystem based on Polly cracker , 2003 .

[30]  Bernard P. Zajac.  Applied cryptography: Protocols, algorithms, and source code in C , 1994 .

[31]  Teo Mora,et al.  An Introduction to Commutative and Noncommutative Gröbner Bases , 1994, Theor. Comput. Sci..

[32]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[33]  Marc Giusti,et al.  Some Effectivity Problems in Polynomial Ideal Theory , 1984, EUROSAM.