Security analysis of word problem-based cryptosystems

Françoise Levy-Dit-Vehel; Ludovic Perret

doi:10.1007/s10623-009-9307-x

Security analysis of word problem-based cryptosystems

Françoise Levy-Dit-Vehel
, Ludovic Perret

LIP6, UPMC Sorbonne Universités - Paris 6

Research output: Contribution to journal › Article › peer-review

Abstract

We investigate two schemes based on the word problem on groups. From a complexity-theoretic point of view, we show that the problems underlying those schemes are equivalent. We then present a reaction attack on one of the schemes, thus easily transposed to the other. The attack, besides its efficiency, permits to recover an equivalent secret key.

Original language	English
Pages (from-to)	29-41
Number of pages	13
Journal	Designs, Codes, and Cryptography
Volume	54
Issue number	1
DOIs	https://doi.org/10.1007/s10623-009-9307-x
Publication status	Published - 1 Jan 2010

Keywords

Complexity
Reaction attacks
Word Problem on groups
Word-based cryptosystems

Access to Document

10.1007/s10623-009-9307-x

Cite this

@article{ca9e770d87104d8a8a8598ab572cf52b,

title = "Security analysis of word problem-based cryptosystems",

abstract = "We investigate two schemes based on the word problem on groups. From a complexity-theoretic point of view, we show that the problems underlying those schemes are equivalent. We then present a reaction attack on one of the schemes, thus easily transposed to the other. The attack, besides its efficiency, permits to recover an equivalent secret key.",

keywords = "Complexity, Reaction attacks, Word Problem on groups, Word-based cryptosystems",

author = "Fran{\c c}oise Levy-Dit-Vehel and Ludovic Perret",

year = "2010",

month = jan,

day = "1",

doi = "10.1007/s10623-009-9307-x",

language = "English",

volume = "54",

pages = "29--41",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

number = "1",

}

TY - JOUR

T1 - Security analysis of word problem-based cryptosystems

AU - Levy-Dit-Vehel, Françoise

AU - Perret, Ludovic

PY - 2010/1/1

Y1 - 2010/1/1

N2 - We investigate two schemes based on the word problem on groups. From a complexity-theoretic point of view, we show that the problems underlying those schemes are equivalent. We then present a reaction attack on one of the schemes, thus easily transposed to the other. The attack, besides its efficiency, permits to recover an equivalent secret key.

AB - We investigate two schemes based on the word problem on groups. From a complexity-theoretic point of view, we show that the problems underlying those schemes are equivalent. We then present a reaction attack on one of the schemes, thus easily transposed to the other. The attack, besides its efficiency, permits to recover an equivalent secret key.

KW - Complexity

KW - Reaction attacks

KW - Word Problem on groups

KW - Word-based cryptosystems

UR - https://www.scopus.com/pages/publications/76449119797

U2 - 10.1007/s10623-009-9307-x

DO - 10.1007/s10623-009-9307-x

M3 - Article

AN - SCOPUS:76449119797

SN - 0925-1022

VL - 54

SP - 29

EP - 41

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 1

ER -

Security analysis of word problem-based cryptosystems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this