log☇︎
64600+ entries in 0.014s
asciilifeform: if server generates all keys, client dun need an rng at all.
asciilifeform: aha right
asciilifeform: actually if client doesn't get to generate keys
asciilifeform: it costs, however, http://btcbase.org/log/2017-11-22#1742216 . ☝︎
asciilifeform: iirc this is the scheme asciilifeform originally suggested.
asciilifeform: right
asciilifeform: dun have to swap ~all~ the keys every time there's an rsagram
asciilifeform: ( in other 'gangrene ? what gangrene?' horrors : 'LibTomCrypt is pretty nice to read (only bug found in last 10 years was in prime generation — failed to iterate Miller-Rabin)' -- from turd https://comsecuris.com/slides/slides-bignum-bhus2015.pdf re broken bignumatrons. cited line presented as a 'hey it's pretty good'... )
asciilifeform: ah with no splits then yea
asciilifeform: 16
asciilifeform: i read that line as a restatement of the ancient 'seekrit algos are a stupidity, honest crypto keeps only privkey seekrit' truism
asciilifeform: sure
asciilifeform: y'know the splits dun all have to be ciphered with same scheme
asciilifeform: branch-free
asciilifeform: keccak, i meant, turned up missing items
asciilifeform: so why not also serpent.
asciilifeform: mircea_popescu: the current serpent www is at the very minimum known to be missing items from before
asciilifeform: classic piece
asciilifeform: block was fixed at 128bit.
asciilifeform: but ~key~ size
asciilifeform: it was.
asciilifeform: because ultimately yes 'down to the 4bit sbox!'
asciilifeform: sad, innit. asciilifeform for instance has a mtbf of about 1hr when reading about symmetric ciphers. after that -- barf
asciilifeform: modular exp is intrinsically costlier , at least on pc iron, than the idjit rotorization used in symmetrics
asciilifeform: it does cost moar tho. even once i'm done with the asm version.
asciilifeform: really not hard to see
asciilifeform: ( the latter is defined as a family of functions, and so 'rubber' )
asciilifeform: rather like the diff b/w sha512 and keccak
asciilifeform: mircea_popescu: serpent isn't defined as a stretchable thing - i.e. it isn't obvious what ought to be changed to produce a larger ( or smaller, for that matter ) block, and still to have it meaningfully similar to original
asciilifeform: almost impossible to bring up crypto in heathendom without a 'voice in the crowd' 'helpfully' reminding about 'standardized, well-designed aes'
asciilifeform: right, plenty
asciilifeform: there was an earlier one... http://btcbase.org/log/2014-09-07#821750 ☝︎
asciilifeform: ( in the shannon sense. you haven't narrowed down what the 4th could be, by knowing 1..3 )
asciilifeform: diana_coman: observe that knowing 1,2,or even 3, gives you 0 bits of info re the original.
asciilifeform: diana_coman: now let's split 1 byte into ~four~, A,B,C,D. we take same transform and do it to X and Y in turn. in total, we've used 4 bytes from rng device, to cut 1 byte into 4 otpfrags.
asciilifeform: diana_coman: lemme give specific example. start with splitting 1 byte. to split byte B into X and Y, you take byte R from rng, and compute B xor R = X. then Y = R . X xor Y = B .
asciilifeform brb,teatime
asciilifeform: ( your encipherment speed is limited to 1/S of your rng's bit rate, where S is the splitness )
asciilifeform: my approach is a universal 'stretcher', predicated on having reasonably fast and high-quality trng. ☟︎
asciilifeform: not defined for any kind of stretching.
asciilifeform: nope. it isn't a keccak-like thing, isn't 'rubber'
asciilifeform: ( which it is really but a restatement of )
asciilifeform: you thereby get a 'ratchet'. which afaik is the only hard strength result in all of crypto aside from von neumann's otp proof...
asciilifeform: anyway orig method is in log, http://btcbase.org/log/2017-02-25#1618462 << merely in application to slightly different form of the problem ( how to combine voodoociphers in such a way that the result can in no circumstances be weaker than the strongest of the items ) ☝︎
asciilifeform: and, on top of this, each stream ~individually~ is not distinguishable from rngolade.
asciilifeform: back to the shamir scheme : the only thing i can properly prove about it, is that it isn't weaker than straight single-key-with-no-splits
asciilifeform: ( i see it as a still-unsolved problem. )
asciilifeform: sorta how i ended up exploring the http://btcbase.org/log/2016-12-24#1589881 item ☝︎
asciilifeform: the 1 aspect that historically bothered me, is that enemy knows now a relation between the plaintexts in the 4 streams
asciilifeform: does this make sense ?
asciilifeform: on the decipherment end, each split gets deciphered with the respective 128b key , and the four parcels xor'd to form the plaintext again.
asciilifeform: anyway for 512bit key, you still keep the 128bit block. but each time you have incoming 128b plaintext, you shamir it rngistically into 512bits, i.e. 4 128b parcels that must be xor'd to reconstitute the original. each of these get ciphered with one of 4 independently-generated 128b keys. ☟︎☟︎
asciilifeform: this is wrong; and the correct algo is in the l0gz...
asciilifeform: actually nm
asciilifeform: xor split each plaintext block, that is
asciilifeform: to expand a K-bit (block and key, we'll assume, are each K-bit) voodoocipher to J bitness, xor split ( on rng ); having generated J / K independent keys; each incoming plaintext block of J bits, is cut into J / K blocks, and each enciphered with the corresponding key. decipher -- same.
asciilifeform: http://dianacoman.com/available_resources/nessie_vectors.txt << 404 btw
asciilifeform: truth be told, all published symmetric ciphers are fundamentally liquishit, and for approximately the same reason ( http://btcbase.org/log/2016-06-06#1477746 ) . they divide merely into the 'already publicly broken' and 'not yet' ☝︎
asciilifeform: the process whereby rijndael became usg's national One Troo Cipher was as dubious a thing as could be expected.
asciilifeform: ^ possibly in there, actually. re the faux 'contest'.
asciilifeform: !#s from:mircea_popescu aes
asciilifeform: !#s from:asciilifeform aes
asciilifeform: aha.
asciilifeform: http://btcbase.org/log/2015-01-17#981006 << thread. possibly elsewhere. ☝︎
asciilifeform: the item at the time known as 'rijndael' was crowned by nsa, and was proclaimed 'aes'
asciilifeform: diana_coman: well 'a candidate replacement for the algorithm used at that time under the name of “Advanced ..' is not quite it, they competed for the usg tourney crown
asciilifeform reads
asciilifeform: oh hey hey hey ljb!
asciilifeform: feel free to upload the vdiffs/sigs to the ml yourself if you can think of a reason why it belongs there
asciilifeform: mod6: trb ml was really not imho the proper place for it: mpi is not used in trb
asciilifeform: also on phf's http://btcbase.org/patches?patchset=mpi&search=
asciilifeform: orig & update , both properly vtronic
asciilifeform: mod6: whole thing is at http://www.loper-os.org/?p=1533
asciilifeform: ( see also http://btcbase.org/log/2017-09-30#1718499 etc ) ☝︎
asciilifeform: unsurprising
asciilifeform: ... sci-hub.la turns out still worx ( reminds of ye olde mpex... )
asciilifeform: ( anyone outside of gringolandia wanna try ? )
asciilifeform: in other noose, sci-hub.cc dun resolve nomoar. ☟︎
asciilifeform: or how about bugs in basic arithm routine.
asciilifeform: or how about the 'pre-allocated vs not' nonsense
asciilifeform: hilarious on multiple levels : bignumtron so large and unfitting in head that it has to be probed via fuzzing, like microshit...
asciilifeform: in other lulz : http://www.openwall.com/lists/oss-security/2017/11/21/4 ( https://archive.is/N6vFJ ) << 'bignum fuzzer that compares the results of mathematical operations (addtion, subtraction, multiplication, ...) across multiple bignum libraries. Among these is the Go programming language, specifically the "math/big" package [1]. Recently, the fuzzer found a problem in its exponentiation operation...'
asciilifeform: Essentially Qualifies!
asciilifeform: didjaknow!
asciilifeform: also phf's linked pediwiki item is hilarious : '...floating material in lava lamps, extracting random data from the pictures, and using the result to seed a pseudorandom number generator.[1] Although the secondary part of the random number generation uses a pseudorandom number generator, the full process essentially qualifies as a "true" random number generator due to the random seed that is used.'
asciilifeform for some reason unable to turn up the thread in the l0gz where we did the 'rng design is not a technical problem , but a political problem' thing
asciilifeform: with bigger, bigger wall of lamps, each time.
asciilifeform: and then again somewhere else.
asciilifeform: betcha it will become a 'new' idea at, e.g., google, a few yrs from now.
asciilifeform: phf: consider the sheer degree of unabashed cargocultism in the endless rehash of the lava lamp thing
asciilifeform: ( am i the only one who actually uses phf's very spiffy pointy-hand arrows ? )
asciilifeform: phf: see thread
asciilifeform: ( will also point out, the lamps per se contribute ~0 entropy, arrangement is really ~same as hashwhitening output of camera static with the lens cap on )
asciilifeform: and apparently doomed to be recycled forever by svderps
asciilifeform: was sgi publicity stunt, even patented
asciilifeform: !~google lavarand
asciilifeform: http://btcbase.org/log/2017-11-22#1742041 << dun see what this has to do with phuctor... and 'lavarand' existed in '90s ( where is it nao..? ) ☝︎
asciilifeform: when they started fritzchipping
asciilifeform: it piled since 2009
asciilifeform: ( not, say, like the famous fdivbug in '90s )