Cryptology ePrint Archive: Report 2017/793

McBits Revisited

Tung Chou

Abstract: This paper presents a constant-time fast implementation for a high-security code-based encryption system. The implementation is based on the “McBits” paper by Bernstein, Chou, and Schwabe in 2013: we use the same FFT algorithms for root finding and syndrome computation, similar algorithms for secret permutation, and bitslicing for low-level operations. As opposed to McBits, where a high decryption throughput is achieved by running many decryption operations in parallel, we take a different approach to exploit the internal parallelism in one decryption operation for the use of more applications. As the result, we manage to achieve a slightly better decryption throughput at a much higher security level than McBits. As a minor contribution, we also present a constant-time implementation for encryption and key-pair generation, with similar techniques used for decryption.

Category / Keywords: implementation / McEliece, Niederreiter, bitslicing, software implementation

Original Publication (with minor differences): IACR-CHES-2017

Date: received 21 Aug 2017

Contact author: blueprint at crypto tw

Available format(s): PDF | BibTeX Citation

Version: 20170825:190922 (All versions of this report)

Short URL: ia.cr/2017/793

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]