A Diffie-Hellman-like Key Exchange Protocol Based on Multivariate Ore Polynomials

In this paper we present a key exchange protocol based on multivariate non-commutative polynomial rings, analogous to the classic Diffie-Hellman method. Ourtechnique extends the proposed scheme of Boucher et al. from 2010. Their method was broken by Dubois and Kammerer in 2011, who exploited the Euclidean domain structure of the chosen ring. However, our proposal is immune against such attacks, without losing the advantages of non-commutative polynomial rings as outlined by Boucher et al. Moreover, our extension is not restricted to any particular ring, but is designed to allow users to readily choose from a large class of rings when applying the protocol.

[1]  O. Ore.  Theory of Non-Commutative Polynomials , 1933 .

[2]  J. L. Burchnall,et al.  Commutative Ordinary Differential Operators , 1923 .

[3]  M. V. Hoeij,et al.  Factorization of linear differential operators , 1996 .

[4]  Bruno Buchberger,et al.  Introduction to Groebner Bases , 1997 .

[5]  Joan-Josep Climent,et al.  Key exchange protocols over noncommutative rings. The case of , 2012, Int. J. Comput. Math..

[6]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[7]  Felix Ulmer,et al.  Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials , 2010, PQCrypto.

[8]  Mark van Hoeij,et al.  Formal Solutions and Factorization of Differential Operators with Power Series Coefficients , 1997, J. Symb. Comput..

[9]  Nathan Jacobson,et al.  Theory of rings , 1943 .

[10]  Mark van Hoeij,et al.  Solving recurrence relations using local invariants , 2010, ISSAC.

[11]  José Gómez-Torrecillas,et al.  Algorithmic Methods in Non-Commutative Algebra: Applications to Quantum Groups , 2003 .

[12]  Sergey P. Tsarev,et al.  Problems that appear during factorization of ordinary linear differential operators , 1994 .

[13]  Hans Schönemann,et al.  SINGULAR: a computer algebra system for polynomial computations , 2001, ACCA.

[14]  Vivien Dubois,et al.  Cryptanalysis of Cryptosystems Based on Non-commutative Skew Polynomials , 2011, Public Key Cryptography.

[15]  Mark Giesbrecht,et al.  Factoring and decomposing ore polynomials over Fq(t) , 2003, ISSAC '03.

[16]  Mark Giesbrecht,et al.  Factoring Differential Operators in n Variables , 2014, ArXiv.

[17]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[18]  Ekaterina Shemyakova,et al.  Parametric Factorizations of Second-, Third- and Fourth-Order Linear Partial Differential Operators with a Completely Factorable Symbol on the Plane , 2007, Math. Comput. Sci..

[19]  Mark van Hoeij,et al.  Factorization of Differential Operators with Rational Functions Coefficients , 1997, J. Symb. Comput..

[20]  Viktor Levandovskyy,et al.  Factorization of Z-homogeneous polynomials in the First (q)-Weyl Algebra , 2013, ArXiv.

[21]  Alfred Loewy,et al.  Über vollständig reduzible lineare homogene Differentialgleichungen , 1906 .

[22]  Daan Krammer.  Braid groups are linear , 2002 .

[23]  Adi Shamir,et al.  Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization , 1999, CRYPTO.

[24]  Ekaterina Shemyakova,et al.  Multiple Factorizations of Bivariate Linear Partial Differential Operators , 2009, CASC.

[25]  Mark van Hoeij,et al.  Finding all bessel type solutions for linear differential equations with rational function coefficients , 2010, ISSAC.

[26]  J. McConnell,et al.  Noncommutative Noetherian Rings , 2001 .

[27]  Jung Hee Cheon,et al.  New Public-Key Cryptosystem Using Braid Groups , 2000, CRYPTO.

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

[29]  Alfred Loewy,et al.  Über reduzible lineare homogene Differentialgleichungen , 1903 .

[30]  Adi Shamir,et al.  Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations , 2000, EUROCRYPT.

[31]  E. Artin.  The theory of braids. , 1950, American scientist.

[32]  Vincent Rijmen,et al.  The Design of Rijndael: AES - The Advanced Encryption Standard , 2002 .

[33]  Julian Russell Brown.  The Quest for the Quantum Computer , 2000 .

[34]  Fritz Schwarz.  ALLTYPES in the web , 2007, ACCA.

[35]  Ekaterina Shemyakova,et al.  Refinement of Two-Factor Factorizations of a Linear Partial Differential Operator of Arbitrary Order and Dimension , 2010, Mathematics and Computer Science.

[36]  D. J. H. Garling,et al.  A Course in Galois Theory , 1987 .

[37]  Herbert Melenk,et al.  REDUCE package NCPOLY: Computation in non-commutative polynomial ideals , 1994 .

[38]  Richard Beals,et al.  Constructively Factoring Linear Partial Differential Operators in Two Variables , 2005 .

[39]  Ueli Maurer,et al.  Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms , 1994, CRYPTO.

[40]  Jung Hee Cheon,et al.  A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem , 2003, CRYPTO.

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

[42]  Dima Grigoriev,et al.  Factoring and Solving Linear Partial Differential Equations , 2004, Computing.

[43]  Xiaolei Dong,et al.  New Public Key Cryptosystems Using Polynomials over Non-commutative Rings , 2007, IACR Cryptol. ePrint Arch..

[44]  Serguei P. Tsarev,et al.  An algorithm for complete enumeration of all factorizations of a linear ordinary differential operator , 1996, ISSAC '96.

[45]  Tanja Lange,et al.  Attacking and defending the McEliece cryptosystem , 2008, IACR Cryptol. ePrint Arch..

[46]  Mark Giesbrecht,et al.  Factoring in Skew-Polynomial Rings over Finite Fields , 1998, J. Symb. Comput..