Efficient Linear Array for Multiplication in GF(2 m ) Using a Normal Basis for Elliptic Curve Cryptography-Reference-Cited by-同舟云学术

Efficient Linear Array for Multiplication in GF(2 m ) Using a Normal Basis for Elliptic Curve Cryptography

Published:2004 Issue: Volume: Page:76-91
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Kwon Soonhak,Gaj Kris,Kim Chang Hoon,Hong Chun Pyo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-28632-5_6.pdf

Reference16 articles.

1. Agnew, G.B., Mullin, R.C., Onyszchuk, I., Vanstone, S.A.: An implementation for a fast public key cryptosystem. J. Cryptology 3, 63–79 (1991)

2. Lecture Notes in Computer Science;G.B. Agnew,1988

3. Reyhani-Masoleh, A., Hasan, M.A.: Low complexity sequential normal basis multipliers over GF(2m). In: 16th IEEE Symposium on Computer Arithmetic, vol. 16, pp. 188–195 (2003)

4. Reyhani-Masoleh, A., Hasan, M.A.: A new construction of Massey-Omura parallel multiplier over GF(2m). IEEE Trans. Computers 51, 511–520 (2002)

5. Reyhani-Masoleh, A., Hasan, M.A.: Efficient multiplication beyond optimal normal bases. IEEE Trans. Computers 52, 428–439 (2003)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier;Arithmetic of Finite Fields;2010

2. Hardware Design Issues in Elliptic Curve Cryptography for Wireless Systems;Wireless Security and Cryptography;2007-03-30

3. New Architecture for Multiplication in GF(2 m ) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography;Information Security and Cryptology - ICISC 2005;2006

4. Efficient Linear Array for Multiplication over NIST Recommended Binary Fields;Fuzzy Logic and Applications;2006

5. Modified Serial Multipliers for Type-IV Gaussian Normal Bases;Progress in Cryptology - INDOCRYPT 2005;2005