Efficient Computation of Multiplicative Inverses for Cryptographic Applications

M. Anwarul Hasan. Efficient Computation of Multiplicative Inverses for Cryptographic Applications. In 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 11-17 June 2001, Vail, CO, USA. pages 66-72, IEEE Computer Society, 2001. [doi]

@inproceedings{Hasan01:0,
  title = {Efficient Computation of Multiplicative Inverses for Cryptographic Applications},
  author = {M. Anwarul Hasan},
  year = {2001},
  url = {http://csdl.computer.org/comp/proceedings/arith/2001/1150/00/11500066abs.htm},
  researchr = {https://researchr.org/publication/Hasan01%3A0},
  cites = {0},
  citedby = {0},
  pages = {66-72},
  booktitle = {15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 11-17 June 2001, Vail, CO, USA},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-1150-3},
}