2000+ entries in 0.174s
mircea_popescu: asciilifeform by my lights, exact answer re prime distribution prerequisite to trivial factorization of
rsa.
mircea_popescu: where the fuck is that tmsr-standard-
rsa-key discussion
mircea_popescu: do teh math, if 8kb
rsa key is preferable to 4kb
rsa key, there's fundamental problems with
rsa that make it useless anyway.
mircea_popescu: asciilifeform here's the fact of the matter : if you had the drop-in
rsa ready, he'd drop it in right now.
sina: asciilifeform: it is designed to easily rip/replace the
RSA and other componenty bits easily
sina: as you can see in the gossipc stdout, it's all
RSA, stateless whatever style
sina: yeah cool that's pretty much what I thought after yoru comments re sqlite/
rsa being the main things needing changifying
mircea_popescu: anyway. his bad for inserting a conjecture among actually known shit. there's a difference between "we don't know if
rsa is hard" and "we know you can't compress all files"
mircea_popescu: and this should, at least to my superficial mind, work as
rsa padding.
mircea_popescu: asciilifeform you can't unwrap it in hardware. unlike
rsa, fhfs you sitll hafta iterate.
mircea_popescu: this aside ; i'm kinda loath to mix
rsa in both padding and encryption. for all anyone knows they resonate
sina: also: Complete break of
RSA-1024 as implemented in Libgcrypt
https://eprint.iacr.org/2017/627.pdf, "And 13% of
RSA-2048 keys. Whoopsie!", "The new bit is showing that LtR sliding windows are a Very Bad Choice for modular exponentiation. Very nice."