The Third Abstract Applied Boolean

From: Douglas Eagleson (eaglesondouglas_at_yahoo.com)
Date: 10/30/05

  • Next message: Douglas Eagleson: "Re: The Third Abstract Applied Boolean" 
    Date: 29 Oct 2005 18:05:33 -0700

    A binary representation as the code is far different from the ascii
    representation. And to call the solution to AES the binary of all
    appears the SAT of AES. And to solve the difficult discussion of actual
    complete logic in boolean world, somebody figured out the third
    abstract engine.

    And the implication is the number or symbol of evey algorithm as a
    single time searchable string. And then fast number addition allows
    searching the entire key space.

    I am a novice at third abstract engines. I tried to make one with
    SOCKET. The repeating string in relation to the key is SOCKET.

    Well, I am just confused. And need to understand the topic of hard
    solving any algorithm. Since 2003 the hard SAT has been possible.

    What is and SAT? I have no idea. It just to be seems out there.

    Is the complete boolean possibble? Maybe it is?

  • Next message: Douglas Eagleson: "Re: The Third Abstract Applied Boolean"

    Relevant Pages

    • Re: Triple AES (3AES)
      ... > know is going to brute force the key space for AES-128 more than once ... > before the universe implodes. ... > Let's not talk about brute-forcing AES. ... Brute-forcing AES within a reasonable amount may be possible within ...
      (sci.crypt)
    • Re: AES or Triple DES?
      ... > to be more secure than AES 128. ... Another minor advantage is that AES has no known weak keys. ... The 128-bit key space represents 16 ... were raised against DES. ...
      (sci.crypt)
    • Re: Why is AES more secure than DES??
      ... which connotes blind search of the whole key space, ... restricted key space instead of the one that is ... which is vastly larger for AES ... than for DES. ...
      (sci.crypt)