No abstract

This paper describes some recently successful results i n the CMOS VLSI implementation of public-key data encryption algorithms. Architectural details, circuits, and prototype test results are presented for RSA encryption and multiplication in the finite field GF(2"). These designs emphasize high throughput and modularity. An asynchronous modulo multiplier i s described which permits a significant improvement in RSA encryption throughput relative to previously described synchronous implementations.

No abstract