A single chip 1024 bits RSA processor

5Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new carry-free division algorithm will be described; it is based on the properties of RSD arithmetic to avoid carry propagation and uses the minimum hardware per bit i.e. one full-adder. Its application to a 1024 bits RSA cryptographic chip will be presented. Thanks to the features of this new algorithm, high performance (8 kbits/s for 1024 bits words) was obtained for relatively small area and power consumption (80 mm2 in a 2 μm CMOS process and 500 mW at 25 MHz).

Cite

CITATION STYLE

APA

Vandemeulebroecke, A., Vanzieleghem, E., Denayer, T., & Jespers, P. G. A. (1990). A single chip 1024 bits RSA processor. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 434 LNCS, pp. 219–236). Springer Verlag. https://doi.org/10.1007/3-540-46885-4_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free