Cryptanalysis of group-based key agreement protocols using subgroup distance functions
Cryptography and Security
2010-11-05 v2
Abstract
We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. This 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.
Keywords
Cite
@article{arxiv.0705.2862,
title = {Cryptanalysis of group-based key agreement protocols using subgroup distance functions},
author = {Dima Ruinskiy and Adi Shamir and Boaz Tsaban},
journal= {arXiv preprint arXiv:0705.2862},
year = {2010}
}