Dual-Field multiplier is the important component of Dual-Field Montgomery multiplier and has important meaning for elliptic curve cryptography. Considering that the critical path of Dual-Field multiplier depends on the GF() field
Partial product generating circuit and Wallace compressor circuit was optimized based on traditional radix-4 Booth encoder multiplier(GF()) to support both GF() and GF(2 ) field. The designed Dual-Field multiplier implemented on FPGA shows that the area is decreased by 16.9% compare to the separating implement. The delay is increased by 1.188 ns than the traditional field GF(). The designed Dual-Field multiplier is applied to Montgomery multiplier. The time for 256 bit Montgomery multiplier of our design is reduced by 7.35% than paper proposed.
关键词
Keywords
references
Swee K L S, Hiung L H. Performance comparison review of 32-bit multiplier designs[C]//Intelligent and Advanced Systems (ICIAS), 2012 4th International Conference on. Kuala Lumpur, IEEE, 2012(2): 836-841.
Tenca A F, Savas E, Koc C K. A design framework for scalable and unified multipliers in GF (p) and GF (2m)[J]. International Journal of Computer Research, 2004, 13(1): 68-83. DOI: 68
Satoh A, Takano K. A scalable dual-field elliptic curve cryptographic processor[J]. Computers, IEEE Transactions on, 2003, 52(4): 449-460. DOI: 449
Yeh W C, Jen C W. High-speed booth encoded parallel multiplier design[J]. Computers, IEEE Transactions on, 2000, 49(7): 692-701. DOI: 692
Ma W, Li S. A new high compression compressor for large multiplier[C]//Solid-State and Integrated-Circuit Technology, ICSICT 2008.9th International Conference on. Beijing, IEEE, 2008: 1877-1880.