McBits: Fast Constant-Time Code-Based Cryptography. This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks. For example, at a 2128 security level, this paper achieves a reciprocal decryption throughput of just 60493 cycles (plus cipher cost etc.) on a single Ivy Bridge core. These algorithms rely on an additive FFT for fast root computation, a transposed additive FFT for fast syndrome computation, and a sorting network to avoid cache-timing attacks.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Cayrel, Pierre-Louis; Gueye, Cheikh Thiecoumba; Mboup, El Hadji Modou; Ndiaye, Ousmane; Persichetti, Edoardo: Efficient implementation of hybrid encryption from coding theory (2017)
- Baldi, Marco; Bianchi, Marco; Chiaraluce, Franco; Rosenthal, Joachim; Schipani, Davide: Enhanced public key security for the McEliece cryptosystem (2016)
- Bernstein, Daniel J.; Chou, Tung: Faster binary-field multiplication and faster binary-field macs (2014)
- Bernstein, Daniel J.; Chou, Tung; Schwabe, Peter: Mcbits: fast constant-time code-based cryptography (2013)