A high-radix hardware algorithm for calculating the exponential M/sup E/ modulo N

H. Orup, P. Kornerup
[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic  
In a class of crypt0 systems fast computation of modulo ezponentiala is essential. The popular RSA protocol uses opemnds of more than 500 bits to achieve a suficient security. We present a parullel version of a well known ezponentiation algorithm that halves the worst case computing time. It is described how a high radiz modulo multiplication can be implemented by interleaving a serial-parullel multi licatwn scheme with an SRT division scheme. The probpemr associated with high radices are
more » ... h radices are eficiently solved by the uae of a redundant representation of intermediate opemnds. We show how the algorithms can be realized as a highly regular VLSI circuit. Simulationa indicate that a mdiz 32 implementation of the algorithms w able of computing 512 bit operand ezponentiala in 3.2 maec. This is more than 5 times faster compared to other known implementationr.
doi:10.1109/arith.1991.145533 dblp:conf/arith/OrupK91 fatcat:maivxiy4ofh2rah36qnr2mclbi