A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
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 aredoi:10.1109/arith.1991.145533 dblp:conf/arith/OrupK91 fatcat:maivxiy4ofh2rah36qnr2mclbi