On the Construction of Random Number Generators and Random Function Generators-Reference-Cited by-同舟云学术

On the Construction of Random Number Generators and Random Function Generators

Published:1988 Issue: Volume: Page:225-232
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Schnorr C. P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45961-8_19

Reference8 articles.

1. Alexi, W., Chor, B., Goldreich, O., and Schnorr, C.P.: RSA and Rabin Functions: certain parts a r e a s hard as the whole. Proceeding of the 25th Symposium on Foundations of Computer Science, 1984, pp. 449-457

2. also: Siam Journal on Comput., (1988).

3. Blum, L., Blum, M. and Shub, M.: A simple unpredictable pseudo-random number generator. Siam J. on Computing (1986), pp. 364–383.

4. Blum, M. and Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, IEEE, New York (1982); also Siam J. Comput. 13 (1984) pp. 850–864.

5. Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, IEEE, New York. (1984); also Journal ACM 33,4 (1986) pp. 792–807.

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. References;Applied Cryptography, Second Edition;2015-10-09

2. Numerical Semigroups and Bounds on Impossible Differential Attacks on Generalized Feistel Schemes;Communications in Computer and Information Science;2014

3. t-resilient functions and the partial exposure problem;Applicable Algebra in Engineering, Communication and Computing;2008-02-07

4. Pseudorandomness of Camellia-Like Scheme;Journal of Computer Science and Technology;2006-01

5. How to Re-use Round Function in Super-Pseudorandom Permutation;Information Security and Privacy;2004