Algorithms Supplement: RSA KEY CALCULATION IN ADA
D. G. N. Hunter · The Computer Journal · 1985
RSA encryption programs are inaccessible for several reasons – first they impose requirements on multiple precision arithmetic packages which are not met in general-purpose ones, especially the exponentiation operation in finite arithmetic; secondly, they are partially written in assembly code for speed, and rightly so; finally, they are being obscured by recently discovered short cuts. This paper describes one way of calculating RSA keys and includes some Ada procedures to illustrate the essential arithmetic; it is intended as a starting point for the construction of packages, especially those for 16-bit microcomputers.