LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
From MaRDI portal
Publication:2034992
DOI10.1007/s10623-021-00861-zzbMath1468.94414arXiv1812.04892OpenAlexW3153839025MaRDI QIDQ2034992
Julian Renner, Antonia Wachter-Zeh, Sven Puchinger
Publication date: 23 June 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.04892
Related Items (6)
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ On decoding high-order interleaved sum-rank-metric codes ⋮ Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem ⋮ Rank-Metric Codes and Their Applications ⋮ Decoding supercodes of Gabidulin codes and applications to cryptanalysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Semantic security for the McEliece cryptosystem without random oracles
- Error and erasure correcting algorithms for rank codes
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Fast operations on linearized polynomials and their applications in coding theory
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
- A new rank metric codes based encryption scheme
- A modular analysis of the Fujisaki-Okamoto transformation
- On the genericity of maximum rank distance and Gabidulin codes
- Secure integration of asymmetric and symmetric encryption schemes
- An IND-CCA-secure code-based encryption scheme using rank metric
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Preventing timing attacks against RQC using constant time decoding of Gabidulin codes
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
- Reducible rank codes and their applications to cryptography
- Grover vs. McEliece
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Fast Multiplication for Skew Polynomials
- On the List Decodability of Rank Metric Codes
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- Error-Correcting Codes in Projective Space
- Bounds on List Decoding of Rank-Metric Codes
- Progress in Cryptology – Mycrypt 2005
- Coding and Cryptography
This page was built for publication: LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
