3 ms·
One of the bigger hurdles in implementing RSA is having an algorithm which can multiply the large numbers in real time. If you try a niave multiplication algori
by gmiller123456 6mo ago
One of the bigger hurdles in implementing RSA is having an algorithm which can multiply the large numbers in real time. If you try a niave multiplication algorithm, you might find you'll never get an answer. A lot of hardware now comes with special instructions which implement efficient algorithms for doing this.
- MattPalmer1086 6mo agoSure, you can't use built in multiplication, but it isn't a very big hurdle. Just use repeated squares, it's fairly trivial to implement. I've worked on software that did this on very low power mobile payment devices.
- SkiFire13 6mo agoRepeated squares is a way to implement exponentiation, not multiplication.
- MattPalmer1086 6mo agoOops, yes, I meant exponentiation. Which you need (mod n) in RSA.