In Elliptic curve calculations, there are lots of modular inversions. And the prime is a fixed large number, say 256 bits.
I wonder how I can optimize this operation, right now it takes a lot of time. Can any one point me to something?
_______________________________________________ cryptography mailing list [email protected] http://lists.randombit.net/mailman/listinfo/cryptography
