scientific article
From MaRDI portal
Publication:3835408
zbMath0678.94006MaRDI QIDQ3835408
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Structural cryptanalysis of McEliece schemes with compact keys, Construction of binary Hadamard codes and their \(s\)-PD sets, Information set decoding in the Lee metric with applications to cryptography, Lower bounds on lattice sieving and information set decoding, Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\), Two attacks on rank metric code-based schemes: RankSign and an IBE scheme, Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory, Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension, Structural properties of self-dual monomial codes with application to code-based cryptography, Basics of Secrecy Coding, A new approach for finding low-weight polynomial multiples, Information-set decoding with hints, Using low-density parity-check codes to improve the McEliece cryptosystem, Syndrome Decoding Estimator, Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications], Pseudorandom correlation functions from variable-density LPN, revisited, New time-memory trade-offs for subset sum -- improving ISD in theory and practice, A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions, Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece}, On the hardness of the Lee syndrome decoding problem, S-semantics -- an example, Finding low-weight polynomial multiples using the rho method, Code-Based Signature Schemes from Identification Protocols in the Rank Metric, Assessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC Codes, Hybrid decoding -- classical-quantum trade-offs for information set decoding, Interleaved Prange: a new generic decoder for interleaved codes, A study of error floor behavior in QC-MDPC codes, An algorithm for generalized syndrome decoding problem, Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems, Attacking Reduced Round SHA-256, Optimization of $$\mathsf {LPN}$$ Solving Algorithms, Correlated pseudorandomness from expand-accumulate codes, A power side-channel attack on the Reed-Muller Reed-Solomon version of the HQC cryptosystem, Lifting standard model reductions to common setup assumptions, Statistical decoding 2.0: reducing decoding to LPN, Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems, Correlated pseudorandomness from the hardness of quasi-abelian decoding, Expand-convolute codes for pseudorandom correlation generators from LPN, A new decryption failure attack against HQC, Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation, A new algorithm for finding minimum-weight words in large linear codes, On the dimension and structure of the square of the dual of a Goppa code, Computational aspects of retrieving a representation of an algebraic geometry code, Attacking and Defending the McEliece Cryptosystem, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Quantum Resistant Public Key Encryption Scheme polarRLCE, Faster 2-Regular Information-Set Decoding, CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN, Reproducible families of codes and cryptographic applications, Really Fast Syndrome-Based Hashing, On generating invertible circulant binary matrices with a prescribed number of ones, TinyKeys: a new approach to efficient multi-party computation, Encryption scheme based on expanded Reed-Solomon codes, An improved algorithm for learning sparse parities in the presence of noise, Semantic security for the McEliece cryptosystem without random oracles, Wild McEliece, A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem, Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Decoding One Out of Many, An Efficient Attack on All Concrete KKS Proposals, Unnamed Item, Cryptanalysis of LEDAcrypt, On the design and security of Lee metric McEliece cryptosystems, Cryptanalysis of the binary permuted kernel problem, Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
