Efficient software implementations of modular exponentiation
Author:
- 5 April 2012
- journal article
- research article
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 2 (1) , 31-43
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Speeding Up Big-Numbers Squaring2012
- A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSL2008
- New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures2007
- Montgomery Arithmetic2006
- Predicting Secret Keys Via Branch Prediction2006
- Enhanced Montgomery MultiplicationLecture Notes in Computer Science, 2003
- A Timing Attack against RSA with the Chinese Remainder Theorem2000
- Montgomery’s Multiplication Technique: How to Make It Smaller and Faster1999
- Analyzing and comparing Montgomery multiplication algorithmsIEEE Micro, 1996
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985