Hi, I need a function which can do fast modular exponentiation on 2048-bit integers. I'd like to call this function from JavaScript running in Mozilla (Firefox 3.0 or later) displaying a web page. Is there such a function or do I have to implement in pure JavaScript? Although it is quite optimized, the pure JavaScript implementation http://www.leemon.com/crypto/BigInt.html seems to be slow: 77 seconds for a single 2048-bit modular exponentiation. I need a function which runs in at most half a second. Is it possible to do this with NSS/JSS? Am I asking this question on the right mailing list? If not, where should I ask? I know that if the Java plugin is available, then I can use java.math.BigInteger.modPow, which is very fast. (See http://stackoverflow.com/questions/1450608/fastest-modular-exponentiation-in-javascript for the example code.) But what can I use if Java is not available in the browser? Is there something in vanilla Mozilla (or Firefox) which can be used to do quick modular exponentiation?
Thanks, Péter
-- dev-tech-crypto mailing list dev-tech-crypto@lists.mozilla.org https://lists.mozilla.org/listinfo/dev-tech-crypto
