Fault and simple power attack resistant RSA using Montgomery modular multiplication

@article{Fournaris2010FaultAS,
  title={Fault and simple power attack resistant RSA using Montgomery modular multiplication},
  author={Apostolos P. Fournaris},
  journal={Proceedings of 2010 IEEE International Symposium on Circuits and Systems},
  year={2010},
  pages={1875-1878}
}
Side channel attacks and more specifically fault, simple power attacks, constitute a pragmatic, potent mean of braking a cryptographic algorithm like RSA. For this reason, many researchers have proposed modifications on the arithmetic operation functions required for RSA in order to thwart those attacks. However, these modifications are applied on theoretic — algorithmic level and do not necessary result in high performance RSA designs. This paper constitute the first complete attempt for an… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

Citations

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

A high speed redundant-signed-digit based montgomery modular multiplier

2018 International Conference on Engineering and Emerging Technologies (ICEET) • 2018
View 8 Excerpts
Highly Influenced

A two-stage pipelined architecture for parallel modular exponentiation

2012 IEEE International Conference on Information Science and Technology • 2012
View 3 Excerpts
Highly Influenced

Low-latency scalable modular multiplier without Montgomery algorithm

Proceedings of 2012 2nd International Conference on Computer Science and Network Technology • 2012

Protecting CRT RSA against Fault and Power Side Channel Attacks

2012 IEEE Computer Society Annual Symposium on VLSI • 2012
View 4 Excerpts

Similar Papers

Loading similar papers…