2007 | OriginalPaper | Buchkapitel
Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions
verfasst von : Dima Ruinskiy, Adi Shamir, Boaz Tsaban
Erschienen in: Public Key Cryptography – PKC 2007
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.