A pseudorandom number generator based on worst-case lattice problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 503238 (Why is no real title available?)
- scientific article; zbMATH DE number 708826 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- Efficient cryptographic schemes provably as secure as subset sum
- Efficient software implementations of code-based hash functions and stream-ciphers
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Generalized Compact Knapsacks Are Collision Resistant
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Improved low-density subset sum algorithms
- Improving the performance of the SYND stream cipher
- Lossy trapdoor functions and their applications
- McEliece Cryptosystem Implementation: Theory and Practice
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
- New Applications of Time Memory Data Tradeoffs
- On lattices, learning with errors, random linear codes, and cryptography
- Predicting Lattice Reduction
- Public-key cryptosystems from the worst-case shortest vector problem
- QUAD: A multivariate stream cipher with provable security
- SWIFFT: A Modest Proposal for FFT Hashing
- Secure parameters for SWIFFT
- Solving low density knapsacks
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: A pseudorandom number generator based on worst-case lattice problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675485)
