Cryptology ePrint Archive: Report 2002/168

New Signature Scheme Using Conjugacy Problem

Ki Hyoung Ko and Doo Ho Choi and 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.

Category / Keywords: cryptographic protocols / non-commutative, braid, groups, digital signatures, conjiugacy problem, implementation

Date: received 11 Nov 2002

Contact author: knot at knot kaist ac kr

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20021112:075522 (All versions of this report)

Short URL: ia.cr/2002/168

Discussion forum: Show discussion | Start new discussion