Author:
Bellare Mihir,Goldwasser Shafi,Micciancio Daniele
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. L. Babai. On Lovász' lattice reduction and the nearest lattice point problem. Combinatorica, 6(1):1–13, 1986.
2. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993.
3. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Computing, 13(4):850–863, November 1984.
4. Joan Boyar. Inferring sequences produced by pseudo-random number generators. Journal of the ACM, 36(1):129–141, January 1989.
5. A. M. Frieze, R. Kannan, and J. C. Lagarias. Linear congruential generators do not produce random sequences. In Proc. 25th IEEE Symp. on Foundations of Comp. Science, pages 480–484, Singer Island, 1984. IEEE.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. How (Not) to Build Threshold EdDSA;Proceedings of the 26th International Symposium on Research in Attacks, Intrusions and Defenses;2023-10-16
2. Electromagnetic Side-Channel Analysis Against TERO-Based TRNG;IEEE Transactions on Electromagnetic Compatibility;2022-10
3. A DSA-like digital signature protocol;Journal of Discrete Mathematical Sciences and Cryptography;2020-10-12
4. A True Random Number Generator Method Embedded in Wireless Communication Systems;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2020-04-01
5. New Class of Non-binary Pseudorandom Number Generators;Advanced Technologies in Robotics and Intelligent Systems;2020