Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions

DOI10.1007/978-3-540-71677-8_5MaRDI QIDQ5756524zbMATH OpenOpenAlexFDO

Authors Dima Ruinskiy, Adi Shamir, Boaz Tsaban

Publication date 4 September 2007

Published in Public Key Cryptography – PKC 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71677-8_5

zbMATH Keywords

CryptanalysisKey agreementShpilrain-UshakovSubgroup distance functionThompson's group

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Cryptanalysis of the Shpilrain-Ushakov protocol for Thompson's group
• Length-based cryptanalysis: the case of Thompson's group
• A nonlinear decomposition attack
• scientific article; zbMATH DE number 1617914
• Towards provably secure group key agreement building on group theory

Cited in

(8)

• Cryptanalysis of the Shpilrain-Ushakov protocol for Thompson's group
• Plactic key agreement (insecure?)
• A nonlinear decomposition attack
• Random equations in nilpotent groups.
• Length-based cryptanalysis: the case of Thompson's group
• Groups with two generators having unsolvable word problem and presentations of Mihailova subgroups of braid groups
• Subsets of groups in public-key cryptography
• Exponentially generic subsets of groups

This page was built for publication: Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756524)