ijk (11/25/82)
In "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" the authors use an algorithm called "exponentiation by repeated squaring and multiplication." they claim this algorithm was half as good as best - unfortunately, it takes a considerable amount of time, and even a factor of two would not be better. Does anyone know of some current improvements ( what we have to do is take a number to an exponent approximately 100 digits long, and then take it modulo another number about 200 digits long). Thanks in advance. Ihor Kinal hou5e!ijk