Burton zyxwvutsrqp S. Kaliski, JL zyxwvutsrqponm ods can break into a senes of modular mul- zyxwvu RSA zyxwvutsrqponm Laboratories tiphcations? Certainly one of the most zyxwv M tlplicatlon zyxwvuts algorithm, mtroduced by Peter L m zyxwv s the Montgomery produ MonPro(a, b) = ab?-' mod zyxwvu n methods constitute th and zyxwvut Y such that the greatest rmnator (E, zyxwvutsr r) = 1 Although works for any r that is rela- exponentzatzon, the ssors and mcro- signing dzgztal data in lar multiplication, but typically faster cle, we study the operations