Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs
暂无分享,去创建一个
[1] Gang Zhou,et al. Efficient and High-Throughput Implementations of AES-GCM on FPGAs , 2007, 2007 International Conference on Field-Programmable Technology.
[2] J. Teich,et al. FPGA designs of parallel high performance GF(2/sup 233/) multipliers [cryptographic applications] , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..
[3] Berk Sunar,et al. A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers , 2004, IEEE Transactions on Computers.
[4] Kazumaro Aoki,et al. SEC X.2: Recommended Elliptic Curve Domain Parameters , 2008 .
[5] Çetin Kaya Koç,et al. On fully parallel Karatsuba multipliers for GF(2 m) , 2003 .
[6] Christof Paar,et al. Security on FPGAs: State-of-the-art implementations and attacks , 2004, TECS.
[7] Jürgen Teich,et al. FPGA designs of parallel high performance GF(2233) multipliers , 2003, ISCAS.
[8] Francisco Rodríguez-Henríquez,et al. Cryptographic Algorithms on Reconfigurable Hardware , 2010 .
[9] Gang Zhou,et al. Area optimization of bit parallel finite field multipliers with fast carry logic on FPGAS , 2008, 2008 International Conference on Field Programmable Logic and Applications.
[10] Peter L. Montgomery,et al. Five, six, and seven-term Karatsuba-like formulae , 2005, IEEE Transactions on Computers.
[11] F. Rodŕıguez-Henŕ,et al. On fully parallel Karatsuba Multipliers for � , 2003 .
[12] Francisco Rodríguez-Henríquez,et al. A fast implementation of multiplicative inversion over GF(2/sup m/) , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.
[13] Joachim von zur Gathen,et al. Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2 , 2005, Selected Areas in Cryptography.
[14] Francisco Rodríguez-Henríquez,et al. Cryptographic Algorithms on Reconfigurable Hardware (Signals and Communication Technology) , 2006 .
[15] Christof Paar,et al. Generalizations of the Karatsuba Algorithm for Efficient Implementations , 2006, IACR Cryptol. ePrint Arch..
[16] D. McGrew,et al. The Galois/Counter Mode of Operation (GCM) , 2005 .
[17] Mohammed Benaissa,et al. Fast Elliptic Curve Cryptography on FPGA , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[18] M. Anwar Hasan,et al. Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m) , 2004, IEEE Transactions on Computers.
[19] Christof Paar,et al. A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields , 1996, IEEE Trans. Computers.
[20] Chester Rebeiro,et al. Power Attack Resistant Efficient FPGA Architecture for Karatsuba Multiplier , 2008, 21st International Conference on VLSI Design (VLSID 2008).