Bipartite Modular Multiplication

@inproceedings{Kaihara2005BipartiteMM,
  title={Bipartite Modular Multiplication},
  author={Marcelo E. Kaihara and Naofumi Takagi},
  booktitle={CHES},
  year={2005}
}
This paper proposes a new fast method for calculating modular multiplication. The calculation is performed using a new representation of residue classes modulo M that enables the splitting of the multiplier into two parts. These two parts are then processed separately, in parallel, potentially doubling the calculation speed. The upper part and the lower part of the multiplier are processed using the interleaved modular multiplication algorithm and the Montgomery algorithm respectively… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS
18 Citations
15 References
Similar Papers

Citations

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

References

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

Blakley “ A Computer Algorithm for Calculating the Product AB Modulo M

  • R. G.
  • Part 1 : The Digital Signature Algorithm ( DSA…
  • 1997

Public Key Cryptography for the Financial Services Industry: Part 1: The Digital Signature Algorithm (DSA)

  • X ANSI
  • American National Standard Institute. American…
  • 1997
1 Excerpt

Modular Multiplication without Trial Division,

  • P. L. Montgomery
  • Mathematics of Computation,
  • 1985
2 Excerpts

Similar Papers

Loading similar papers…