336500+ entries in 0.203s
mircea_popescu: "1998-10-29 dscott@networkusa.net: "It is obvious
that mixinf
three different
types of ciphers would be better
than
Triple DES...." << well, it's CERTAINLY obvious
that mixing
TWO
types is better
than double-des
mircea_popescu: howly shit, a 7500
town worth 2mn, and
the bribes going
to mayor ~ part of a used car ?
pete_d_out: start with
the small
towns,
then
the mid-size
towns,
then
the bigger
towns ?
pete_d_out: contravex
turns
two years old on february 22nd :)
mircea_popescu: meanwhile notice
that EVERYONE is on aes
to
the degree people are
treating it like windows.
mircea_popescu: strong.' Why? Because we *can't* know how strong our ciphers *really* are
to
the other guy. But we *can* -- guaranteed -- make
The Opponent pay dearly
to keep up.""
mircea_popescu: "1998-10-26
Terry Ritter: "We *never* know
that a cipher is strong. Ever." "Now, we might 'consider' a cipher strong when all *our* guys have looked at it and found no break. But, quite frankly,
the *other* guys have more
training, more experience, more resources, more
time, and
they may even be smarter
than our guys." "I claim it is more important
to have many different ciphers
than
to have a few which are 'considered
mircea_popescu: "1998-10-18 dscott@networkusa.net: "Part of
the NSA job is
to keep
the world in
the dark about real ctypto.
Think about it. What better way
to do it
than by creating crypto preists for people
to whorship."" and apparently
this was well understood 18 years ago, also.
mircea_popescu: 1998-10-18 W
T Shaw: "In Bruce's work,
there are sinful omissions and comissions, but
the subject is so large
that
this would always be a surity in some form.
To judge his character, we will see if he mentions in
the future any
things he has previously ignored and have been pointed out directly
to him." << no. as confirmed
throughout and including 18 years later.
mircea_popescu: " everything looks like a boolean satisfiability problem.
This problem, also called SAT, is NP-complete, which means
that every instance of any problem in NP can be efficiently reduced
to a SAT instance. And, importantly,
there are SAT solvers out
there which are very efficient for many problems encountered in practice."
ben_vulpes: stop paying lizard hitler for entries in his global lookup
table
thestringpuller: removes itops out of
the equation in lieu of developers slowly losing sanity
to ruby
thestringpuller: "Don't wanna deal with
this bullshit? Buy puppet enterprise
today!"
thestringpuller: like wtf are
these people doing when
the put
together package management
thestringpuller: the one
that shipped with
the product
that uses it doesn't even have
the symbol in it?!?!?
thestringpuller: so I get
this error " EC_GROUP_new_curve_GF2m symbol not found at runtime link blah blah"
thestringpuller: but apparently it doesn't know how
to find
the right .so
to link
thestringpuller: asciilifeform:
today from
the mines. I'm setting up puppet which uses openssl
mircea_popescu: but herein we find
the elixir of my
tolerance of orcs
that perhaps bedazzles you alf.
this is it :
they may be stupid, but at least
they're not
TRAINEDLY dumb.
mircea_popescu: stupidity of
this caliber can't be naturally produced, has
to be learned.
mircea_popescu: but currently, a box wherein you input code on one end, and it outputs
this peculiar graph at arbitrary zoom level is
the most valuable computer i can
think of.
assbot: Logged on 07-03-2015 18:12:58; asciilifeform: ben_vulpes: 'for your convenience we have packaged
the defective
transistors separately' ? (famous)
mircea_popescu: in principle, at 100% granularity
this would
then result in an image 2^256 or however many pixesl wide. fine.
mircea_popescu: you know, so
this algo has N keys, fine,
the space is N. caqlculate
the complexity for all of
them, sort
the weakest
to
the left, draw it for me.
mircea_popescu: oh wow, bitbet uses google charts, i forgot. anyway. likew one of
the bitbet charts!
mircea_popescu: looking exactly like
this :
https://chart.googleapis.com/chart?chs=240x45&cht=ls&chco=FFFFFF,FF9900,FFFFFF&chd=t:100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,1 mircea_popescu: but you know what i want ? i want it
to output a fucking graph!
mircea_popescu: and
this should NOT in general be as hard as
to actually break any one key.
mircea_popescu: anyway,
the more i
think about
this
tyhe more im convinced our problems are really one problem :
the absence of a proved mechanism
to create
the difficulty graph of a primitive.
mircea_popescu: what we want is some actual methods
to calculate
the difficulty curve over
the space
mircea_popescu: have
the message specify
the conditionation, and
then how
the fuck are you going
to extract it if you don't know what you're starting from
mircea_popescu: asciilifeform incidentally, another
thought occurs : maybe
the way
to go is make
the key a matrix and go for something like
the maximum volume submatrix problem somewhere in
there.
mircea_popescu: im sure
that he had his fill of
those.
talk of interesting
things
to him instead.
mircea_popescu: so you were independently looking at
this and from before ?
mircea_popescu: i
thought you had just went from a comment i just published. except i hadn't.
mircea_popescu: hey, btw, did
THAT vc powered bs mix ever come
to anything ?