An efficient pseudo-random generator provably as secure as syndrome decoding
Jean-Bernard Fischer,Jacques Stern +1 more
- pp 245-255
TLDR
A simple and efficient construction of a pseudo-random generator based on the intractability of an NP-complete problem from the area of error-correcting codes that generates a linear amount of bits in only quadratic computing time is shown.Abstract:
We show a simple and efficient construction of a pseudo-random generator based on the intractability of an NP-complete problem from the area of error-correcting codes. The generalor is proved as secure as a hard instance of the syndrome decoding problem. Each application of the scheme generates a linear amount of bits in only quadratic computing time.read more
Citations
More filters
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Book ChapterDOI
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
TL;DR: Public-key and symmetric-key cryptosystems that provide security for key-dependent messages and enjoy circular security and a pseudorandom generator that can be computed by a circuit of n ·polylog(n) size are constructed.
Book ChapterDOI
Lattice Signatures and Bimodal Gaussians
TL;DR: In this article, a lattice-based digital signature scheme was proposed that represents an improvement, both in theory and in practice, over today's most efficient lattice primitives.
Book ChapterDOI
Practical lattice-based cryptography: a signature scheme for embedded systems
TL;DR: This work presents a signature scheme whose security is derived from the hardness of lattice problems and is based on recent theoretical advances in lattice-based cryptography and is highly optimized for practicability and use in embedded systems.
Book ChapterDOI
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
Daniele Micciancio,Petros Mol +1 more
TL;DR: In this paper, the pseudorandomness of bounded knapsack functions over arbitrary finite abelian groups was studied and the main technical contribution of this paper is a new, general theorem that provides sufficient conditions under which pseudorance of bounded k-knapsack function follows directly from their one-wayness.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
The Theory of Error-Correcting Codes
TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Journal ArticleDOI
On the inherent intractability of certain coding problems (Corresp.)
TL;DR: The fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists.