Re: Encryption key changing the encryption logic.

From: Cesar Bremer Pinheiro (cesarbremer_at_raseac.com.br)
Date: 02/22/04 

Date: 22 Feb 2004 11:53:50 -0800

> Let's make a simple reference implementation:
>
> We have a function generateWonder as follows:
>
> gw: (k,p) -> (c)
>
> k: key for algorithm to use
> p: plaintext to encrypt with algo k
> c: ciphertext
>
Hi Nico

= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
= =

Thank you for your considerations.

I would like to change your start point, instead using:
gw: (k,p) -> c

You could use:

gw: (k1,k2,p) -> (c)
    k1: key for algorithms logic to use
    k2: encryption key
    p: plaintext to encrypt with algo k
    c: ciphertext
 
Another points of consideration, you can ever made bad architectures
using this aproach, but i am only asking for possible good aproaches
(if they can be done).
One of them could be a strong immutable logic kernel with variable
logic blocks added, or a lot of blocks of strong symmetric encription
to be worked. My idea is not to use simply obfuscation, but to force
the use of a brain in each key to break the cypher text, plus the use
of a computer. The algorithms could be published (without problems), i
was thinking how to increase a lot the number of possible logic
encriptions available in order to make the things harder to break. All
the basic blocks could be immune to the known attacks, or eack block
could be immune to a kind of attack, but we could only mix blocks that
could result in a system immune to the known attacks today used.
We have a lot of possible architectures to be tried, and again, i am
asking for possible good ideas (again, i don't know if this can be
done).

Thank You.

Cesar.

Relevant Pages

  • Re: Recovering TEA keys
    ... Is mi4_encodeever used to encrypt more than one plaintext, ... related-key attacks). ... If the keys are stored in the bootloader, ...
    (sci.crypt)
  • Re: chaining algorithms together
    ... For example, if you encrypt ... Serpent and we will have to find a way to make sure the ciphers are ... commuting which opens the cascade to bit swapping attacks and so on. ... > securely deleted, along with the plaintext. ...
    (sci.crypt)
  • Re: Simple Question: Always the same cyphertext?
    ... algorithms do that, but they are generally considered insecure. ... whereby I would like to verify the integrity of a file using a hash. ... So, I will encrypt the file first, ... same encrypted plaintext will yield the same hash if encrypted on another ...
    (sci.crypt)
  • Re: Interchangeability of Hashing and Encrypting
    ... > block, encrypt it, then the result is added with the ... allow the hash to be verified. ... plaintext and input the key. ... thousands of times to thwart dictionary attacks). ...
    (sci.crypt)
  • Re: Extreme Porn - Hiding your Stash ?
    ... data that we want to encrypt. ... being XORed with the plaintext. ... the breaking of the German Lorenz cypher ... this was because the obscuring characters weren't as random as ...
    (uk.legal)