Article
Open Access
Length-based cryptanalysis: the case of Thompson's group
-
Dima Ruinskiy
Published/Copyright:
February 5, 2008
Received: 2007-February-27
Revised: 2007-May-31
Published Online: 2008-02-05
Published in Print: 2007-12
© de Gruyter
Articles in the same Issue
- Minimal weight and colexicographically minimal integer representations
- Statistical distribution and collisions of VSH
- Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
- Length-based cryptanalysis: the case of Thompson's group
- The average transmission overhead for broadcast encryption
- Another look at automated theorem-proving
Keywords for this article
Length-based cryptanalysis;
noncommutative cryptography;
combinatorial group theory and cryptography
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- Minimal weight and colexicographically minimal integer representations
- Statistical distribution and collisions of VSH
- Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
- Length-based cryptanalysis: the case of Thompson's group
- The average transmission overhead for broadcast encryption
- Another look at automated theorem-proving
