Revisiting nearest-neighbor-based information set decoding
type: Item
instance of: scholarly article
title: Revisiting nearest-neighbor-based information set decoding
DOI: 10.1007/978-3-031-47818-5_3
author: Andre Esser
publication date: 2024-08-30T00:00:00Z
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7904513
zbMATH Keywords: representation technique
zbMATH Keywords: syndrome decoding
zbMATH Keywords: nearest neighbor search
zbMATH Keywords: code-based cryptography
MaRDI profile type: Publication
cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
cites work: Smaller Decoding Exponents: Ball-Collision Decoding
cites work: Improved classical and quantum algorithms for subset-sum
cites work: Decoding linear codes with high error rate and its impact for LPN security
cites work: Statistical decoding 2.0: reducing decoding to LPN
cites work: Syndrome Decoding Estimator
cites work: Q6146248
cites work: McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
cites work: New time-memory trade-offs for subset sum -- improving ISD in theory and practice
cites work: Q4542583
cites work: A probabilistic algorithm for computing minimum weights of large error-correcting codes
cites work: Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
cites work: On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
cites work: Q3835408
cites work: Analysis of Information Set Decoding for a Sub-linear Error Weight
cites work: Q3250141
description: scientific article; zbMATH DE number 7904513