log☇︎
50400+ entries in 0.009s
asciilifeform: i'ma cheat and cite my own article, http://www.loper-os.org/?p=1913 : '... in a heavily-restricted subset of the Ada programming language — the only currently-existing nonproprietary statically-compiled language which permits fully bounds-checked, pointerolade-free code and practically-auditable binaries. We will be using GNAT, which relies on the GCC backend.'
asciilifeform: ( it is however presently unclear to me why the entire ciphrator has to live in kernelspace. granted the packet-thrower perhaps must. but why whole thing. )
asciilifeform: ( iirc i posted a cookbook re same, while back )
asciilifeform: zx2c4, mircea_popescu : it is quite trivial to build a kernel mod with gnat
asciilifeform: mircea_popescu: zx2c4's thing ? nope, notyet
asciilifeform: cascadianhacker.com/07_v-tronics-101-a-gentle-introduction-to-the-most-serene-republic-of-bitcoins-cryptographically-backed-version-control-system << likbez
asciilifeform: v per se is pretty simple
asciilifeform: zx2c4: this isn't v per se tho, it is a graphical viewer for same
asciilifeform: mircea_popescu: iirc you need a svg-capable wwwtron
asciilifeform: mircea_popescu: it shows up here
asciilifeform: mircea_popescu: see log
asciilifeform: it is demonstrably not constant time, on several popular machines, we went over this
asciilifeform: because i can tell when a particular message has been received and ack'd
asciilifeform: zx2c4: the distinguishability of keepalives also makes it considerably easier to carry out timing attack on your nonconstanttime ecc engine
asciilifeform: zx2c4: speaking in general of symmetric ciphers -- a known-plaintext instance anywhere in the stream, or even a means of narrowing down possible plaintext, makes for considerably cheaper break
asciilifeform: mircea_popescu do you have a link to the famous penguin handy ?
asciilifeform: right
asciilifeform: in such a message
asciilifeform: zx2c4: it would appear that you have a known-plaintext though
asciilifeform: fair'nuff
asciilifeform: ( alternatively, how many bits do i need to flip in an otherwise correctly configured box, to set a 'noise' cipherer, into null mode ? )
asciilifeform: lol
asciilifeform: mircea_popescu: what i see is, the cell is there, but there is no indication that it is connected , as it ought to be, to red lights, siren, and dropping of reactor moderator rods
asciilifeform: ( when initially connected to fleanode )
asciilifeform: zx2c4: generally you will say !!up to deedbot in pm
asciilifeform: it appears to be a valid state of the state machine. else why would it be mentioned in the spec.
asciilifeform: !!up zx2c4
asciilifeform: what's the justification, for permitting it at all
asciilifeform: i understand the bare fact, zx2c4 . my question is, why do you think the protocol author permitted an unsecured mode as a valid mode of operation ?
asciilifeform: ( see also http://btcbase.org/log/2018-04-11#1796297 ) ☝︎
asciilifeform: this does not bother you ?
asciilifeform: zx2c4: granted, but it would appear that the orig spec of 'noise' permits null-ciphering, just like the nsa-authored ssl/tls.
asciilifeform: seems that it does.
asciilifeform: zx2c4: do i misread ? because in the spec, 'No confidentiality. This payload is sent in cleartext.' ( http://www.noiseprotocol.org/noise.html#message-format section 7.4 )
asciilifeform: the q , then : why does 'noise' include a null-cipher mode ?
asciilifeform: ( co-author ? )
asciilifeform: zx2c4: are you the author of 'noise' protocol ?
asciilifeform has 1 more q for zx2c4 , after mircea_popescu finishes
asciilifeform: zx2c4: which you can withdraw using deedbot at your leisure
asciilifeform: zx2c4: he just threw a whole bitcoin into your piggy.
asciilifeform: zx2c4: they're for mircea_popescu to decrypt; it makes the command go.
asciilifeform: mircea_popescu: lol notyet, i did the 'civilized' thing as you suggested.
asciilifeform: zx2c4: i'ma leave the rest of the session to mircea_popescu , owner of this chan, and my co-author in e.g. the FUCKGOATS auditable trng, https://archive.is/CGQkR )
asciilifeform: but it so happens that i in particular do not think much of the work of current 'pro cryptographers'.
asciilifeform: i'm less interested in 'testimonials', and more in re criticisms
asciilifeform: any possibility to see who ?
asciilifeform: zx2c4: so it is not possible currently for me to learn , which cryptographers reviewed, and what they had said ?
asciilifeform: i'm curious, for instance, whether any of the cryptographers observed that the arithmetical routines behind your ecc are not in fact constant time on e.g. arm.
asciilifeform: happen to have a link handy ?
asciilifeform: and the reviews themselves, also ?
asciilifeform: is it on www ?
asciilifeform: are the reviews published somewhere ?
asciilifeform: since mentioned scrutiny : on www of 'wireguard', there is mention of 'reviewed by cryptographers' . may i ask, who reviewed ?
asciilifeform: i don't see 'not publicly smashed to bits of just yet' as a proof of strength, given as it is true of literally every system ever devised, until the moment of public breakage
asciilifeform: md5 was also fast and simple...
asciilifeform: but to move on from this item : zx2c4 how did you select 'blake2' hashing system ?
asciilifeform: !!up zx2c4
asciilifeform: and rot13 even faster
asciilifeform: rc4 was also 'simple and fast'...
asciilifeform: but of djb's in particular, their sudden popularity in past few yrs also has no satisfying explanation imho.
asciilifeform: i am skeptical of all symmetric ciphers and hashes, given as there exists no scientific basis for considering any of them to be actually strong.
asciilifeform: it's a 1) open problem 2) afaik nobody is publicly working on
asciilifeform: or for anything else.
asciilifeform: afaik no proof of hard-average-case exists for it
asciilifeform: several yrs ago i went in search of ~any~ problem that can be shown to have a ~nphard average case~ . and found none.
asciilifeform: conceivably factoring is in P.
asciilifeform: when i ask for 'reduces to nphard', obviously i cannot mean 'factoring', because its hardness is not proven
asciilifeform: so it suffers from similar problem.
asciilifeform: sadly enough, there is not, as of my last look, a proof that rsa reduces to hardness-of-Factoring
asciilifeform: ( i.e. a reduction to np-hard or for that matter ANY particular complexity class )
asciilifeform: zx2c4: does it bother you that no proof of strength for any symmetric cipher other than otp (e.g. aes, chacha, etc ) exists ?
asciilifeform: how did you settle on the use of bernsteinian cryptoprimitives ( e.g. chacha ) ?
asciilifeform: project
asciilifeform: but let's come back to your product, zx2c4 :
asciilifeform: ( or see the ffa article series, http://www.loper-os.org/?cat=49 , currently on sabbatical but due to resume after i come back from upcoming biznistrip )
asciilifeform: !#s fits in head
asciilifeform: but i have a somewhat different approach, which i call 'fits in head'
asciilifeform: zx2c4: i've spent the past ~2yrs writing a properly constant-time arithmetic lib. it is being slowly published. ( see earlier link to my www )
asciilifeform: zx2c4: most of the currently-sold intels are ok re : imul. arm, however, is not
asciilifeform: ( complete with list of known-to-be-sad chips )
asciilifeform: discussed, for instance, in https://bearssl.org/ctmul.html
asciilifeform: it has been common knowledge for some years
asciilifeform: zx2c4: this particular architectural sadness is not my discovery
asciilifeform: zx2c4: to observe it, you will have to hand-emplace rdtsc around it , and run on properly doctored inputs
asciilifeform: aaa lol nm
asciilifeform: zx2c4: phf has been fiddling with the thing's uniturd processing of late; prolly introduced bug
asciilifeform: 41 kB, notbad
asciilifeform: ppc, arm7, older intels ( e.g. 486, celeron ), and possibly new intels , all have variant-timed IMUL
asciilifeform: http://btcbase.org/log/2018-02-17#1784243 << see e.g. this discussion. ☝︎
asciilifeform: btw zx2c4 , i must regret to inform you that the code you linked, is in fact NOT constant-time on several common architectures, because it makes use of machine MUL instruction ( gcc will compile a nonconstant-operanded '*' to e.g. IMUL on x86 )
asciilifeform: correct
asciilifeform: if i want to hand-audit it, say.
asciilifeform: out of curiosity, how big is the typical built binary for this library ? ( say, on amd64 )
asciilifeform: anywhere ? or in particular routines ?
asciilifeform: i.e. , if i disasm your .o , will i see 0 conditional jumps ?
asciilifeform: how is the latter guaranteed ?
asciilifeform: let's posit that the proving system itself contains no errors. what classes of error do these systems claim to exclude ?
asciilifeform: zx2c4: which proving system did you use ?
asciilifeform: !!up zx2c4
asciilifeform: let's return to DH