Selby, Alex and Mitchell, Chris J (1989) Algorithms for software implementations of RSA. IEE Proceedings Part E (Computers and Digital Techniques), 136 (3).
Full text access: Open
Two new algorithms that facilitate the implementation of RSA in software are described. Both Algorithms are essentially concerned with performing modular arithmetic operations on very large numbers, which could be of potential use to applications other than RSA. One algorithm performs modular reduction and the other performs modular multiplication. Both algorithms are based on the use of look-up tables to enable the arithmetic computations to be done on a byte by byte basis.
This is a Submitted version This version's date is: 5/1989 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/beb66b19-b20f-1dd7-dec6-22b47d95865c/6/
Deposited by Research Information System (atira) on 27-Jan-2013 in Royal Holloway Research Online.Last modified on 27-Jan-2013