Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A nonlinear decomposition attack

A nonlinear decomposition attack Abstract This paper introduces a new type of attack, termed a nonlinear decomposition attack, against two known group-based key agreement protocols, namely, protocol based on extensions of (semi)groups by endomorphisms introduced by Kahrobaei, Shpilrain et al., and the noncommutative Diffie–Hellman protocol introduced by Ko, Lee et al. This attack works efficiently in the case when finitely generated nilpotent (more generally, polycyclic) groups are used as platforms. This attack is based on a deterministic algorithm that finds the secret shared key from the public data in both the protocols under consideration. Furthermore, we show that in this case one can break the schemes without solving the algorithmic problems on which the assumptions are based. The efficacy of the attack depends on the platform group, so it requires a more thorough analysis in each particular case. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

A nonlinear decomposition attack

Roman’kov, Vitaliĭ
Groups Complexity Cryptology , Volume 8 (2) – Nov 1, 2016
Download PDF
11 pages

Loading next page...
 
/lp/de-gruyter/a-nonlinear-decomposition-attack-sFX51cK2Ea
Publisher
de Gruyter
Copyright
Copyright © 2016 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2016-0017
Publisher site
See Article on Publisher Site

Abstract

Abstract This paper introduces a new type of attack, termed a nonlinear decomposition attack, against two known group-based key agreement protocols, namely, protocol based on extensions of (semi)groups by endomorphisms introduced by Kahrobaei, Shpilrain et al., and the noncommutative Diffie–Hellman protocol introduced by Ko, Lee et al. This attack works efficiently in the case when finitely generated nilpotent (more generally, polycyclic) groups are used as platforms. This attack is based on a deterministic algorithm that finds the secret shared key from the public data in both the protocols under consideration. Furthermore, we show that in this case one can break the schemes without solving the algorithmic problems on which the assumptions are based. The efficacy of the attack depends on the platform group, so it requires a more thorough analysis in each particular case.

Journal

Groups Complexity Cryptology – de Gruyter

Published: Nov 1, 2016

References

  • kov Cryptanalysis of some schemes applying automorphisms ( in Russian ) Appl Discrete Roman kovV A Cryptanalysis of some schemes applying automorphismsRussianAppl Discrete
    Roman
  • The Diffie Hellman key exchange protocol and non - abelian nilpotent groups MahalanobisA The Diffie Hellman key exchange protocol and non - abelian nilpotent groupsIsrael J Math
    Mahalanobis
  • A non - commutative generalization of ElGamal key exchange using polycyclic groups Global Telecommunications Conference IEEE Press generalization of ElGamal key exchange using polycyclic groupsGlobal Telecommunications Conference
    Kahrobaei
  • The algorithmic theory of polycyclic - by - finite groups BaumslagG CannonitoF RobinsonD SegalD The algorithmic theory of polycyclic - by - finite groupsJ Algebra
    Baumslag
  • Probabilistic solutions of equations in the braid group Adv GarberD KaplanS TeicherM TsabanB VishneU Probabilistic solutions of equations in the braid groupAdv Appl Math
    Garber
  • New public - key cryptosystem using braid groups Advances in Cryptology Lecture Notes in Comput Springer CheonJ HanJ KangJ ParkC New public - key cryptosystem using braid groupsAdvances in CryptologyCRYPTO Lecture Notes in Comput
    Ko
  • An algebraic method for public - key cryptography Math AnshelM GoldfeldD An algebraic method for public - key cryptographyMath Res Lett
    Anshel
  • Polynomial time solutions of computational problems in noncommutative algebraic cryptography no TsabanB Polynomial time solutions of computational problems in noncommutative algebraic cryptographyJ Cryptology
    Tsaban
  • Computation with Finitely Presented Groups Encyclopedia Math Cambridge University Press Cambridge Computation with Finitely Presented GroupsEncyclopedia Math Cambridge University PressCambridge
    Sims
  • Faithful representations ofp - groups at characteristicp Faithful representations ofp - groups at characteristicpJ Algebra
    Janusz