168100+ entries in 0.1s
mircea_popescu: you can add
the words in any order you wish and you can keep whichever intermediates you feel like
mircea_popescu: i am
telling you, his
thing is ripe for rewritting in a more apt notation. he is misrepresenting it because
thinking in
therms of fucking logic gates
mircea_popescu: but you don't have
to use a
table, you should be able
to make it work in a matrixc
mircea_popescu: no but you write it as a full matrix, you get
the undo for free
mircea_popescu: there's no rule you must do
the parts in order or anything
mircea_popescu: and a possible candidate for "alt cryptosystem" at
that.
mircea_popescu: tell me 13% of 50 years somehow comes out
to less
than a week ?
mircea_popescu: i am all for keepiong
the unrolled version at
the ready ; but i really see no problem with having and using
the unrolled loops version. you read it once, over a weekend or a week, and you use it
ten billion
times over fifty years.
mircea_popescu: anyway, re
the unrolls : it's really not
that bad, because of
the patterns. it's only "unreadable" because alien because
too much
time spent reading code written by idiots.
mircea_popescu: anyway. i
think
the point re : fathers are worthless , siblings are severely retarded is well vindicated
mircea_popescu: honestly i don't believe
the somewhat more cl is such a problem.
mircea_popescu: asciilifeform yeah, i guess. depends
though, good
to have both variants.
mod6: yeah, worth
the hunting
trip
mod6: hmm, nice
test
though
a111: Logged on 2017-08-08 23:51 asciilifeform: it
thereby follows
that i could unroll comba into explicit cases from 1
to 8 words
mod6: <+erlehmann> something involving a goedelized perl script
that builds all build rules
that don't build
themselves. drugs were probably involved. << dafaq is
this dude on about?
mircea_popescu: and finally re crc : given a string S of any length,
the probability of a string S' where less
than 32 bits have been altered in a "burst" passiong crc32 is 0. if you go over 32 bit long bursts
the probability is ~ proportional
to
the burst length / 32.
a111: Logged on 2017-08-09 15:58 mircea_popescu: anyway, let it be said
that
there's nothing wrong with oaep as far as we know, but for
the sake of argument a mpfhf based padding scheme would conceivably work like
this : 1. given message m, of length l, generate r = random bits, of length l' up
to l but not less
than 256 bits. 2. compose m' = r + m + c (in
that order), where c is l - l` (and its bitness is always same as
the bitness of len(m')-256). 3. compose Pm = R + S +
mircea_popescu: reversing MPFHF is not required for
the above quoted version, as
the fhf is used
there as a hash function not as a padder. (and alf's objection is valid, not a very good option, a settable size output sponge would be much better).
jhvh1: mircea_popescu:
The operation succeeded.
mircea_popescu: !~later
tell peterl
the hash-xor
thing is oadp, which is a provedly strong padding scheme for rsa.
PeterL: Is
there a way
to calculate
the probabilty
that a random string of 256 bytes will pass a csc check?
PeterL: and wouldn't you also need
to know S if you are going
to reverse
the MPFHF from a given R?
a111: Logged on 2017-08-09 22:09 mircea_popescu:
to encrypt :
take plaintext message M, no longer
than 250 bytes, and zero-pad it
to 250 bytes.
take pile of random bits R 250 bytes long. calculate X = M xor R. calculate Y = R xor MPFHF(X) set for R.len = 250 bytes. RSA
the 500 byte pile of X || Y. done.
to decrypt : de-RSA
the 500 byte pile. cut it in
two halves. calculate R = Y xor X. calculate M as X xor R. done.
a111: Logged on 2017-08-09 17:10 PeterL: I will check in later once I am back at my computer with my key
to verify
this conversation has been with
the real PeterL
a111: Logged on 2017-07-18 18:23 mircea_popescu: asciilifeform understand
this bit of GT :
the knowledge of all
the
things you don't know
thereby constructs a sybil of you.
pa1atine: just back reading all
the stuff
trinque: sorry, we're past our quip quota for
the day. what else you got?
a111: Logged on 2017-08-09 23:00 mircea_popescu:
the herd is lazy,
the aparatchicks are scared, and
the intelligent are lost in
the soup, interacting with cattle and criminals as if
they were people.
pa1atine: hi all, great reads I had
those days. logs are a
trove of wisdom
mircea_popescu: the herd is lazy,
the aparatchicks are scared, and
the intelligent are lost in
the soup, interacting with cattle and criminals as if
they were people.
☟︎ mircea_popescu: but yes, i agree
that in principle something-like-keccak could be made
to spit arbitrary len digests ; and perhaps also in fixed space.
the latter will require actual impl
to settle.
a111: Logged on 2017-08-09 22:14 mircea_popescu: but afaik keccak isn't
that fix-space-able either.
mircea_popescu: but isn't it great
that all mgm needs
to do is
to put on a coupla hats and suddenly
the
turnips
think
themselves human fucking beings ?
mircea_popescu: independent" "free" bla bla made by amdocs employees. which YES, is
that
thing made by
the israeli golden pages, and YES is
that
thing involved in
the espionage scandals. and so on.
mircea_popescu: in other lulz : obviously
there's a "foundation" and a "code of conduct" (the usgistani nonsense copy/pasted) and a freenode chan, why not. ~600 accounts logged in (specifically :
http://p.bvulpes.com/pastes/yDU6G/?raw=true ) , ZERO anyone has
to say at all whatsoever. most are related
to matrix.org, which is a pile of nonsensical lulz which you're more
than welcome
to
try and make sense of by yourself. in any case, it's an "
☟︎ mircea_popescu: hanging out with any other
troop of stoners would be a better use of your
time, in
the sense of variety.
mircea_popescu: nobody knows what
the fuck "sha 2017" is. nobody cares. even
the people paid
to fucking care stopped giving a shit in
the 90s, as
that nsa goon at "crypto conferences" piece amply attests.
mircea_popescu: "tell
that
to some guy a little younger
than you, who just fell off
the
turnip
truck.
there is no publicity value in my
talk being at your conference. what, if you sell 2000 of
them it'll be a miracle. and what, what are people going
to say, uuuuuu i like how
that erlehmann
talks, i wonder if he's got a blog or anything".