Abstract
In this paper we introduce a new key exchange algorithm (Diffie-Hellman like) based on so called (non-commutative) skew polynomials. The algorithm performs only polynomial multiplications in a special small field and is very efficient. The security of the scheme can be interpretated in terms of solving binary quadratic equations or exhaustive search of a set obtained through linear equations. We give an evaluation of the security in terms of precise experimental heuristics and usual bounds based on Groebner basis solvers. We also derive an El Gamal like encryption protocol. We propose parameters which give 3600 bits exchanged for the key exchange protocol and a size of key of 3600 bits for the encryption protocol, with a complexity of roughly 223 binary operations for performing each protocol. Overall this new approach based on skew polynomials, seems very promising, as a good tradeoff between size of keys and efficiency.
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.
Similar content being viewed by others
References
Bosma, W., Cannon, J., Playoust, C.: The magma algebra system i: The user language. Journal of Symbolic Computation 24, 235–265 (1997)
Turrel-Bardet, M.: Etude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et la cryptographie., Ph.D. Thesis, Université de Paris VI, Pierre et Marie Curie (2004)
Bronstein, M., Petkovsek, M.: On Ore Rings, Linear Operators and Factorisation. Programming and Computer Software 20, 27–44 (1994)
Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomil Equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392–407. Springer, Heidelberg (2000)
Faugère, J.-C.: A new efficient algorithm for computing Grobner bases without reduction to zero (f5). In: Mora, T. (ed.) ISSAC 2002, pp. 75–83 (2002)
Fraenkel, A.S., Yesha, Y.: Complexity of problems in games, graphs and algebraic equations. Discrete Applied Mathematics 1, 15–30 (1979)
Giesbrecht, M.: Factoring in skew-polynomial rings over finite fields. J. Symbolic Comput. 26(4), 463–486 (1998)
Jacobson, N.: The theory of rings. Publication of the AMS (1943)
McDonald, B.R.: Finite Rings with Identity. Marcel Dekker Inc., New York (1974)
Ore, O.: Theory of non-commutative polynomials. Ann. of Math. 34 (1933)
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
Boucher, D., Gaborit, P., Geiselmann, W., Ruatta, O., Ulmer, F. (2010). Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials. In: Sendrier, N. (eds) Post-Quantum Cryptography. PQCrypto 2010. Lecture Notes in Computer Science, vol 6061. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12929-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-12929-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12928-5
Online ISBN: 978-3-642-12929-2
eBook Packages: Computer ScienceComputer Science (R0)