|
This paper introduces the theory behind efficient RSA processing in computer hardware. * The reader is assumed to have a 2nd or 3rd year university engineering or mathematics background, because the number theory concepts are not introduced to most students before that. * The basic modular arithmetic concepts are introduced and then these are applied to the problems of modular multiplication and exponentiation on “big integers” in the order of a thousand or more bits. * Nearing the end of the paper, the RSA modexp computations, if done on a general purpose 32-bit RISC processor are shown to take a lot of time, so that one might want to “offload” the job to a specially designed RSA processor. * At the end of the paper, even though special purpose RSA offload processors exist on the Silicon IP market, there is still room and the need for innovation. So we introduce the CS1024-RSA offload processor as what is expected in a “best practice” in RSA offload processor design.
|
||||||
|
||||||
|
||||||
