Analysis of Error Terms of Signatures Based on Learning with Errors

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 124
  • Download : 0
Lyubashevsky proposed a lattice-based digital signature scheme based on short integer solution (SIS) problem without using trapdoor matrices [12]. Bai and Galbraith showed that the hard problem in Lyubashevsky’s scheme can be changed from SIS to SIS and learning with errors (LWE) [4]. Using this change, they could compress the signatures. But Bai and Galbraith’s scheme had some additional rejection processes on its algorithms. These rejection processes decreased the acceptance rate of the signing algorithm. We showed mathematically that the rejection process in key generation algorithm of [4] is not necessary. Using this fact, we suggested a scheme modified from [4]’s scheme, and doubled the acceptance rate of the signing algorithm. Furthermore, our implementation results show that our scheme is two times faster than that of [4] on similar parameter settings. Keywords: Lattice, digital si
Publisher
Korea Institute of Information Security and Cryltology
Issue Date
2016-11-30
Language
English
Citation

The 19th Annual International Conferene on Information Security and Cryptology

ISSN
978-3-319
URI
http://hdl.handle.net/10203/226881
Appears in Collection
MA-Conference 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