Montgomery's Multiplication Technique: How to Make It Smaller and Faster

@inproceedings{Walter1999MontgomerysMT,
  title={Montgomery's Multiplication Technique: How to Make It Smaller and Faster},
  author={Colin D. Walter},
  booktitle={CHES},
  year={1999}
}
Montgomery’s modular multiplication algorithm has enabled considerable progress to be made in the speeding up of RSA cryptosystems. Perhaps the systolic array implementation stands out most in the history of its success. This article gives a brief history of its implementation in hardware, taking a broad view of the many aspects which need to be considered in chip design. Among these are trade-offs between area and time, higher radix methods, communications both within the circuitry and with… CONTINUE READING
Highly Cited
This paper has 84 citations. REVIEW CITATIONS
47 Citations
30 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 47 extracted citations

85 Citations

051015'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 85 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Design of Floating Point Arithmetic Units”, Proc

  • S. F. Obermann, H. Al-Twaijry, M. J. Flynn, “The SNAP Project
  • 13th IEEE Symp. on Computer Arith., Asilomar, CA…
  • 1997
1 Excerpt

Reconfigurable systems come of age”, IEEE Trans

  • J. Vuillemin, P. Bertin, +4 authors “Programmable active memories
  • on VLSI Systems 5 no. 2
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…