Close category search window
 

Asynchronous implementation of 1024-bit modular processor for RSA cryptosystem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Young Sae Kim ; Sch. of Electron. & Electr. Eng., Kyungpook Nat. Univ., Taegu, South Korea ; Woo Seok Kang ; Jim Rim Choi

In this paper, an implementation method to optimize a 1024-bit RSA processor is presented. Basically, the Montgomery algorithm is used and modified considering the large bit modular multiplication. We propose a new architecture for 1024-bit RSA processing in order to reduce the required hardware resources. The new architecture is also fit for an effective I/O interface. We have implemented a single-chip 1024-bit RSA processor based on the modified algorithm and architecture with 0.65-μm SOG technology using Verilog HDL. As a result, it is shown that the processor can perform 1024-bit RSA operation in less than 43 ms at 50 MHz

Published in:
ASICs, 2000. AP-ASIC 2000. Proceedings of the Second IEEE Asia Pacific Conference on

Date of Conference: 2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.