Paper 2021/002 Original: eprint.iacr.org/2021/002 ↗
Can Lattice Signature be as Efficient as Lattice Encryption?
Abstract
Existing lattice signature schemes are much less efficient than encryption schemes due to the rejection sampling paradigm. We give a construction of comparable efficiency with lattice encryption that avoids sampling using structured secrets together with temporary keys. Structured secrets (and randoms) also improve existing lattice encryption schemes to nearly the same extreme efficiency. Our signature scheme allows the same parameters of any encryption schemes (a variation of the basic form is needed when the modulus is as small as 1-byte) and has comparable efficiency with our extreme encryption efficiency. For lightweight implementation, our techniques allow integrating of public-key encryption and signature in a simple circuit which only needs to do small integer additions as the main part of the computation.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2021-01-02: last updated
- 2021-01-02: published
- Short URL
- https://ia.cr/2021/002
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/002,
author = {Dingfeng Ye},
title = {Can Lattice Signature be as Efficient as Lattice Encryption?},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/002},
year = {2021},
url = {https://eprint.iacr.org/2021/002}
}