Programmable RNS lattice-based parallel cryptographic decryption

Abstract : —Should quantum computing become viable, current public-key cryptographic schemes will no longer be valid. Since cryptosystems take many years to mature, research on post-quantum cryptography is now more important than ever. Herein, lattice-based cryptography is focused on, as an alternative post-quantum cryptosystem, to improve its efficiency. We put together several theoretical developments so as to produce an efficient implementation that solves the Closest Vector Problem (CVP) on Goldreich-Goldwasser-Halevi (GGH)-like cryptosystems based on the Residue Number System (RNS). We were able to produce speed-ups of up to 5.9 and 11.2 on the GTX 780 Ti and i7 4770K devices, respectively, when compared to a single-core optimized implementation. Finally, we show that the proposed implementation is a competitive alternative to the Rivest-Shamir-Adleman (RSA).
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01202056
Contributor : Jean Claude Bajard <>
Submitted on : Friday, September 18, 2015 - 3:47:45 PM
Last modification on : Thursday, March 21, 2019 - 2:17:02 PM
Long-term archiving on : Tuesday, December 29, 2015 - 8:44:23 AM

File

ASAP2015F.pdf
Files produced by the author(s)

Identifiers

Citation

Paulo Martins, Leonel Sousa, Julien Eynard, Jean-Claude Bajard. Programmable RNS lattice-based parallel cryptographic decryption. IEEE ASAP 2015 Conference, Jul 2015, Totonto, Canada. ⟨10.1109/ASAP.2015.7245723⟩. ⟨hal-01202056⟩

Share

Metrics

Record views

137

Files downloads

502