Author:
Fan Junfeng,Vercauteren Frederik,Verbauwhede Ingrid
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Lecture Notes in Computer Science;P.S.L.M. Barreto,2002
2. Lecture Notes in Computer Science;P. Barrett,1987
3. Beuchat, J., Detrey, J., Estibals, N., Okamoto, E., Rodríguez-Henríquez, F.: Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers. Cryptology ePrint Archive, Report 2009/122 (2009), http://eprint.iacr.org/
4. Chung, J., Hasan, M.A.: Low-Weight Polynomial Form Integers for Efficient Modular Multiplication. IEEE Trans. Comput. 56(1), 44–57 (2007)
5. Chung, J., Hasan, M.A.: Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers. In: ARITH 2007: Proceedings of the 18th IEEE Symposium on Computer Arithmetic, Washington, DC, USA, 2007, pp. 230–239. IEEE Computer Society Press, Los Alamitos (2007)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献