References
- R. Lidl and H. Niederreiter, Introduction to finite fields and its applications, Cambridge Univ. Press, 1994
- A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone, and T. Yaghoobian, Applications of finitr fields, Kluwer Academic, 1993
-
T. Itoh and S. Tsujii, 'Structure of parallel multipliers for a class of fields GF(
$2^m$ )', information and Computation, vol. 83, pp. 21-40, 1989 https://doi.org/10.1016/0890-5401(89)90045-X - C.K. Koc and B. Sunar, 'Low-complexity bit-parallel canonical and normal basis multipliers ?for a class of finite fields', IEEE Trans. vol. 47, no. 3, pp. 353-356, Mar, 1998 https://doi.org/10.1109/12.660172
- H. Wu and M.A. Hasan, 'Low Complexity bit-parallel multipliers for a class of finite fields', IEEE Trans. vol. 47, no. 8, pp. 883-887, Aug., 1998 https://doi.org/10.1109/12.707588
- B. Sunar and C.K. Koc, 'An efficient optimal normal basis type II multiplier', IEEE Trans. vol. 50, no. 1, pp. 83-88, Jan., 2001 https://doi.org/10.1109/12.902754
- G.B. Agnew, R.C. Mullin, I. Onyszchuk, and S.A. Vanstone, 'An implementation for a fast public key cryptosystem,' J. Cryptology, vol. 3, pp.63-79, 1991 https://doi.org/10.1007/BF00196789
- J.L Massey and J.K. Omura, Computational method and apparatus for finite field arithmetic, US Patent No. 4,587,627, to OMNET Assoc., Sunnyvale CA, Washington, D.C.: Patent Trademark Office, 1986
- M.A. Hasan, M.Z. Wang, and V.K. Bhargava, 'A modified Massey-Omura parallel multiplier for a class of finite fields', IEEE Trans. vol. 42, no. 10, pp. 1278-1280, Oct, 1993 https://doi.org/10.1109/12.257715
-
S. Kwon, K. Gaj, C.H. Kim, C.P. Hong, 'Efficient Linear Array for Multiplication in GF(
$2^m$ ) Using a Normal Basis for Elliptic Curve Cryptography,' CHES 2004, LNCS 3156, pp, 76-91, 2004 https://doi.org/10.1007/b99451 -
A. Reyhani-Masoleh and M.A. Hasan, 'Low complexity sequential normal basis multipliers over GF(
$2^m$ ),' 16th IEEE Symposium on Computer Arithmetic, vol. 16, pp. 188-195, 2003 https://doi.org/10.1109/ARITH.2003.1207678 - A. Reyhani-Masoleh and M.A. Hasan, 'Efficient Digit-Serial Normal Basis Multipliers over Binary Extension Fields,' ACM Trans. on Embedded m(m + 1)/2 ed Computing Systems (TECS), Special Issue on Embedded Systems and Security, pp. 575-592, vol. 3, Issue 3, August 2004 https://doi.org/10.1145/1015047.1015053
- A. Reyhani-Masolleh and M.H. Hasan, 'Low Complexity -Word-Level Sequential Normal Basis Multipliers', IEEE Trans. vol. 54, no. 2, pp. 98-110, February, 2005 https://doi.org/10.1109/TC.2005.29
-
A. Reyhani-Masolleh and M.H. Hasan, 'A new construction of Massey-Omura parallel multiplier over GF(
$2^m$ )', IEEE Trans. vol. 51, no. 5, pp. 512-520, May, 2002 https://doi.org/10.1109/TC.2002.1004590 - A. Reyhani-Masolleh and M.H. Hasan, 'Efficient multiplication beyond optimal normal bases', IEEE Trans. vol. 52, no. 4, pp. 428-439, April, 2003 https://doi.org/10.1109/TC.2003.1190584
- D.J. Yang, C.H. Kim, Y. Park, Y.. Kim, and J. Lim, 'Modified Sequential Normal Basis Multipliers for Type II Optimal Normal Bases', ICCSA 2005, LNCS 3481, pp.647-656, 2005 https://doi.org/10.1007/11424826_68
-
C.H. Kim, S. Oh, and J. Lim, 'A new hardware architecture for operations in GF(
$2^n$ )', IEEE Trans. vol. 51, no. 1, pp. 90-92, Jan, 2002 https://doi.org/10.1109/12.980019 - IEEE P1363, Standard specifications for public key cryptography, Draft 13, 1999
- ANSI X 9.63, Public key cryptography for the financial services industry: Elliptic curve key agreement and transport protocols, draft, 1998
- S. Gao Jr. and H.W. Lenstra, 'Optimal normal bases', Designs, Codes and Cryptography, vol. 2, pp. 315-323, 1992 https://doi.org/10.1007/BF00125200