4 ms·
Speaking of curves, they have their weird gotchas as well which tend to get glossed over in simplified examples. A recent discussion: * https://research.nccgro
by upofadown 5y ago
Speaking of curves, they have their weird gotchas as well which tend to get glossed over in simplified examples. A recent discussion:
* https://research.nccgroup.com/2021/11/18/an-illustrated-guide-to-elliptic-curve-cryptography-validation/ https://research.nccgroup.com/2021/11/18/an-illustrated-guid...
- throwaway81523 5y agoThanks, that is a good article. There are a lot of tricks to implementing ECC efficiently (besides correctly), enough that writing a competitive DIY implementation is a lot of work even if you know what you're doing. That's in contrast with RSA, where the work is all in the modular exponentiation operation, which is already carefully optimized in libraries like GMP (so just call GMP and you are done). Hankerson, Menezes, and Vanstone's "Guide to Elliptic Curve Cryptography" is very helpful if you are trying to implement ECC for some reason. Most of us are probably better off using an existing implementation.