Subject
Applied Mathematics,General Engineering,Algebra and Number Theory,Theoretical Computer Science
Reference30 articles.
1. Generating hard instances of lattice problems;Ajtai;Electron. Colloq. Comput. Compl.,1996
2. W. Banks, F. Griffin, D. Lieman, and I. E. Shparlinski, Non-linear complexity of the Naor–Reingold pseudo-random function, InProc. the 2nd Intern. Conf. on Information Security and Cryptology, Seoul, 1999, Lecture Notes in Comput Sci., Springer-Verlag, Berlin, in press.
3. A simple unpredictable pseudo-random number generator;Blum;SIAM J. Comput.,1986
4. Speeding up discrete log and factoring based schemes via precomputations;Boyko,1998
5. R. Canetti, J. B. Friedlander, S. Konyagin, M. Larsen, D. Lieman, and, I. E. Shparlinski, On the statistical properties of Diffie–Hellman distributions, Israel J. Math, in press.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献