Flexible GF(2m) divider design for cryptographic applications
暂无分享,去创建一个
[1] YanZhiyuan,et al. New Systolic Architectures for Inversion and Division in GF(2^m) , 2003 .
[2] P. Glenn Gulak,et al. An area-efficient universal cryptography processor for smart cards , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[3] Chin-Liang Wang,et al. Novel digit-serial systolic array implementation of Euclid's algorithm for division in GF(2/sup m/) , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).
[4] Çetin Kaya Koç,et al. A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm , 2003, IEEE Trans. Computers.
[5] Chien-Ming Wu,et al. High-Speed, Low-Complexity Systolic Designs of Novel Iterative Division Algorithms in GF(2^m) , 2004, IEEE Trans. Computers.
[6] Zhiyuan Yan,et al. New Systolic Architectures for Inversion and Division in GF(2^m) , 2003, IEEE Trans. Computers.
[7] Mohammed Benaissa,et al. Design space exploration of a hardware-software co-designed GF(2m) galois field processor for forward error correction and cryptography , 2003, CODES+ISSS '03.