Unified dual-field multiplier in GF(P) and GF(2k)

IET Information Security

Volumn 3, Issue 2, 2009, Pages 45-52

  Chiou, C W ^a   Lee, C Y ^b   Lin, J M ^c  

^a CHING YUN UNIVERSITY   (Taiwan)

^b LUNGHWA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^c FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALL-ONE POLYNOMIAL; BINARY EXTENSION FIELDS; BIT-SERIAL ARCHITECTURE; DUAL-FIELD MULTIPLIER; MONTGOMERY MULTIPLICATION ALGORITHMS; PRIME FIELD; SPACE AND TIME COMPLEXITY;

FREQUENCY MULTIPLYING CIRCUITS;

EID: 69249196756     PISSN: 17518709     EISSN: 17518717     Source Type: Journal    
DOI: 10.1049/iet-ifs.2007.0030     Document Type: Article

References (44)

1. Standard Specifications for Public Key Cryptography - Draft 13 IEEE P1363, November 1999
2. QUISQUTER J. J., COUVREUR C.: 'Fast decipherment algorithm for RSA public key cryptosystem', Electron. Lett., 1982, 18, (21), pp. 905-907
3. DIFFIE W., HELLMAN M. E.: 'New directions in cryptography', IEEE Trans. Inf. Theor., 1976, IT-22, pp. 644-654
4. ANSI X9.63, Public Key Cryptography for the Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography, ANSI standard, 2001
5. Committee Draft (CD.), ISO/IEC 15946: 'Information Technology - Security Techniques-Cryptographic Techniques Based on Elliptic Curves', Committee Draft (CD.), 1999
6. National Institute of Standards and Technology: 'Digital Signature Standard', FIPS Publication 186-., February 2000
7. ANSI X9.62: 'Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA) ', ANSI standar., 2001
8. m) ', CHES 200., 2000, (LNCS, 1965), pp. 277-292
9. GOODMAN J., CHANDRAKASAN A. P.: 'An energy-efficient reconfigurable public-key cryptography processor', IEEE J. Solid-State Circuit., 2001, 36, (11), pp. 1808-1820 (Pubitemid 33105947)
10. m) ', CHES 200., 2001, (LNCS, 2162), pp. 202-219 (Pubitemid 33329065)
11. m) ', CHES 200., 2003, (LNCS, 2523), pp. 500-514
12. n) ', IEE Proc., Comput. Digit. Technol., 2004, 151, (2), pp. 147-160
13. SATOH A., TAKANO K.: 'A scalable dual-field Elliptic Curve cryptographic processor', IEEE Trans. Comput., 2003, 52, (4), pp. 449-460
14. SZABO N., TANAKA R.: 'Residue arithmetic and its applications to computer technology' (McGraw-Hill, New York, 1967)
15. SODERSTRAND M. A., JENKINS W. K., TAYLOR F. J.: 'Residue number system arithmetic: modern applications in digital signal processing' (IEEE Press, New York, 1986)
16. RAO T. R. N., FUJIWARA E.: 'Error control coding of computer systems' (Prentice-Hall, 1989)
17. ZIMMERMANN R., CURIGER A., BONNENBERG H., KAESLIN H., FELBER N., FICHTNER W.: 'A 177 Mb/s VLSI implementation of the international data encryption algorithm', IEEE J. Solid-State Circuit., 1994, 29, (3), pp. 303-307
18. JENKINS W. K., LEON B. J.: 'The use of residue number systems in the design of finite impuse response digital filters', IEEE Trans. Circuits Syst., 1977, 24, (4), pp. 191-201
19. JOHNSON B. J.: 'Design and analysis of fault-tolerant digital systems' (Addison-Wesley, 1989)
20. HALSALL F.: 'Data communications, computer networks and open systems' (Addison-Wesley, 1996)
21. n - 1', IEEE Trans. Comput., 1992, 41, (8), pp. 957-961
22. n - 1 multipliers', IEEE Trans. Comput., 2004, 53, (3), pp. 370-374
23. MACWILLIAMS P. J., SLOANE N. J. A.: 'The theory of errorcorrecting codes' (North-Holland, Amsterdam, 1978)
24. LIDL R., NIEDERREITER H.: 'Introduction to finite fields and their applications' (Cambridge Univ. Press, New York, 1994)
25. BLAHUT R. E.: 'Fast algorithms for digital signal processing' (Addison-Wesley, Reading, Mass, 1985)
26. BARTEE T. C., SCHNEIDER D. J.: 'Computation with finite fields', Inf. Compu., 1963, 6, pp. 79-98
27. m) '. LNCS, No. 357, New York, Springer-Verlag, July 1988, pp. 297-309
28. KOç ç. K., SUNAR B.: 'Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields', IEEE Trans. Comput., 1998, 47, (3), pp. 353-356
29. m) using irreducible trinomials', IEE Proc., Comput. Digit. Tech., Jan. 2003, 150, (1), pp. 39-42
30. CHIOU C. W., LIN L. C., CHOU F. H., SHU S. F.: 'Low complexity finite field multiplier using irreducible trinomials', IEE Electron. Lett., 2003, 39, (24), pp. 1709-1711
31. m) ', Inf. Comput., 1989, 83, pp. 21-40
32. m) fields defined by all-one and equally-spaced polynomials', IEEE Trans. Comput., 2001, 50, (5), pp. 385-393
33. m) ', IEEE Trans. Comput., 1992, 41, (8), pp. 962-971
34. PAAR C.: 'A new architecture for a parallel finite field multiplier with low complexity based on composite fields', IEEE Trans. Comput., 1996, 45, (7), pp. 856-861
35. m) ', IEICE Trans. Fundam. Electron. Commun. Comput. Sci.,., 2005, E88-A, (11), pp. 3169-3179
36. WU H., HASAN M. A., BLAKE I. F.: 'New low-complexity bitparallel finite field multipliers using weakly dual bases', IEEE Trans. Comput., 1998, 47, (11), pp. 1223-1234
37. WANG C. C.: 'An algorithm to design finite field multipliers using a self-dual normal basis', IEEE Trans. Comput., 1989, 38, (10), pp. 1457-1459
38. m) ', IEE Proc., Comput. Digit. Tech., 1997, 144, (1), pp. 43-46
39. MASSEY J. L., OMURA J. K.: 'Computational method and apparatus for finite field arithmetic'. US Patent Number 4, 587, 627, May 1986
40. m) ', IEEE Trans. Comput., 1985, C-34, (8), pp. 709-717
41. m) ', IEEE Trans. Comput., 2002, 51, (5), pp. 511-520
42. FAN H., DAI Y.: 'Key function of normal basis multipliers in GF (2n) ', Electron. Lett., 2002, 38, (23), pp. 1431-1432
43. m) ', Comput. Secur., 2005, 24, (1), pp. 83-86
44. PEKMESTZI K. Z.: 'Multiplexer-based array multipliers', IEEE Trans. Comput., 1999, 48, (1), pp. 15-23