Abstract
In this article, we present a hybrid method to improve the performance of the Montgomery reduction by taking advantage of the Karatsuba technique. We divide the Montgomery reduction into two sub-parts, including one for the conventional Montgomery reduction and the other one for Karatsuba-aided multiplication. This approach reduces the multiplication complexity of n-limb Montgomery reduction from θ(n2 + n) to asymptotic complexity θ(7n2/8 + n). Our practical implementation results over an 8-bit microcontroller also show performance enhancements by 11%.
Original language | English |
---|---|
Article number | 58 |
Journal | Transactions on Embedded Computing Systems |
Volume | 15 |
Issue number | 3 |
DOIs | |
Publication status | Published - May 1 2016 |
Keywords
- Karatsuba multiplication
- Montgomery reduction
- Public key cryptography
- Software implementation
ASJC Scopus subject areas
- Hardware and Architecture
- Software