Cryptanalysis of the GGH cryptosystem

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 328
  • Download : 0
In this correspondence, we show that partial information of plaintext can be used to simplify the decryption problem in the case of the GGH cryptosystem. Combined with Nguyens previous attack, we solve the numerical GGH challenge of the highest dimension 400, proposed on the Internet by the authors of the cryptosystem. We also discuss how to avoid this attack. © Birkhäuser Verlag Basel/Switzerland 2009.
Publisher
Birkhauser Verlag
Issue Date
2010
Language
English
Citation

MATHEMATICS IN COMPUTER SCIENCE, v.3, no.2, pp.201 - 208

ISSN
1661-8270
URI
http://hdl.handle.net/10203/94238
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0