McBits: fast constant-time code-based cryptography

DOI10.1007/978-3-642-40349-1_15MaRDI QIDQ2851419zbMATH OpenOpenAlexFDO

Authors Daniel J. Bernstein, Tung Chou, Peter Schwabe

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

zbMATH Keywords

bitslicingCFSMcElieceNiederreitersoftware implementation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• McBits revisited
• Toward secure implementation of McEliece decryption
• Timing attacks against the syndrome inversion in code-based cryptosystems
• Preventing timing attacks against RQC using constant time decoding of Gabidulin codes
• A practicable timing attack against HQC and its countermeasure

Cited in

(28)

• Post-quantum key exchange for the Internet and the open quantum safe project
• DAGS: key encapsulation using dyadic GS codes
• A practicable timing attack against HQC and its countermeasure
• Generalized approach for analysing quantum key distribution experiments
• Optimized and secure implementation of ROLLO-I
• Fast transforms over finite fields of characteristic two
• Don't forget your roots: constant-time root finding over \(\mathbb{F}_{2^m}\)
• Preventing timing attacks against RQC using constant time decoding of Gabidulin codes
• Toward secure implementation of McEliece decryption
• Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
• Enhanced public key security for the McEliece cryptosystem
• Faster binary-field multiplication and faster binary-field macs
• Fast Oblivious AES A Dedicated Application of the MiniMac Protocol
• Computational Number Theory and Cryptography
• Area-Time Efficient Computation of Niederreiter Encryption on QC-MDPC Codes for Embedded Hardware
• Timing attacks against the syndrome inversion in code-based cryptosystems
• IND-CCA2 secure McEliece-type modification in the standard model
• McBits revisited
• Efficient implementation of hybrid encryption from coding theory
• 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
• A side-channel attack against \textit{Classic McEliece} when loading the Goppa polynomial
• Choosing parameters for one IND-CCA2 secure McEliece modification in the standard model
• Smaller public keys for MinRank-based schemes
• Understanding binary-Goppa decoding
• A survey of polynomial multiplications for lattice-based cryptosystems
• Efficient isochronous fixed-weight sampling with applications to NTRU

Describes a project that uses

Uses Software

• McBits

This page was built for publication: McBits: fast constant-time code-based cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851419)