Author:
Chen Yuanmi,Nguyen Phong Q.
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than
$N^{\mbox{0.292}}$
. IEEE Transactions on Information Theory 46(4), 1339 (2000)
2. Bostan, A., Gaudry, P., Schost, E.: Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator. SIAM Journal on Computing 36(6), 1777–1806 (2007)
3. Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. Cryptology ePrint Archive, Report 2011/344 (2011),
http://eprint.iacr.org/
4. Lecture Notes in Computer Science;Y. Chen,2011
5. Chen, Y., Nguyen, P.Q.: Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. Cryptology ePrint Archive, Report 2011/436 (2011),
http://eprint.iacr.org/
Cited by
75 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献