ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
A fast digit-serial systolic multiplier for finite field GF(2m)
Full text PdfPdf (718 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2005 Asia and South Pacific Design Automation Conference table of contents
Shanghai, China
SESSION: Poster session IV table of contents
Pages: 1268 - 1271  
Year of Publication: 2005
ISBN:0-7803-8737-6
Authors
Chang Hoon Kim  Daegu University, Jinryang, Kyungsan, Korea
Soonhak Kwon  Sungkyunkwan University, Suwon, Korea
Chun Pyo Hong  Daegu University, Jinryang, Kyungsan, Korea
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
: Shanghai IC Industry Association
: IEEE SSCS Shanghai Chapter
: IEEE CAS
: IEEE Beijing Section
: Fudan University
: Chinese Institute of Electronics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1120725.1121040
What is a DOI?

ABSTRACT

This paper presents a new digit-serial systolic multiplier over GF(2m) for cryptographic applications. When input data come in continuously, the proposed array produces multiplication results at a rate of one every [m/D] + 2 clock cycles, where D is the selected digit size. Since the inner structure of the proposed array is tree-type, critical path increases logarithmically proportional to D. Therefore, the computation delay of the proposed architecture is significantly less than previously proposed digit-serial systolic multipliers whose critical path increases proportional to D. Furthermore, since the new architecture has the features of regularity, modularity, and unidirectional data flow, it is well suited to VLSI implementations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. E. Blahut, Theory and Practice of Error Control Codes, Reading, MA: Addison-Wesley, 1983.
 
2
 
3
C. S. Yeh, I. S. Reed, and T. K. Trung, "Systolic Multipliers for Finite Fields GF(2m)," IEEE Trans. Comput., vol. C-33, no. 4, pp. 357--360, Mar. 1984.
 
4
C. L. Wang and J. L. Lin, "Systolic Array Implementation of Multipliers for Finite Field GF(2m)," IEEE Trans. Circuits and Syst., vol. 38, no. 7, pp. 796--800, July 1991.
 
5
 
6
J. -H. Guo and C. -L. Wang, "Digit-Serial Systolic Multiplier for Finite Field GF(2m)," IEE Proc. Comput. Digit. Tech., vol. 145, no. 2, pp. 143--148, Mar. 1998.
 
7
C. H. Kim, S. D. Han and C. P. Hong, "An Efficient Digit-Serial Systolic Multiplier for Finite Fields GF(2m)," Proc. on 14th Annual IEEE International Conference of ASIC/SOC, pp. pp. 361--365, 2001.
 
8
 
9
NIST, Recommended elliptic curves for federal government use, May 2001. http://csrc.nist.gov

Collaborative Colleagues:
Chang Hoon Kim: colleagues
Soonhak Kwon: colleagues
Chun Pyo Hong: colleagues