Parallelized radix-4 scalable montgomery multipliers

@inproceedings{Pinckney2007ParallelizedRS,
  title={Parallelized radix-4 scalable montgomery multipliers},
  author={Nathaniel Ross Pinckney and David Money Harris},
  booktitle={SBCCI},
  year={2007}
}
This paper describes a parallelized radix-4 scalable Montgomery multiplier implementation. The design does not require hardware multipliers, and uses parallelized multiplication to shorten the critical path. By left-shifting the sources rather than right-shifting the result, the latency between processing elements is shortened from two cycles to nearly one. The new design can perform 1024-bit modular exponentiation in 8.7 ms and 256-bit exponentiation in 0.36 ms using 5916 Virtex2 4-input… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS
23 Citations
4 References
Similar Papers

Citations

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

References

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

Modular multiplication without trial division,

  • P. Montgomery
  • Math. of Computation,
  • 1985
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…