| Full text | |
| Author(s): |
Alkim, Erdem
;
Barreto, Paulo S. L. M.
;
Bindel, Nina
;
Kraemer, Juliane
;
Longa, Patrick
;
Ricardini, Jefferson E.
;
Conti, M
;
Zhou, J
;
Casalicchio, E
;
Spognardi, A
Total Authors: 10
|
| Document type: | Journal article |
| Source: | APPLIED CRYPTOGRAPHY AND NETWORK SECURITY (ACNS 2020), PT I; v. 12146, p. 20-pg., 2020-01-01. |
| Abstract | |
We present qTESLA, a post-quantum provably-secure digital signature scheme that exhibits several attractive features such as simplicity, strong security guarantees against quantum adversaries, and builtin protection against certain side-channel and fault attacks. qTESLA-selected for round 2 of NIST's post-quantum cryptography standardization project-consolidates a series of recent schemes originating in works by Lyubashevsky, and Bai and Galbraith. We provide full-fledged, constant-time portable C implementations consisting of only about 300 lines of C code, which showcases the code compactness of the scheme. Our results also demonstrate that a conservative, provably-secure signature scheme can be efficient and practical, even with a compact and portable implementation. For instance, our C-only implementation executes signing and verification in approximately 0.9 ms on an x64 Intel processor using the proposed level 1 parameter set. Finally, we also provide AVX2-optimized assembly implementations that achieve an additional factor-1.5 speedup. (AU) | |
| FAPESP's process: | 15/50520-6 - Efficient post-quantum cryptography for building advanced security applications |
| Grantee: | Marcos Antonio Simplicio Junior |
| Support Opportunities: | Research Grants - Research Partnership for Technological Innovation - PITE |