Smaller decoding exponents: ball-collision decoding
From MaRDI portal
(Redirected from Publication:5199223)
Recommendations
Cited in
(62)- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
- Encryption scheme based on expanded Reed-Solomon codes
- An improved algorithm for learning sparse parities in the presence of noise
- Cryptanalysis of LEDAcrypt
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- On the design and security of Lee metric McEliece cryptosystems
- Cryptanalysis of the binary permuted kernel problem
- Construction of binary Hadamard codes and their \(s\)-PD sets
- 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
- Information-set decoding with hints
- Computational aspects of retrieving a representation of an algebraic geometry code
- Structural cryptanalysis of McEliece schemes with compact keys
- Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
- Enhanced public key security for the McEliece cryptosystem
- On solving LPN using BKW and variants, Implementation and analysis
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Decoding one out of many
- An efficient attack on all concrete KKS proposals
- Monoidic codes in cryptography
- Improved information set decoding for code-based cryptosystems with constrained memory
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
- Low-complexity cryptographic hash functions
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
- Syndrome Decoding Estimator
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Generalization of the ball-collision algorithm
- Theory of Cryptography
- TinyKeys: a new approach to efficient multi-party computation
- Pseudorandom correlation functions from variable-density LPN, revisited
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- On the hardness of the Lee syndrome decoding problem
- Solving the learning parity with noise problem using quantum algorithms
- An algorithm for generalized syndrome decoding problem
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems
- Breaking Goppa-based McEliece with hints
- Improved information set decoding algorithms over Galois ring in the Lee metric
- Decoding McEliece with a hint -- secret Goppa key parts reveal everything
- Non-interactive secure computation of inner-product from LPN and LWE
- Correlated pseudorandomness from expand-accumulate codes
- Statistical decoding 2.0: reducing decoding to LPN
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- High weight code-based signature scheme from QC-LDPC codes
- \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}
- How to find small AI-systems for antiblocking decoding
- Rigorous foundations for dual attacks in coding theory
- Revisiting nearest-neighbor-based information set decoding
- Concrete time/memory trade-offs in generalised Stern's ISD algorithm
- Integer syndrome decoding in the presence of noise
- CryptAttackTester: high-assurance attack analysis
- Stationary syndrome decoding for improved PCGs
- Increasing index sizes for information set decoding algorithms
- Information-set decoding for convolutional codes
- Quadratic modelings of syndrome decoding
- A new path to code-based signatures via identification schemes with restricted errors
- Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
- Attacks on Goldreich's pseudorandom generators by grouping and solving
- Cross-paradigm models of restricted syndrome decoding with application to CROSS
- The May-Ozerov algorithm for syndrome decoding is ``galactic
- Information set decoding in the Lee metric with applications to cryptography
This page was built for publication: Smaller decoding exponents: ball-collision decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199223)
