Security analysis of word problem-based cryptosystems

DOI10.1007/s10623-009-9307-xzbMath1191.68280OpenAlexW2067083810MaRDI QIDQ849353

Françoise Levy-dit-Vehel, Ludovic Perret

Publication date: 25 February 2010

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9307-x

Mathematics Subject Classification ID

Combinatorics on words (68R15) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

An algebraic attack on rank metric code-based cryptosystems ⋮ Search problems in groups and branching processes

Cites Work

• Unnamed Item
• The word problem for free partially commutative groups
• A reaction attack on a public key cryptosystem based on the word problem
• Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
• Confluent and Other Types of Thue Systems
• Progress in Cryptology - INDOCRYPT 2003
• Coding and Cryptography