Ryan Castellucci :nonbinary_flag:
I was working on writing a big integer math implementation in C for doing elliptic curve math in Web Assembly.
There is no arithmetic with carry in wasm, and I'm trying to decide whether it would be more efficient to use 30 bit limbs for more efficient carry when squaring or tripling numbers.
It looks like it'll require an extra limb for multiply/square operations for 256/384 bit curves, and for all operations on 521 bit curves.
Ryan Castellucci :nonbinary_flag:
Someone told me I should just write my own big integer routines rather than trying to deal with someone else's because I'll understand better, and implementing exactly what I need should make it a bit faster.
Ryan Castellucci :nonbinary_flag:
Also, most of these sorts of libraries use constant time operations, which I don't need, and non-constant time is faster.
Fabrice Roux :verified: :donor:
@ryanc it’s also faster and better for the planet to recycle nonces. And if you are looking for zero hassle optimization… remove the randomness part of the nonces… a simple static value will do the trick. 😳
Ryan Castellucci :nonbinary_flag:
@fabrice I'm not operating on private keys at all, only manipulating public points.
Ryan Castellucci :nonbinary_flag:
@fabrice I do, in fact, know what I'm doing...
Fabrice Roux :verified: :donor:
@ryanc it was a joke… I need to up my style to make it obvious. Sorry for the confusion.
Ryan Castellucci :nonbinary_flag:
@fabrice Thank you. It seemed like you might be mocking me, I'm glad you weren't.
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.