Speeding up R-LWE Post-quantum Key Exchange [chapter]

Shay Gueron, Fabian Schlieker
2016 Lecture Notes in Computer Science  
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
more » ... ing 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.59x on the server side, and by up to 1.54x on the client side.
doi:10.1007/978-3-319-47560-8_12 fatcat:ouvydjyguvehlefiv74jr5djdq