Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory
From MaRDI portal
Publication:3452571
DOI10.1007/978-3-319-19647-3_23zbMath1408.94994OpenAlexW2402763240MaRDI QIDQ3452571
Publication date: 12 November 2015
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_23
McEliecesyndrome decodinginformation set decodingconstrained memoryrandom linear codesdissection technique
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A low-memory algorithm for finding short product representations in finite groups.
- Parallel collision search with cryptanalytic applications
- Open problems around exact algorithms
- A Tutorial on High Performance Computing Applied to Cryptanalysis
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Improved Generic Algorithms for Hard Knapsacks
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- The Factorization of the Ninth Fermat Number
- SWIFFT: A Modest Proposal for FFT Hashing
- Attacking and Defending the McEliece Cryptosystem
- New Generic Algorithms for Hard Knapsacks
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Security Bounds for the Design of Code-Based Cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
- Smaller Decoding Exponents: Ball-Collision Decoding
- Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory
