GCD-Free Algorithms for Computing Modular Inverses

Marc Joye, Pascal Paillier. GCD-Free Algorithms for Computing Modular Inverses. In Colin D. Walter, Çetin Kaya Koç, Christof Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2003, 5th International Workshop, Cologne, Germany, September 8-10, 2003, Proceedings. Volume 2779 of Lecture Notes in Computer Science, pages 243-253, Springer, 2003. [doi]

@inproceedings{JoyeP03,
  title = {GCD-Free Algorithms for Computing Modular Inverses},
  author = {Marc Joye and Pascal Paillier},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2779&spage=243},
  tags = {Pascal},
  researchr = {https://researchr.org/publication/JoyeP03},
  cites = {0},
  citedby = {0},
  pages = {243-253},
  booktitle = {Cryptographic Hardware and Embedded Systems - CHES 2003, 5th International Workshop, Cologne, Germany, September 8-10, 2003, Proceedings},
  editor = {Colin D. Walter and Çetin Kaya Koç and Christof Paar},
  volume = {2779},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40833-9},
}