Author:
Chevallier-Mames Benoît,Joye Marc,Paillier Pascal
Publisher
Springer Berlin Heidelberg
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Recursive Double-Size Modular Multiplications from Euclidean and Montgomery Multipliers;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2010
2. Faster Double-Size Bipartite Multiplication out of Montgomery Multipliers;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2009
3. Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients;Topics in Cryptology – CT-RSA 2009;2009
4. Bipartite modular multiplication with twice the bit-length of multipliers;International Journal of Information Security;2008-07-05
5. Montgomery Multiplication with Twice the Bit-Length of Multipliers;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2008-01-01