A reaction attack on a public key cryptosystem based on the word problem

DOI10.1007/S00200-003-0135-3MaRDI QIDQ1879274zbMATH OpenOpenAlexFDO

Authors Rainer Steinwandt, María Isabel González Vasco

Publication date 22 September 2004

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-003-0135-3

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Cryptography (94A60)

Recommendations

• Security analysis of word problem-based cryptosystems
• Coding and Cryptography
• Cryptography and Coding
• scientific article; zbMATH DE number 3910294
• On public-key cryptosystems based on combinatorial group theory

Cited in

(12)

• Practical attacks against the walnut digital signature scheme
• Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
• On public-key cryptosystems based on combinatorial group theory
• scientific article; zbMATH DE number 3910294 (Why is no real title available?)
• scientific article; zbMATH DE number 1424183 (Why is no real title available?)
• Gaussian elimination in split unitary groups with an application to public-key cryptography
• Search problems in groups and branching processes.
• Cryptography and Coding
• Completion Attacks and Weak Keys of Oleshchuk’s Public Key Cryptosystem
• Coding and Cryptography
• Security analysis of word problem-based cryptosystems
• Attacking a public key cryptosystem based on tree replacement

This page was built for publication: A reaction attack on a public key cryptosystem based on the word problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879274)