Security analysis of word problem-based cryptosystems

DOI10.1007/S10623-009-9307-XMaRDI QIDQ849353zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A reaction attack on a public key cryptosystem based on the word problem
• Cryptography and Coding
• scientific article; zbMATH DE number 3910294
• Coding and Cryptography
• Progress in Cryptology - INDOCRYPT 2004

Cites work

• scientific article; zbMATH DE number 3910294 (Why is no real title available?)
• A reaction attack on a public key cryptosystem based on the word problem
• Coding and Cryptography
• Confluent and Other Types of Thue Systems
• Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
• Progress in Cryptology - INDOCRYPT 2003
• The word problem for free partially commutative groups

Cited in

(9)

• Progress in Cryptology - INDOCRYPT 2004
• Coding and Cryptography
• scientific article; zbMATH DE number 3910294 (Why is no real title available?)
• An algebraic attack on rank metric code-based cryptosystems
• A reaction attack on a public key cryptosystem based on the word problem
• scientific article; zbMATH DE number 1910393 (Why is no real title available?)
• Diophantine cryptography in free metabelian groups: theoretical base.
• Cryptography and Coding
• Search problems in groups and branching processes.

This page was built for publication: Security analysis of word problem-based cryptosystems

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