Post-quantum cryptography has attracted increased attention in the last couple of years, due to the threat of quantum computers breaking current cryptosystems. In particular, the key size and performance of post-quantum algorithms became a significant target for optimization. In this spirit, Alkim et al. have recently proposed a significant optimization for a key exchange scheme that is based on the R-LWE problem. In this paper, we build on the implementation of Alkim et al., and focus on improving the algorithm for generating a uniformly random polynomial. We optimize three independent directions: efficient pseudorandom bytes generation, decreasing the rejection rate during sampling, and vectorizing the sampling step. When measured on the latest Intel processor Architecture Codename Skylake, our new optimizations improve over Alkim et al. by up to 1.59× on the server side, and by up to 1.54× on the client side.
|Title of host publication||Secure IT Systems - 21st Nordic Conference, NordSec 2016, Proceedings|
|Editors||Juha Roning, Billy Bob Brumley|
|Number of pages||12|
|State||Published - 2016|
|Event||21st Nordic Conference on Secure IT Systems, NordSec 2016 - Oulu, Finland|
Duration: 2 Nov 2016 → 4 Nov 2016
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||21st Nordic Conference on Secure IT Systems, NordSec 2016|
|Period||2/11/16 → 4/11/16|
Bibliographical noteFunding Information:
This research was supported by the PQCRYPTO project, which was partially funded by the European Commission Horizon 2020 research Programme, grant #645622, and by the ISRAEL SCIENCE FOUNDATION (grant No. 1018/16).
© Springer International Publishing AG 2016.
- Post-quantum key exchange
- Software optimization
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)