Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2015

Early-word-based montgomery modular multiplication algorithm

Rupali Verma, Maitreyee Dutta, Renu Vig

Cited by 2Abstract and details only

Abstract

Modular multiplication is basic operation in public key cryptosystems like RSA. Montgomery modular multiplication being efficient is widely used. It is based on additions and shift operations. Each iteration requires a right shift, therefore in a word based architecture a complete word is not formed at end of iteration. This paper presents compute early word based scalable Montgomery architecture. It computes the most significant bit of word by applying 2 XOR operations. Also compute early scheme for common multiplicand Montgomery is proposed. Both the architectures are compared with previous architectures in literature.

Cite this paper

APA 7

Verma, R., Dutta, M., & Vig, R. (2015). Early-word-based montgomery modular multiplication algorithm. https://doi.org/10.1109/spin.2015.7095268

MLA 9

Verma, Rupali, et al. “Early-word-based montgomery modular multiplication algorithm.” vol. 7, 2015, pp. 595–600, https://doi.org/10.1109/spin.2015.7095268.

Chicago

Verma, Rupali, Maitreyee Dutta, and Renu Vig. 2015. “Early-word-based montgomery modular multiplication algorithm.” https://doi.org/10.1109/spin.2015.7095268.

Harvard

Verma, R., Dutta, M. and Vig, R. (2015) ‘Early-word-based montgomery modular multiplication algorithm’. Available at: https://doi.org/10.1109/spin.2015.7095268.

BibTeX
@article{verma2015early,
  title = {{Early-word-based montgomery modular multiplication algorithm}},
  author = {Verma, Rupali and Dutta, Maitreyee and Vig, Renu},
  volume = {7},
  pages = {595--600},
  year = {2015},
  doi = {10.1109/spin.2015.7095268}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers