159500+ entries in 0.07s
mircea_popescu: it's not programmable quite to your taste, but it does deal in reals.
mircea_popescu: again and again we come to the "will need nre hardware" thing
mircea_popescu: and know to be harder than p is a more valuable proof for our interest than known to be in np.
mircea_popescu: by which i mean, known to be harder than p. this is proven.
mircea_popescu: or to get back to exponential space problems : "decide first order logic propositions with real numbers, adition and comparison" is a very hard problem.
☟︎ mircea_popescu: it is, in point of fact, a TERNARY NUMERIC SYSTEM MATRIX
mircea_popescu: asciilifeform go is convenient tho because so close to a matrix.
mircea_popescu: and take Stearns-Hartmanis, you know for a fact that all EXPs are actually NOT in P
mircea_popescu: (note that "beating a human" is not equivalent to solving this. if it were...)
mircea_popescu: asciilifeform come to think of it : take a matrix, set it to go pieces, calculate the value of the position.
mircea_popescu: iirc all exp- are proven not in P. which is better than what is known for np.
mircea_popescu: expspace for instance. everyone's fixated on exponential run time
mircea_popescu: man fucking schneier is intolerable. i can pick out his lines even without looking at attribution. his entire output comes out of a tiny fucking word grinder.
mircea_popescu: asciilifeform incidentally ... what about the set of ultra np ?
mircea_popescu: i suspect it goes deeper than that. something something entropy/and/bandwidth
mircea_popescu: 1998-10-30 Douglas A. Gwyn: "...I can exhibit the design for a block cipher that is demonstrably secure according to the rules of the game, although it wouldn't be *practical*." << you should write to him, too.
mircea_popescu: if you have ciphers A B C with block lengths lA lB lC, then the chaining should be applied in such order that l1 > l2 > l3.
mircea_popescu: also i should like to propose a lemma : that chaining should always proceed TOWARDS SMALLER BLOCKS
mircea_popescu: anyway. aes and des should be excommunicated out of everything asap, there's no two ways about it.
mircea_popescu: yet somehow the decades passed for no benefit and idiots still pretend like it's never happened. outrageous.
mircea_popescu: apparently all the stuff i proposed as common sense was in point of fact common sense plainly said on public list 20 years ago.
mircea_popescu: in case any noobs be wondering why it even is triple-DES : doubleDES(plaintext)=plaintext.
mircea_popescu: and there DOES exist such a technique as mathematical induction
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 ?
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."
mircea_popescu recalls how friendly arabs were once it was established he has whiskey and doesn't mind sharing.
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: and yet we deeply wonder why would anyone fix a large key and block requirement!
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.
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: 24,24,24,25,33,33,33,34,34,34,34,35,35,36,36,36,36,36,36,36,36,36,42,42,42,42,42,42,42,42,42,42,43,43,43,43,43,43,43,44,44,44,44,44,44,44,44,44,44,44,45,45,45,45,45,50,50,50,50,50,50,50,50,50,50,50,50,50,50,51,55,57,63,64,65,68,68,68,68,69,69,69,78,78,78,79,80,99,99,99,99,99,99&chls=1|1|1&chm=B,3699a3,0,0,0|B,d01135,1,0,0|D,555555,2,0:0,2
mircea_popescu: 00,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100|43,49,55,55,57,64,67,65,65,65,65,66,74,74,74,74,74,74,74,75,75,73,73,73,73,73,73,73,73,73,76,76,76,76,76,76,76,76,76,76,75,75,75,75,75,74,74,73,73,73,73,73,73,72,72,72,72,72,71,71,71,71,71,73,73,73,73,73,73,73,73,73,73,73,73,73,73,72,73,71,65,64,65,63,63,63,63,62,62,62,55,55,54,54,55,64,64,64,64,64,64|14,15,17,17,18,22,24,24,
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.