Quantum Resistant Public Key Encryption Scheme polarRLCE
From MaRDI portal
Publication:3294872
DOI10.1007/978-3-030-36237-9_7zbMath1457.94160OpenAlexW2995381399MaRDI QIDQ3294872
Zongxinag Yi, Yongge Wang, Jingang Liu, Pei Dingyi
Publication date: 29 June 2020
Published in: Algebra, Codes and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-36237-9_7
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhanced public key security for the McEliece cryptosystem
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- On the CCA2 security of McEliece in the standard model
- QC-MDPC: a timing attack and a CCA2 KEM
- McEliece public key cryptosystems using algebraic-geometric codes
- Recovering short secret keys of RLCE in polynomial time
- Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- Square Code Attack on a Modified Sidelnikov Cryptosystem
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
- Squares of Random Linear Codes
- Attacking and Defending the McEliece Cryptosystem
- Information-Set Decoding for Linear Codes over F q
- Security Bounds for the Design of Code-Based Cryptosystems
- A public-key cryptosystem based on binary Reed-Muller codes
- On the edge-independence number and edge-covering number for regular graphs
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Cryptanalysis of the Sidelnikov Cryptosystem
This page was built for publication: Quantum Resistant Public Key Encryption Scheme polarRLCE
