asciilifeform: and playing entirely by the typical script
asciilifeform: '...we proposed a compromise. We agreed to stand down regarding the EME standard, provided that the W3C extend its existing IPR policies to deter members from using DRM laws in connection with the EME (such as Section 1201 of the US Digital Millennium Copyright Act or European national implementations of Article 6 of the EUCD) except in combination with another cause of action.' << quislings
asciilifeform: ben_vulpes made his way down south, to the saloon, to the spittoon ?1?
asciilifeform: ( to nitpick, yes the heathens have a scenario where it still does something, where everybody has 'star topology' 'wot' consisting of the greatinca. but to call this 'meaningful' is a stretch. )
asciilifeform: pubkeyverification is meaningless without wot, ben_vulpes
asciilifeform: mats: 'suicide by cop' is fairly regular item afaik
asciilifeform: 'A buffer overflow was discovered in tpacket_rcv() function in the Linux kernel since v4.6-rc1 through v4.13. A number of socket-related syscalls can be made to set up a configuration when each packet received by a network interface can cause writing up to 10 bytes to a kernel memory outside of a kernel buffer...'
asciilifeform: asciilifeform was sometimes genuinely vexed, when collegues & various folx would ask him, 'what would you ask erdos', etc. and they never liked my answer, which is that i have nothing worth asking erdos or gauss or etc
asciilifeform: it is very telling imho that they could not find any d00d of any substantial intellectual caliber, to play this role ( while in su they easily got a saharov & others )
asciilifeform: ( tldr for n00bz : xiaobo was the attempt to 'solzhenitsyn' the chinese; it failed, because chinese , turned out, were not sufficiently gullible )
asciilifeform: pretty sure mircea_popescu had an entire article, in ro no less, about him
asciilifeform: which means that even a minute-long modexp is theoretically fieldable ( you get ~day-long keygen, and minute-per-4096bits decrypt/encrypt, but this is livable, ancestors lived with much slower hand-cranked otp )
asciilifeform: and at any rate the 'f' in ffa -- stays.
asciilifeform: and would not help the private exponent op ( where one would want to leak nothing at all )
asciilifeform: naturally this is for the public exponent op only
asciilifeform: incidentally, if you're willing to leak the height of the last set bit in the exponent, you cut the cost even of naive method above, linearly ( e.g. the typical gpg exponent is 17 bits ) -- but i'd very much rather not
asciilifeform: there are no tables in ffa, and an ffa with a table is pointless ( if you access leaklessly, by chugging whole table each time ( we had thread ) you wipe out the time saving. )
asciilifeform: can't do tables. period. they result in addressing-by-secretbits and leak timing from cache.
asciilifeform: anyway this was not a sexy/exciting report, it is just to share what was the baseline ( saddest known algo )
asciilifeform: which is B subtractions, when B is bitness.
asciilifeform: my mod is using knuth's simplest (aka egyptian) div method.
asciilifeform: gotta nail down this difference, because it makes a difference ( in that you cannot exponentiate-and-then-modulus, universe ain't big enough , hence the invention of mod-exp )
asciilifeform: correct. the latter when using the method depicted in the snapshot.
asciilifeform: ( i don't own a box with 4096**4096 bits of memory, and neither does beelzebub )
asciilifeform: FZ_Exp does not calculate a^b, it calculates a^b modulo ffawidth. this is important difference.
asciilifeform: why do you insist on repeating a mathematically false summary ?
asciilifeform: and in case it isn't clear, the 51+ is using the slowest known method.
asciilifeform: a ^ b mod 2**4096 , rather than a^b ( which our galaxy hasn't enough atoms to represent for 4096bit a and b )
asciilifeform: ( kochian modexp stops at the last 1bit )
asciilifeform: koch is neither here nor there, was not part of the measurements, nor is possible to compare because it does not actually do the same job
asciilifeform: same WITH divisions, i.e. modular, takes 51.3.
asciilifeform: exponentiation WITHOUT DIVISIONS (i.e. nonomodular, or modulo the set ffawidth, in this case 4096) takes 0.26
