Paper 2002/168
New Signature Scheme Using Conjugacy Problem
Ki Hyoung Ko, Doo Ho Choi, Mi Sung Cho, and Jang Won Lee
Abstract
We propose a new digital signature scheme based on a non-commutative group where the conjugacy search problem is hard and the conjugacy decision problem is feasible. We implement our signature scheme in the braid groups and prove that an existential forgery of the implementation under no message attack gives a solution to a variation of conjugacy search problem. Then we discuss performance of our scheme under suggested parameters.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- non-commutativebraidgroupsdigital signaturesconjiugacy problemimplementation
- Contact author(s)
- knot @ knot kaist ac kr
- History
- 2002-11-12: received
- Short URL
- https://ia.cr/2002/168
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2002/168,
author = {Ki Hyoung Ko and Doo Ho Choi and Mi Sung Cho and Jang Won Lee},
title = {New Signature Scheme Using Conjugacy Problem},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/168},
year = {2002},
url = {https://eprint.iacr.org/2002/168}
}
