Toward secure implementation of McEliece decryption
From MaRDI portal
Publication:2360179
DOI10.1007/978-3-319-21476-4_10zbMATH Open1365.94427OpenAlexW2294492671MaRDI QIDQ2360179FDOQ2360179
Authors: Mariya Georgieva, Frédéric de Portzamparc 
Publication date: 26 June 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-21476-4_10
Recommendations
Cites Work
- Implementation of McEliece based on quasi-dyadic Goppa codes for embedded devices
- The algebraic decoding of Goppa codes
- McBits: fast constant-time code-based cryptography
- On the inherent intractability of certain coding problems (Corresp.)
- A method for solving key equation for decoding goppa codes
- Code-based cryptography
- Side Channels in the McEliece PKC
- A timing attack against the secret permutation in the McEliece PKC
- Timing attacks against the syndrome inversion in code-based cryptosystems
- Title not available (Why is that?)
- A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem
Cited In (9)
- Code-Based Key Encapsulation from McEliece’s Cryptosystem
- A timing attack against the secret permutation in the McEliece PKC
- McBits: fast constant-time code-based cryptography
- Towards Side-Channel Resistant Implementations of QC-MDPC McEliece Encryption on Constrained Devices
- McBits revisited
- Preventing timing attacks against RQC using constant time decoding of Gabidulin codes
- Side Channels in the McEliece PKC
- Designing a Rank Metric Based McEliece Cryptosystem
- Hybrid Encryption from McEliece Cryptosystem with Pseudo-random Error Vector
This page was built for publication: Toward secure implementation of McEliece decryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2360179)
