Re: Specific encryption

From: Benjamin Choi (nospam_at_technosoft21.com)
Date: 01/26/04 

Date: 25 Jan 2004 23:38:51 -0800

Richard Heathfield <invalid@address.co.uk.invalid> wrote in message news:<4014358d@news2.power.net.uk>...
> paaro wrote:
>
> > My question is:
> > is there an algorithm, which would encyrpt the given string in such
> > manner, that when we would add some chars at the end (or maybe just
> > alter some chars at the end of encrypted string) and then would
> > decrypt it, that we would get something completely different out of
> > it. Not that just the end of the string would be slightly different,
> > but the whole decrypted string would be completely messy and different
> > from the original.
>
> My own CDX-2 algorithm will do this. Note that CDX-2 has had very little
> analysis done on it, and those who have looked at it have not been
> impressed (although no actual crack has yet been published). Nevertheless,
> it does have the property you seek:

Not if you apply it to a long message though. CDX-2 diffusion is
constant and quite poor applied to long messages with short keys. 

--
Benjamin Choi

Relevant Pages

  • Re: Specific encryption
    ... which would encyrpt the given string in such ... >> but the whole decrypted string would be completely messy and different ... changed ciphertexts. ... This example is not valid for CTR mode. ...
    (sci.crypt)
  • Re: [PHP] Encryption failing
    ... which get trimmed before encryption? ... only alphanumeric characters. ... appending bunches of nulls to the decrypted string. ... decrypted string had a lot of nulls at the end. ...
    (php.general)
  • Re: Specific encryption
    ... > is there an algorithm, which would encyrpt the given string in such ... > but the whole decrypted string would be completely messy and different ... it encrypts in 16 ...
    (sci.crypt)
  • Re: [Emacs] Kommentieren
    ... ;; completely up to the user to decide, what the string ... "Chars preserved of STRING. ... `CHARS-PRESERVE' must be a parentized expression, ...
    (de.comp.editoren)
  • Re: FASTEST way to try all strings (a until ZZZZZZZZZZZZZZZZZZZZZZZZ)
    ... > It will be a very huge table so I in my opinion. ... > When it would be used, than it should be converted to a string, however ... >> How would an array of Byte be any faster then an array of Char? ... >> array of Byte is needed, however the OP suggested Chars (A to Z, a to z ...
    (microsoft.public.dotnet.languages.vb)