The Montgomery Modular Inverseðrevisited

@inproceedings{Koc2000TheMM,
  title={The Montgomery Modular Inverseðrevisited},
  author={K. Koc{\"E}},
  year={2000}
}
  • K. KocË
  • Published 2000
ÐWe modify an algorithm given by Kaliski to compute the Montgomery inverse of an integer modulo a prime number. We also give a new definition of the Montgomery inverse, and introduce efficient algorithms for computing the classical modular inverse, the Kaliski-Montgomery inverse, and the new Montgomery inverse. The proposed algorithms are suitable for… CONTINUE READING