Re: Promising algorithm needs evaluation



Bruce Stephens <bruce+usenet@xxxxxxxxxxxxxxxxxxxx> wrote:
So you're taking the key and masking it with a fixed binary string, half
of whose bits are 0, and then using that to XOR? That means an attacker
can immediately read half the bits of the message, doesn't it?

It's a useful exercise for daniel777@xxxxxxxxxxxxxxx to figure out how
to read the remaining half. Hint: Adapt some attack against Vigenere.

--
kg
.



Relevant Pages

  • Re: How good an encryption algorithm is this?
    ... with exactly ONE effective key byte (which is the result XORing ... to encrypt a bunch of zero bytes. ... Since the result of 0 XOR D is D, ... The result is that your attacker ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: How good an encryption algorithm is this?
    ... with exactly ONE effective key byte (which is the result XORing ... to encrypt a bunch of zero bytes. ... Since the result of 0 XOR D is D, ... The result is that your attacker ...
    (microsoft.public.vc.language)
  • Re: DES encryption of small data
    ... > I use a special approach for DES encryption of data smaller than DES ... If the IV/Key are fixed then an attacker can compare messages ... can XOR two messages to obtain InputData1 XOR InputData2. ...
    (comp.security.misc)
  • Re: THE SIMPLIEST SAFE CIPHER
    ... In your "special" transform all that results is a permutations ... of the XOR of continuing PI expansion and the KEY BITS ... The attacker attacks the permutation. ...
    (sci.crypt)
  • Re: which way is better for session key transferring
    ... I think s becomes a session key in someway, ... guarantees that an attacker knowing r knows ... nothing about Hxor H, ... methodology that appears to be faster than exhaustive search that should ...
    (sci.crypt)