Re: Unbreakable Encryption - Scenarios - What encryption method would be best?

From: Mok-Kong Shen (mok-kong.shen_at_t-online.de)
Date: 03/16/04 

Date: Tue, 16 Mar 2004 09:34:50 +0100

Tom St Denis wrote:

> "Bartosz Zoltak wrote:
>>Tom St Denis wrote:
>>[snip]
>>
>>The main point was my question :
>>
>>Is there really no known method of combining cryptographic algorithms
>>in a way to build a provably unbreakable symmetric encryption? Certain
>>modes of operation can be proved
>>as-secure-as-the-underlying-block-cipher, but IS THERE no way to get
>>"a level lower" with the proof - that the very cipher can be proved
>>secure if some basic assumptions are satisfied?
>>
>>As far as I know there is no such scheme but I may be wrong. Is there?
>
>
> You can prove security against most attacks. The problem is not all
> attacks are known.
[snip]

Aha, you also know that! This gives clear support to the
usefulness of the schemes that I proposed in the other
thread. For these effectively hinder the opponent to
choose 'suitable' plaintexts and/or ciphertexts (i.e.
all kinds of input to the system that are particularly
favourable to him to do analysis) from the outset. Right?

M. K. Shen

Relevant Pages

  • Re: Proposed PRNG
    ... You found flaws in my ... and wrote off the whole scheme. ... This is a serious flaw with my jumbling algorithm. ... trying to render brute-force attacks impractical by making ...
    (sci.crypt)
  • Re: Can we obtain securer data encryption if we encrypt the data once more?
    ... provably /can't/ work) for chosen plaintext or chosen ciphertext ... attacks which is used as the standard notion of security for encryption ... independent choices of the keys, we can't choose our own keys for the ... of the composed scheme. ...
    (sci.crypt)
  • Re: Encryption Algorithm
    ... >Has the key to be stored more secure than the data to be protected? ... So forget about XBox attacks, lsfr attacks, etc. ... The whole scheme ...
    (comp.arch.embedded)