Towards generating secure keys for braid cryptography

Cited 12 time in webofscience Cited 0 time in scopus
  • Hit : 613
  • Download : 0
Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. Since then, there have been several attempts to break the braid cryptosystem by solving the conjugacy problem in braid groups. In this article, we first survey all the major attacks on the braid cryptosystem and conclude that the attacks were successful because the current ways of random key generation almost always result in weaker instances of the conjugacy problem. We then propose several alternate ways of generating hard instances of the conjugacy problem for use braid cryptography.
Publisher
SPRINGER
Issue Date
2007-12
Language
English
Article Type
Article
Keywords

CONJUGACY PROBLEM; PRACTICAL ATTACK; CRYPTOSYSTEM; PROTOCOL

Citation

DESIGNS CODES AND CRYPTOGRAPHY, v.45, no.3, pp.317 - 333

ISSN
0925-1022
DOI
10.1007/s10623-007-9123-0
URI
http://hdl.handle.net/10203/90993
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 12 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0