Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

One thing probably worth keeping in mind is that you can keep everything in much saner terms for CPU by doing something like [1]. This is how most implementations of RSA handle large exponents also. It can make it very much more efficient compared to handling some 2k bit numbers for multiplication in intermediate steps.

[1] http://en.wikipedia.org/wiki/Modular_exponentiation



Absolutely. It's still pretty expensive to take a 257-bit power of a 1024-bit number with modular exponentiation, though.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: