An efficient pseudo-random generator provably as secure as syndrome decoding
From MaRDI portal
Recommendations
Cited in
(33)- Semantic security for the McEliece cryptosystem without random oracles
- Efficient amplification of the security of weak pseudo-random function generators
- Efficient authentication from hard learning problems
- On the concrete security of Goldreich's pseudorandom generator
- More constructions of lossy and correlation-secure trapdoor functions
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Practical continuously non-malleable randomness encoders in the random oracle model
- A code-based signature scheme from the Lyubashevsky framework
- Efficient cryptographic schemes provably as secure as subset sum
- RankSynd and PRNG based on rank metric
- Revisiting the security proof of QUAD stream cipher: some corrections and tighter bounds
- Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure
- Decoding one out of many
- scientific article; zbMATH DE number 176558 (Why is no real title available?)
- scientific article; zbMATH DE number 1740052 (Why is no real title available?)
- scientific article; zbMATH DE number 1455093 (Why is no real title available?)
- Agnostic Learning from Tolerant Natural Proofs
- About Low DFR for QC-MDPC Decoding
- On a decentralized trustless pseudo-random number generation algorithm
- A practical group signature scheme based on rank metric
- On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
- Oblivious Transfer Based on the McEliece Assumptions
- Pseudorandom generators without the XOR lemma
- On codes and learning with errors over function fields
- Code-Based Zero Knowledge PRF Arguments
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Injective rank metric trapdoor functions with homogeneous errors
- The hardness of LPN over any integer ring and field for PCG applications
- A minrank-based encryption scheme à la Alekhnovich-Regev
- The May-Ozerov algorithm for syndrome decoding is ``galactic
- QUAD: A multivariate stream cipher with provable security
- A BKW-style solver for the restricted syndrome decoding problem
This page was built for publication: An efficient pseudo-random generator provably as secure as syndrome decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876905)
