International Workshop on Public Key Cryptography

PKC 2011: Public Key Cryptography – PKC 2011 pp 459-472

Cryptanalysis of Cryptosystems Based on Non-commutative Skew Polynomials

  • Vivien Dubois
  • Jean-Gabriel Kammerer
Conference paper

DOI: 10.1007/978-3-642-19379-8_28

Volume 6571 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Dubois V., Kammerer JG. (2011) Cryptanalysis of Cryptosystems Based on Non-commutative Skew Polynomials. In: Catalano D., Fazio N., Gennaro R., Nicolosi A. (eds) Public Key Cryptography – PKC 2011. PKC 2011. Lecture Notes in Computer Science, vol 6571. Springer, Berlin, Heidelberg


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.


Diffie-Hellman key exchangeskew polynomials
Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Vivien Dubois
    • 1
  • Jean-Gabriel Kammerer
    • 1
    • 2
  1. 1.DGA/MIRennesFrance
  2. 2.IRMAR, Université de Rennes 1France