Author:
Catalano Dario,Nguyen Phong Q.,Stern Jacques
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. E. Bach and J. Shallit Algorithmic Number Theory, Vol. 1: Efficient Algorithms. MIT Press, 1996.
2. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM Journal on Computing, Vol. 13, No. 4:850–864, 1984.
3. Lect Notes Comput Sci;D. Catalano,2001
4. D. Catalano, R. Gennaro, N. Howgrave-Graham and P. Q. Nguyen. Paillier’s Cryptosystem Revisited. In 8th ACM Conference on Computer and Communication Security pp. 206–214, 2001.
5. H. Cohen. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, Vol 138, Springer, 1996.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献