How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
One-way functions and pseudorandom generators
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
The discrete logarithm hides O(log n) bits
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Computerized patient information system in a psychiatric unit: five-year experience
Journal of Medical Systems
A new identification scheme based on syndrome decoding
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A method for finding codewords of small weight
Proceedings of the 3rd International Colloquium on Coding Theory and Applications
Efficient, Perfect Random Number Generators
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Efficient And Secure Pseudo-Random Number Generation
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
On the existence of pseudorandom generators
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Efficient cryptographic schemes provably as secure as subset sum
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Key management for encrypted broadcast
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Key management for encrypted broadcast
ACM Transactions on Information and System Security (TISSEC)
Pseudorandomness from Braid Groups
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
High-Speed Pseudorandom Number Generation with Small Memory
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Semantic security for the McEliece cryptosystem without random oracles
Designs, Codes and Cryptography
QUAD: A multivariate stream cipher with provable security
Journal of Symbolic Computation
Stronger security proofs for RSA and rabin bits
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Efficient authentication from hard learning problems
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
More constructions of lossy and correlation-secure trapdoor functions
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Low-reiter: niederreiter encryption scheme for embedded microcontrollers
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
QUAD: a practical stream cipher with provable security
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Communication efficient shuffle for mental poker protocols
Information Sciences: an International Journal
Improving the performance of the SYND stream cipher
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
An efficient IND-CCA2 secure variant of the niederreiter encryption scheme in the standard model
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Zero-knowledge protocols for the mceliece encryption
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Towards one cycle per bit asymmetric encryption: code-based cryptography on reconfigurable hardware
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Practical lattice-based cryptography: a signature scheme for embedded systems
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
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.