Searched for: subject%3A%22RNS%255C%2Bbase%255C%2Bextension%22
(1 - 1 of 1)
Cucu-Laurenciu, N. (author)
The majority of currently established public-key cryptosystems, e.g., RSA, ECC, requires modular multiplication in finite fields as their core operation. As a result, the throughput rate of such cryptosystem depends upon the speed of modular multiplication and upon the number of performed modular multiplications. Montgomery algorithm is one...
master thesis 2010