A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes
From MaRDI portal
Publication:6566686
DOI10.46298/jgcc.2020.12.1.6074MaRDI QIDQ6566686
Publication date: 3 July 2024
Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)
Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Fault analysis in cryptography. Foreword by Dan Boneh
- FPGA-based Niederreiter cryptosystem using binary Goppa codes
- Computational Linear and Commutative Algebra
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Attacking and Defending the McEliece Cryptosystem
- Side Channels in the McEliece PKC
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Code-based cryptography
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- A method for solving key equation for decoding goppa codes
- The algebraic decoding of Goppa codes
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A Side-Channel Assisted Cryptanalytic Attack Against QcBits
- FPGA-based Key Generator for the Niederreiter Cryptosystem Using Binary Goppa Codes
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks
- Shift-register synthesis and BCH decoding
This page was built for publication: A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes