Cryptography and Coding

DOI10.1007/B93924MaRDI QIDQ5428166zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Cryptography (94A60)

Recommendations

• The complexity of Grigorchuk groups with application to cryptography
• Publication:4502485
• scientific article; zbMATH DE number 3910294
• Security analysis of word problem-based cryptosystems
• A reaction attack on a public key cryptosystem based on the word problem

Cited in

(20)

• The complexity of Grigorchuk groups with application to cryptography
• On the security of two public key cryptosystems using non-abelian groups
• A reaction attack on a public key cryptosystem based on the word problem
• The cryptanalysis of a public-key implementation of finite group mappings
• Key agreement based on automaton groups
• Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
• scientific article; zbMATH DE number 3910294 (Why is no real title available?)
• scientific article; zbMATH DE number 1504539 (Why is no real title available?)
• Linear time algorithm for the conjugacy problem in the first Grigorchuk group
• Diophantine cryptography over infinite groups
• Gaussian elimination in split unitary groups with an application to public-key cryptography
• The conjugacy problem in the Grigorchuk group is polynomial time decidable.
• Length-based cryptanalysis: the case of Thompson's group
• Completion Attacks and Weak Keys of Oleshchuk’s Public Key Cryptosystem
• Progress in Cryptology - INDOCRYPT 2004
• SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
• Ramification structures for quotients of the Grigorchuk groups
• Coding and Cryptography
• Liftable self-similar groups and scale groups
• Security analysis of word problem-based cryptosystems

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)