Cryptanalysis of cryptosystems based on non-commutative skew polynomials

Authors:
Vivien Dubois;Jean-Gabriel Kammerer
Affiliations:
DGA, MI, Rennes, France;DGA, MI, Rennes, France and IRMAR, Université de Rennes 1, France
Venue:
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Year:
2011

Citing 4
Cited 0

New Public-Key Cryptosystem Using Braid Groups

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A fast cryptanalysis of the isomorphism of polynomials with one secret problem

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Key exchange and encryption schemes based on non-commutative skew polynomials

PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ten years ago, Ko et al. described a Diffie-Hellman like protocol based on decomposition with respect to a non-commutative semigroup law. Instantiation with braid groups had first been considered, however intense research on braid groups revealed vulnerabilities of the group structure and of the braid based DH problem itself. Recently, Boucher et al. proposed a similar scheme based on a particular non-commutative multiplication of polynomials over a finite field. These so called skew polynomials have a well-studied theory and have many applications in mathematics and coding theory, however they are quite unknown in a cryptographic application. In this paper, we show that the Diffie-Hellman problem based on skew polynomials is susceptible to a very efficient attack. This attack is in fact general in nature, it uses the availability of a one-sided notion of gcd and exact division. Given such tools, one can shift the Diffie-Hellman problem to a linear algebra type problem.