Cryptanalysis of group-based key agreement protocols using subgroup distance functions

Dima Ruinskiy, Adi Shamir, Boaz Tsaban

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. Our approach uses functions that estimate the distance of a group element to a given subgroup. We test it against the Shpilrain-Ushakov protocol, which is based on Thompson's group F, and show that it can break about half the keys within a few seconds on a single PC.

Original languageEnglish
Title of host publicationPublic Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings
PublisherSpringer Verlag
Pages61-75
Number of pages15
ISBN (Print)9783540716761
DOIs
StatePublished - 2007
Externally publishedYes
Event10th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2007 - Beijing, China
Duration: 16 Apr 200720 Apr 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4450 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2007
Country/TerritoryChina
CityBeijing
Period16/04/0720/04/07

Keywords

  • Cryptanalysis
  • Key agreement
  • Shpilrain-Ushakov
  • Subgroup distance function
  • Thompson's group

Fingerprint

Dive into the research topics of 'Cryptanalysis of group-based key agreement protocols using subgroup distance functions'. Together they form a unique fingerprint.

Cite this