Cryptanalysis of the GGH cryptosystem

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 855
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, M.S.ko
dc.contributor.authorHahn, Sang-Geunko
dc.date.accessioned2013-03-08T20:42:09Z-
dc.date.available2013-03-08T20:42:09Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2010-
dc.identifier.citationMATHEMATICS IN COMPUTER SCIENCE, v.3, no.2, pp.201 - 208-
dc.identifier.issn1661-8270-
dc.identifier.urihttp://hdl.handle.net/10203/94238-
dc.description.abstractIn 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.-
dc.languageEnglish-
dc.publisherBirkhauser Verlag-
dc.titleCryptanalysis of the GGH cryptosystem-
dc.typeArticle-
dc.identifier.scopusid2-s2.0-77952243808-
dc.type.rimsART-
dc.citation.volume3-
dc.citation.issue2-
dc.citation.beginningpage201-
dc.citation.endingpage208-
dc.citation.publicationnameMATHEMATICS IN COMPUTER SCIENCE-
dc.contributor.localauthorHahn, Sang-Geun-
dc.contributor.nonIdAuthorLee, M.S.-
dc.subject.keywordAuthorGap-
dc.subject.keywordAuthorGGH-
dc.subject.keywordAuthorLattice reduction-
dc.subject.keywordAuthorPartial information-
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