On public-key cryptosystems based on combinatorial group theory

Jean-Camille Birget, Spyros S. Magliveras, and Michal Sramka

Abstract

We analyze and critique the public-key cryptosystem, based on combinatorial group theory, that was proposed by Wagner and Magyarik in 1984. This idea is actually not based on the word problem but on another, generally easier, premise problem. Moreover, the idea of the Wagner-Magyarik system is vague, and it is difficult to find a secure realization of this idea. We describe a public-key cryptosystem inspired in part by the Wagner-Magyarik idea, but we also use group actions on words.

Available format(s)
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
public-key cryptosystemcombinatorial group theoryRichard Thompson groups(NP $\cap$ coNP)-complete premise problems
Contact author(s)
sramka @ math fau edu
History
Short URL
https://ia.cr/2005/070

CC BY

BibTeX

@misc{cryptoeprint:2005/070,
author = {Jean-Camille Birget and Spyros S.  Magliveras and Michal Sramka},
title = {On public-key cryptosystems based on combinatorial group theory},
howpublished = {Cryptology ePrint Archive, Paper 2005/070},
year = {2005},
note = {\url{https://eprint.iacr.org/2005/070}},
url = {https://eprint.iacr.org/2005/070}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.