• DOI:10.1109/CENICS.2009.25
Corpus ID: 26191553

High Speed RSA Implementation Based on Modified Booth's Technique and Montgomery's Multiplication for FPGA Platform

@article{Ghoreishi2009HighSR,
  title={High Speed RSA Implementation Based on Modified Booth's Technique and Montgomery's Multiplication for FPGA Platform},
  author={S. S. Ghoreishi and M. A. Pourmina and H. Bozorgi and M. Dousti},
  journal={2009 Second International Conference on Advances in Circuits, Electronics and Micro-electronics},
  year={2009},
  pages={86-93}
}

S.S. Ghoreishi, M.A. Pourmina, +1 author M. Dousti

Published 2009

Computer Science

2009 Second International Conference on Advances in Circuits, Electronics and Micro-electronics

Rivest, Shamir and Adleman (RSA) encryption algorithm is one of the most widely used and popular public- key cryptosystem. The main step in this algorithm is modular exponentiation which can be done by a sequence of modular multiplication. Thus, modular multiplication is the major factor, in many cryptosystems, e.g. the RSA Two-Key system and in the proposed digital signature standard DSS. One of the most efficient algorithms of modular multiplication is the Montgomery multiplication. In this… CONTINUE READING

View on IEEE

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed