The Design and FPGA Implementation of GF(2^128) Multiplier for Ghash
暂无分享,去创建一个
[1] Çetin Kaya Koç,et al. On fully parallel Karatsuba multipliers for GF(2 m) , 2003 .
[2] Huapeng Wu,et al. Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields , 2008, IEEE Transactions on Computers.
[3] D. McGrew,et al. The Galois/Counter Mode of Operation (GCM) , 2005 .
[4] Majid Ahmadi,et al. A high speed word level finite field multiplier using reordered normal basis , 2008, 2008 IEEE International Symposium on Circuits and Systems.
[5] A. Satoh. High-speed hardware architectures for authenticated encryption mode GCM , 2006, 2006 IEEE International Symposium on Circuits and Systems.
[6] Wai Keung Wong,et al. FPGA implementation of a microcoded elliptic curve cryptographic processor , 2000, Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871).
[7] M. Anwar Hasan,et al. Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m) , 2004, IEEE Transactions on Computers.
[8] Gang Zhou,et al. Efficient and High-Throughput Implementations of AES-GCM on FPGAs , 2007, 2007 International Conference on Field-Programmable Technology.