snsabot: asciilifeform: time since my last reconnect : 30d 2h 43m
ossabot: asciilifeform: time since my last reconnect : 24d 5h 3m
ericbot: asciilifeform: time since my last reconnect : 19d 5h 10m
jfw: asciilifeform: possibly textbook case for 'peh' from what I gather :)
jfw: but first I need to make it work at all before revisiting numerics.
jfw: Nothing but grade-school arithmetic and modular inversion (which uses same) required for ECDSA. The 256-bit modular reductions are the slowest part for me afaik; hashing in Scheme slow too but not the bottleneck.
jfw: ty for that comment asciilifeform, makes good futher context. Isn't RSA in that same snake-oil category though?
jfw: one can understand what it does but factoring not proven to be "hard"
jfw: do you reckon anyone understands ECC in the sense you have in mind, beyond "code does what the paper says it should and we can't see how to break it yet" ?
jfw: alright. Sometimes the reduced rounds findings add up to real breakage, like with sha1, right? (I'm not well versed in cryptanalysis whether bilge or pure)
jfw: 'we will all go together when we go' -Lehrer