Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
[1] Anokhin M. I., Varnovskii N. P., Sidelnikov V. M., Yaschenko V. V., Kriptografiya v bankovskom dele, MIFI, M., 1997
[2] Geri M., Dzhonson D., Vychislitelnye mashiny i trudno reshaemye zadachi, Mir, M., 1982 | MR
[3] Blum M., Micali S., “How to generate crytographically strong sequences of pseudo-random bits”, SIAM J. Comput., 13:4 (1984), 850–864 | DOI | MR | Zbl
[4] Goldwasser S., Micali S., Rackoff C., “The knowledge complexity of interactive proof systems”, SIAM J. Comput., 18:1 (1989), 186–208 | DOI | MR | Zbl
[5] Goldreich O., Micali S., Wigderson A., “Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems”, J. ACM, 38:3 (1991), 691–729 | DOI | MR | Zbl
[6] Hastad J., “Pseudo-random generators under uniform assumptions”, Proc. 22nd Annu. ACM Symp. on Theory of Computing, 1990, 395–404
[7] Impagliazzo R., Luby M., “One-way functions are essential for complexity based cryptography”, Proc. 30th Annu. Symp. on Found, of Comput. Sci., 1989, 230–235
[8] Impagliazzo R. , Levin L., Luby M., “Pseudo-random generation from one-way functions”, Proc. 21st Annu. ACM Symp. on Theory of Computing, 1989, 12–24
[9] Impagliazzo R., Rudich S., “Limits on the provable consequences of one-way permutations”, Proc. 21st Annu. ACM Symp. on Theory of Computing, 1989, 44–61 | MR
[10] Yao A. C., “Theory and applications of trapdoor functions”, Proc. 23rd Annu. Symp. on Found. of Comput. Sci., 1982, 80–91 | MR