Cryptography and Coding
From MaRDI portal
Publication:5428166
Recommendations
Cited in
(18)- The conjugacy problem in the Grigorchuk group is polynomial time decidable.
- Coding and Cryptography
- Linear time algorithm for the conjugacy problem in the first Grigorchuk group
- Ramification structures for quotients of the Grigorchuk groups
- Completion Attacks and Weak Keys of Oleshchuk’s Public Key Cryptosystem
- SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
- scientific article; zbMATH DE number 1504539 (Why is no real title available?)
- Key agreement based on automaton groups
- Diophantine cryptography over infinite groups
- A reaction attack on a public key cryptosystem based on the word problem
- Progress in Cryptology - INDOCRYPT 2004
- scientific article; zbMATH DE number 3910294 (Why is no real title available?)
- Length-based cryptanalysis: the case of Thompson's group
- On the security of two public key cryptosystems using non-abelian groups
- Gaussian elimination in split unitary groups with an application to public-key cryptography
- Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
- Security analysis of word problem-based cryptosystems
- The cryptanalysis of a public-key implementation of finite group mappings
This page was built for publication: Cryptography and Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428166)