ACM Home Page
Please provide us with feedback. Feedback
An 830mW, 586kbps 1024-bit RSA chip design
Full text PdfPdf (414 KB)
Source Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe: Designers' forum table of contents
Munich, Germany
SESSION: Secure and security systems table of contents
Pages: 24 - 29  
Year of Publication: 2006
ISBN ~ ISSN:478061 , 3-9810801-0-6
Authors
Chingwei Yeh  Nat'l Chung-Cheng University
En-Feng Hsu  Nat'l Chung-Cheng University
Kai-Wen Cheng  Nat'l Chung-Cheng University
Jinn-Shyan Wang  Nat'l Chung-Cheng University
Nai-Jen Chang  Nat'l Chung-Cheng University
Sponsors
EDAA : European Design and Automation Association
: The EDA Consortium
IEEE-CS\DATC : The IEEE Computer Society
Publisher
European Design and Automation Association  3001 Leuven, Belgium, Belgium
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 34,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

ABSTRACT

This paper presents an RSA hardware design that simultaneously achieves high-performance and low-power. A bit-oriented, split modular multiplication algorithm and architecture are proposed to fully exert the radix-4 computational capability. Further, we identify the switching profile of RSA data and accordingly propose power-optimized designs for the storage elements and key computational components. The complete RSA modular exponentiation hardware has been implemented using cell-based 0.18um CMOS technology. Post-layout simulation shows that the design delivers an average performance of 586kbps at 460MHz, 1.8V while consuming only 830mW.


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
W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. IT-22, pp. 644--654, Nov. 1976.
2
 
3
P. L. Montgomery, "Modular multiplication without trial division," Math. of Computation, vol. 44, No. 7, pp. 519--512, Apr. 1985.
 
4
 
5
M. Shand and J. Vuillemin, "Fast implementation of RSA cryptography," Proc. 11th IEEE Symp. Comput. Arith., Jun. 1993, pp. 253--259.
 
6
 
7
P. S. Chen, S. A. Hwang, and C. W. Wu, "A systolic RSA public key cryptosystem," in Proc. IEEE Int. Symp. Circuits and Systems (ISCAS), vol. 4, Atlanta, GA, May 1996, pp. 408--411.
 
8
P. A. Wang, W. C. Tsai, C. B. Shung, "New VLSI architectures of RSA public-key crypto-system," IEEE International Symposium on Circuits and System, pp.2040--2043, 1997.
 
9
C. C. Yang, T. S. Chang, C. W. Jen, "A new RSA cryptosystem hardware design based on Montgomery's algorithm," IEEE Trans. Circuits Syst. II, vol. 45, pp.908--913, 1998.
 
10
 
11
H. T. Bui, Y. Wang, and Y. Jiang, "Design and Analysis of Low-Power 10-Transistor Full Adders Using Novel XOR-XNOR Gates," IEEE Transaction on Circuit and System, vol.49, January 2002.
 
12
J. S. Wang et al, "An Ultra Low Power, Fast Lock-in, Small Jitter, All Digital Delay Locked Loop," Proc. IEEE ISSCC, 2005, paper 22.7.
Collaborative Colleagues:
Chingwei Yeh: colleagues
En-Feng Hsu: colleagues
Kai-Wen Cheng: colleagues
Jinn-Shyan Wang: colleagues
Nai-Jen Chang: colleagues