Efficient algorithms and architectures for field multiplication using Gaussian normal bases
暂无分享,去创建一个
[1] Dieter Gollmann,et al. Algorithm engineering for public key algorithms , 1989, IEEE J. Sel. Areas Commun..
[2] M. Anwar Hasan,et al. Efficient digit-serial normal basis multipliers over GF(2/sup m/) , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).
[3] H. Niederreiter,et al. Introduction to finite fields and their applications: Factorization of Polynomials , 1994 .
[4] M. Anwar Hasan,et al. Fast Normal Basis Multiplication Using General Purpose Processors , 2001, Selected Areas in Cryptography.
[5] Keshab K. Parhi,et al. Low-Energy Digit-Serial/Parallel Finite Field Multipliers , 1998 .
[6] Yiqi Dai,et al. Two Software Normal Basis Multiplication Algorithms for GF(2n) , 2004, IACR Cryptol. ePrint Arch..
[7] S. Vanstone,et al. OPTIMAL NORMAL BASES IN GF(p”)* , 2002 .
[8] Gerald E. Sobelman,et al. Improved VLSI designs for multiplication and inversion in GF(2/sup M/) over normal bases , 2000, Proceedings of 13th Annual IEEE International ASIC/SOC Conference (Cat. No.00TH8541).
[9] Wolfgang Bauer. Implementing elliptic curve cryptography , 2002, Communications and Multimedia Security.
[10] M. Anwar Hasan,et al. Low complexity word-level sequential normal basis multipliers , 2005, IEEE Transactions on Computers.
[11] Berk Sunar,et al. An Efficient Optimal Normal Basis Type II Multiplier , 2001, IEEE Trans. Computers.
[12] Alfred Menezes,et al. Software Implementation of Elliptic Curve Cryptography over Binary Fields , 2000, CHES.
[13] Joachim von zur Gathen,et al. Algorithms for Exponentiation in Finite Fields , 2000, J. Symb. Comput..
[14] Ian F. Blake,et al. Low complexity normal bases , 1989, Discret. Appl. Math..
[15] Charles C. Wang,et al. An Algorithm to Design Finite Field Multipliers Using a Self-Dual Normal Basis , 1987, IEEE Trans. Computers.
[16] Chung-Chin Lu,et al. A Search of Minimal Key Functions for Normal Basis Multipliers , 1997, IEEE Trans. Computers.
[17] Gordon B. Agnew,et al. An implementation for a fast public-key cryptosystem , 2004, Journal of Cryptology.
[18] Ronald C. Mullin,et al. Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..
[19] R. J. Beynon,et al. Computers , 1985, Comput. Appl. Biosci..
[20] Gui Liang Feng. A VLSI Architecture for Fast Inversion in GF(2^m) , 1989, IEEE Trans. Computers.
[21] Michele Elia,et al. On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/) , 2002, IEEE Trans. Computers.
[22] Alfred Menezes,et al. The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.
[23] M. Anwar Hasan,et al. Efficient digit-serial normal basis multipliers over binary extension fields , 2004, TECS.
[24] Kris Gaj,et al. Efficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography , 2004, CHES.
[25] Peng Ning,et al. Efficient Software Implementation for Finite Field Multiplication in Normal Basis , 2001, ICICS.
[26] Jongin Lim,et al. Modified Sequential Normal Basis Multipliers for Type II Optimal Normal Bases , 2005, ICCSA.
[27] Ricardo Dahab,et al. Software multiplication using Gaussian normal bases , 2006, IEEE Transactions on Computers.
[28] Dieter Gollmann,et al. Symmetry and Duality in Normal Basis Multiplication , 1988, AAECC.
[29] M. Anwar Hasan,et al. A New Construction of Massey-Omura Parallel Multiplier over GF(2m) , 2002, IEEE Trans. Computers.
[30] Trieu-Kien Truong,et al. VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.