On efficient implementation of accumulation in finite field over GF(2 m) and its applications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 17, Issue 4, 2009, Pages 541-550

  Meher, Pramod Kumar ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Elliptic curve cryptography (ECC); Error control coding; Finite field; Finite field addition; Finite field multiplication; Galois field; VLSI

Indexed keywords

CRYPTOGRAPHY; FLIP FLOP CIRCUITS; HARDWARE;

ELLIPTIC CURVE CRYPTOGRAPHY (ECC); ERROR CONTROL CODING; FINITE FIELD; FINITE FIELD ADDITION; FINITE FIELD MULTIPLICATION; GALOIS FIELD; VLSI;

DESIGN;

EID: 62949162331     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2008.2005288     Document Type: Article

References (35)

1. I. Blake, G. Seroussi, and N. P. Smart, "Elliptic curves in cryptography," in London Mathematical Society Lecture Note Series. Cambridge, U.K.: Cambridge University Press, 1999.
2. K. Nguyen and A. Weigl, "Fast Arithmetic in Hardware," in Handbook of Elliptic and Hyperelliptic Curve Crytography, H. Cohen and G. Frey, Eds. Boca Raton, FL: Taylor & Francis, ch. 26. [Online]. Available: http://www.csrc.nist.gov/publications
3. I. S. Hsu, T. K. Truong, L. J. Deutsch, and I. S. Reed, "A comparison of VLSI architecture of finite field multipliers using dual, normal, or standard bases," IEEE Trans Computers, vol. 37, no. 6, pp. 735-739, Jun. 1988.
4. m)," IEEE Trans Computers, vol. C-33, no. 4, pp. 357-360, Apr. 1984.
5. m)," IEEE Trans. Circuits Syst., vol. 38, no. 7, pp. 796-800, Jul. 1991.
6. m)," IEEE Trans. Computers, vol. 41, no. 8, pp. 972-980, Aug. 1992.
7. m),"IEE Proc.-Comput. Digit. Techniques, vol. 147, pp. 375-382, Nov. 2000.
8. m)," in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS'01), May 2001, vol. 4, pp. 578-581.
9. m)," in Proc. Int. Symp. VLSITechnol., Syst., Appl, Apr. 2001, pp. 291-294.
10. m)," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 6, no. 1, pp. 101-113, Mar. 1998.
11. L. Song and K. K. Parhi, "Efficient finite field serial/parallel multiplication," in Proc. Int. Conf. Appl. Specific Syst., Arch. Processors (ASAP), Aug. 1996, pp. 72-82.
12. n) for elliptic curve cryptosystems," in Proc. 12th IEEE Mediterranean Electrotech. Conf. (IEEE MELECON), May 2004, vol. 2, pp. 779-782.
13. m)," in Proc. Int. Conf. Re configurable Comput. FPGAs (ReConFig), Sep. 2005, p. 5.
14. S. Moon, J. Park, and Y. Lee, "Fast VLSI arithmetic algorithms for high-security elliptic curve cryptographic applications," IEEE Trans. Consumer Electron., vol. 47, no. 3, pp. 700-708, Aug. 2001.
15. m)] using Itoh Tsujii algorithm," in Proc. 3rd Int. IEEE-NEWCAS Conf., 2005, pp. 7103-7105.
16. J. Guajardo and C. Paar, "Itoh-Tsujii inversion in standard basis and its application in cryptography," Des., Codes, Cryptography, vol. 25, pp. 207-216, 2002.
17. L. Song and K. K. Parhi, "Low-energy digit-serial/parallel finite field multipliers," J. VLSI Digit. Process., vol. 19, pp. 149-166, 1998.
18. m)," IEE Proc.-Comput. Digit. Techn., vol. 145, no. 2, pp. 143-148, Mar. 1998.
19. m)," in Proc. 14th Ann. IEEE Int. ASIC/SOC Conf., Sep. 2001, pp. 361-365.
20. C. H. Kim, C. P. Hong, and S. Kwon, "A digit-serial multiplier for finite field GF(2m)," IEEETrans. Very Large Scale Integr. (VLSI) Syst., vol. 13, no. 4, pp. 476-483, Apr. 2005.
21. m)," in Proc. Asia South Pacific Des. Autom. Conf. (ASP-DAC), Jan. 2005, vol. 2, pp. 1268-1271.
22. 233)," in Proc. 3rd Int. IEEE-NEWCAS Conf., Jun. 2005, pp. 399-402.
23. m)," presented at the 6th Int. Conf. Inf., Commun. Signal Process. (ICICS), Singapore, 2007.
24. S. K. Jain, L. Song, and K. K. Parhi, "Efficient semisystolic architectures for finite-field arithmetic," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 6, no. 1, pp. 101-113, Mar. 1998.
25. B. Sunar and C. K. Koc, "Mastrovito multiplier for all trinomials," IEEE Trans Computers, vol. 48, no. 5, pp. 522-527, May 1999.
26. H. Wu, "Bit-parallel finite field multiplier and squarer using polynomial basis," IEEE Trans. Computers, vol. 51, no. 7, pp. 750-758, Jul. 2002.
27. J. L. Imaña, J. M. Sanchez, and F. Tirado, "Bit-parallel finite field multipliers for irreducible trinomials," IEEE Trans Computers, vol. 55, no. 5, pp. 520-533, May 2006.
28. m)," IEEE Trans. Computers, vol. 53, no. 8, pp. 945-959, Aug. 2004.
29. F. Rodriguez-Henriguez and C. K. Koc, "Parallel multipliers based on special irreducible pentanomials," IEEE Trans Computers, vol. 52, no. 12, pp. 1535-1542, Dec. 2003.
30. H. Wu, "Low complexity bit-parallel multiplier for a class of finite fields," in Proc. Int. Conf. Commun., Circuits Syst., Jun. 2006, vol. 4, pp. 565-568.
31. m)," in Proc. 18th IEEE Int. Conf. Appl.-Specific Syst., Arch. Processors (ASAP), Montreal, QC, Canada, Jul. 2007, pp. 134-139.
32. National Institute of Standards and Technology, FIPS 186-2, Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186-2, 2000.
33. m)," IEEE Trans. Inf. Theory, vol. 32, no. 2, pp. 285-287, Mar. 1986.
34. m)," in Proc. 2nd Ann. IEEE Northeast Workshop Circuits Syst. (NEWCAS), Jun. 2004, pp. 337-339.
35. TM Standard Cell Library Databook, Release 4.1, Artisan Components, Sep. 2003.