Referenced Items are not available for this document.
A carry-free division algorithm is described. It is based on the properties of redundant signed digit (RSD) arithmetic to avoid carry propagation and uses the minimum hardware per bit, i.e. one full adder. Its application to a 1024-b RSA (Rivest, Shamir, and Adelman) cryptographic chip is presented. The features of this new algorithm allowed high performance (8 kb/s for 1024-b words) to be obtained for relatively small area and power consumption (80 mm2 in a 2-μm CMOS process and 500 mW at 25 MHz)
Published in:
Solid-State Circuits, IEEE Journal of
(Volume:25
,
Issue:
3
)
Date of Publication: Jun 1990
- Page(s):
- 748 - 756
- ISSN :
- 0018-9200
- INSPEC Accession Number:
- 3724018
- Digital Object Identifier :
- 10.1109/4.102670
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jun 1990
- Sponsored by :
- IEEE Solid-State Circuits Society
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.
