Length-based cryptanalysis: the case of Thompson's group

DOI10.1515/JMC.2007.018zbMath1130.94016arXivcs/0607079OpenAlexW3101358657MaRDI QIDQ5443569

Adi Shamir, Dima Ruinskiy, Boaz Tsaban

Publication date: 21 February 2008

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0607079

zbMATH Keywords

combinatorial group theorylength-based cryptanalysisnoncommutative cryptography

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Cryptography (94A60)

Related Items (6)

A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups ⋮ A parallel evolutionary approach to solving systems of equations in polycyclic groups ⋮ Oblivious transfer using non-abelian groups ⋮ Generic complexity of finitely presented monoids and semigroups ⋮ Cryptanalysis of the Shpilrain-Ushakov protocol for Thompson's group ⋮ Evolution of group-theoretic cryptology attacks using hyper-heuristics

Cites Work

• Unnamed Item
• Probabilistic solutions of equations in the braid group.
• Thompson’s Group and Public Key Cryptography
• Turing, Computing and Communication

This page was built for publication: Length-based cryptanalysis: the case of Thompson's group