Cryptology ePrint Archive: Report 2016/467

Speeding up R-LWE post-quantum key exchange

Shay Gueron and Fabian Schlieker

Abstract: 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 \etal 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 \etal, 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 \etal by up to 1.59x on the server side, and by up to 1.54x on the client side.

Category / Keywords: implementation / Post-quantum key exchange, Ring-LWE, software optimization, AVX2, AVX512, AES-NI

Date: received 14 May 2016

Contact author: shay at math haifa ac il

Available format(s): PDF | BibTeX Citation

Version: 20160517:151016 (All versions of this report)

Short URL: ia.cr/2016/467

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]