2100+ entries in 0.267s
diana_coman: namely: it needs to calculate nminus1 / 2
^ k but it does NOT call mpi_tdiv_q_2exp(result, nminus1, k)
diana_coman: because dividing n by 2
^0 aka 1 means result should be n
shinohai:
^ moar delicious looking than caek, elves ....
a111: Logged on 2016-06-20 04:23 phf: which is handy if you're using something else to produce the patch, or if you need to use a non-trivial diff command. for example i sometimes need to exclude files from diffing, so a command might look like diff -x foo -x bar -x qux -ruN a b | grep -v '
^Binary files ' | vdiff > foo.vpatch
mircea_popescu: let's take a = every other bit of n. to mine this block, you must produce an x so that x is twice the bitsize of n, and (x+a)
^n is mod congruent to x
^n + a (mod n)
mircea_popescu: but the base factor can't be this fucking humongous ffs, it's just (x+a)
^n vs x
^n+a.
mircea_popescu: the order IS log
^6, which was the great progress, originally it was log
^12
mircea_popescu: and i have a good mind to mandate eucrypt impl of m-r actually uses 2
^8 ie 256 as minimum.
mircea_popescu: for the record, if n = 2
^ 2048, that limit is ~238.728599954.
mircea_popescu: (for the record : it is a fact that there exist infinite composites so that their SMALLEST witness is at least ln (n)
^ 1/(3 * ln (ln(ln(n))). yet "cryptography community" keeps doing this small witness bs.)
mircea_popescu: given n > 2 and a coprime to n, n is prime only if (x+a)
^n mod-congruent x
^n+a (mod n)
jhvh1: mircea_popescu: 4
^-16 = 2.3283064365386963E-10
jhvh1: mircea_popescu: 4
^-12 = 5.9604644775390625E-8
mircea_popescu: seems a gratuitous (but not readily computable) degradation of the 4
^-k outer bound.
BingoBoingo:
^ Bonus observation: The drive to grow my own tomatoes, not as strong here. Pretty delicious tomatoes rather available.
a111: Logged on 2017-11-29 18:29 asciilifeform:
^ there does not currently exist a decent pcb cad. at. all.
a111: Logged on 2017-09-14 17:24 asciilifeform:
^ which does mean that i'ma have to a) audit the binary when ffa built for use in the field b) patch gcc/gnat not to emit DIV
a111: Logged on 2017-11-23 15:20 diana_coman: ahahaha "like mircea popescu or whatever his name is, but even with him i suspect he's not anywhere near as rich as he wants people to think he is - it doesn't add up; poorly fitted suits, average looking hotel suites/condos, spends all his time living in cheap shitholes which is precisely what white people who have money to live abroad but aren't rich do)" ; from
^^ mircea_popescu: i like the part where he explains why 2
^32 scan being 1.6 seconds is not good news for scanning 2
^32
diana_coman: ahahaha "like mircea popescu or whatever his name is, but even with him i suspect he's not anywhere near as rich as he wants people to think he is - it doesn't add up; poorly fitted suits, average looking hotel suites/condos, spends all his time living in cheap shitholes which is precisely what white people who have money to live abroad but aren't rich do)" ; from
^^ ☟︎ mircea_popescu: now, the expectation is that a full day of play will produce less than say 2
^15 or so messages.
mircea_popescu: in ~principle~ serpent doesn't expose the key anymore than it exposes the cipher. the claim is that if you know about 2
^100 or so plaintext-ciphertext matches you can extract the key.
mircea_popescu: but if memory serves the "attack" on serpent used 2
^100 plaintexts sorta deal
a111: Logged on 2017-11-20 00:56 asciilifeform: btw, for my fellow rotakus ( shinohai , pete_dushenski , ben_vulpes .. ? ) grep -i '
^foobar' ro_eng_ascii.txt finds word foobar.