Cryptology ePrint Archive: Report 2017/1251

A toolbox for software optimization of QC-MDPC code-based cryptosystems

Nir Drucker and Shay Gueron

Abstract: The anticipated emergence of quantum computers in the foreseeable future drives the cryptographic community to start considering cryptosystems, which are based on problems that remain intractable even with strong quantum computers. One example is the family of code-based cryptosystems that relies on the Syndrome Decoding Problem (SDP). Recent work by Misoczki et al. [34] showed a variant of McEliece encryption which is based on Quasi Cyclic - Moderate Density Parity Check (MDPC) codes, and has signifi cantly smaller keys than the original McEliece encryption. It was followed by the newly proposed QC-MDPC based cryptosystems CAKE [9] and Ouroboros [13]. These motivate dedicated new software optimizations. This paper lists the cryptographic primitives that QC-MDPC cryptosystems commonly employ, studies their software optimizations on modern processors, and reports the achieved speedups. It also assesses methods for side channel protection of the implementations, and their performance costs. These optimized primitives offer a useful toolbox that can be used, in various ways, by designers and implementers of QC-MDPC cryptosystems.

Category / Keywords: implementation / Code-based cryptosystems, MDPC

Date: received 28 Dec 2017

Contact author: shay gueron at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20171230:182940 (All versions of this report)

Short URL: ia.cr/2017/1251

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]