Cryptography and Coding
From MaRDI portal
Publication:5428166
DOI10.1007/B93924zbMATH Open1123.94357OpenAlexW2478032277MaRDI QIDQ5428166FDOQ5428166
Authors: George Petrides 
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b93924
Recommendations
Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cited In (18)
- Progress in Cryptology - INDOCRYPT 2004
- Diophantine cryptography over infinite groups
- On the security of two public key cryptosystems using non-abelian groups
- The conjugacy problem in the Grigorchuk group is polynomial time decidable.
- Coding and Cryptography
- Title not available (Why is that?)
- Security analysis of word problem-based cryptosystems
- SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
- Length-based cryptanalysis: the case of Thompson's group
- Linear time algorithm for the conjugacy problem in the first Grigorchuk group
- Title not available (Why is that?)
- Ramification structures for quotients of the Grigorchuk groups
- Completion Attacks and Weak Keys of Oleshchuk’s Public Key Cryptosystem
- A reaction attack on a public key cryptosystem based on the word problem
- 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
- The cryptanalysis of a public-key implementation of finite group mappings
- Key agreement based on automaton groups
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)
