McBits: Fast Constant-Time Code-Based Cryptography
From MaRDI portal
Publication:2851419
DOI10.1007/978-3-642-40349-1_15zbMath1353.94035OpenAlexW1508634734MaRDI QIDQ2851419
Peter Schwabe, Tung Chou, Daniel J. Bernstein
Publication date: 10 October 2013
Published in: Cryptographic Hardware and Embedded Systems - CHES 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40349-1_15
Related Items (15)
Toward secure implementation of McEliece decryption ⋮ Enhanced public key security for the McEliece cryptosystem ⋮ A practicable timing attack against HQC and its countermeasure ⋮ IND-CCA2 secure McEliece-type modification in the standard model ⋮ Computational Number Theory and Cryptography ⋮ Generalized approach for analysing quantum key distribution experiments ⋮ A new key recovery attack on a code-based signature from the Lyubashevsky framework ⋮ Exploiting ROLLO's constant-time implementations with a single-trace analysis ⋮ Verifying classic McEliece: examining the role of formal methods in post-quantum cryptography standardisation ⋮ Post-quantum key exchange for the Internet and the open quantum safe project ⋮ A side-channel attack against \textit{Classic McEliece} when loading the Goppa polynomial ⋮ Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation ⋮ Fast transforms over finite fields of characteristic two ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Efficient Implementation of Hybrid Encryption from Coding Theory
Uses Software
This page was built for publication: McBits: Fast Constant-Time Code-Based Cryptography
