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 generator 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.
Cite
CITATION STYLE
Fischer, J. B., & Stern, J. (1996). An efficient pseudo-random generator provably as secure as syndrome decoding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1070, pp. 245–255). Springer Verlag. https://doi.org/10.1007/3-540-68339-9_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
