Fast Modular Reduction

  title={Fast Modular Reduction},
  author={William Hasenplaugh and Gunnar Gaubatz and Vinodh Gopal},
  journal={18th IEEE Symposium on Computer Arithmetic (ARITH '07)},
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hyper-) elliptic curve algorithms. In the recent decade, practitioners have relied mainly on two popular methods: Montgomery Multiplication and regular long-integer multiplication in combination with Barrett's modular reduction technique. In this paper, we propose a modification to Barrett's algorithm that leads to a… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


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


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

Multiplication of Multidigit Numbers on Automata

  • A. Karatsuba, Y. Ofman
  • Soviet Phys. Doklady,
  • 1963
Highly Influential
3 Excerpts

Design of an efficient public-key cryptographic library for RISC-based smart cards

  • J.-F. Dhem
  • Ph.D. Dissertation, Université Catholique de…
  • 1998
1 Excerpt

Encoding system according to the socalled RSA-method, by means of a microcontroller and arrangement implementing this system

  • J.-J. Quisquater
  • U.S. Patent #5,166,978,
  • 1992
1 Excerpt

Modular Multiplication without Trial Division

  • P. L. Montgomery
  • Mathematics of Computation,
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…