Idea for algo.

From: Peter (peter_rabbit_at_shaw.ca)
Date: 12/31/03


Date: Wed, 31 Dec 2003 02:51:24 GMT

Most algos that I've seen involve the use of XORing, addition,
subtraction, rotation & bitshifting in any combination and to various
levelsof complexity. Some just seem to be substitution ciphers.
Following is a proposal that definately does not fall into the first
category, but perhaps into the second one(?).

------------------------------------------------------------------
Create 2 - 256 Byte arrays: a_key() & rb() (reference box)
In the a_key() scramble the numbers from 0 to 255 according to the
password (similar to an RC4 mix)
Create the ref box (rb()) such that it contains the information as to
which Bytes are stored where in the a_key().

eg. a_key()= 5,1,8,0,4,7,9,2,6,3,...
position 0 1 2 3 4 5 6 7 8 9,...
        rb()= 3,1,7,9,4,0,8,5,2,6,...

in other words... rb(0) tells us that the '0' is in a_key(3)
so if the plain text is 834, the cipher text would be 294.

The cipher text stores only the references to the locations. No XORing,
adding, subtracting, rotating or shifting is involved.

After each operation the a_key() and rb() are mixed, so that the same
plaint text is not referenced by the same location twice in a row.

Repeating cipher pairs should approach 256^2 for any pair and 256^3 for
any triplets etc.
-------------------------------------------------------------------------

Any serious thoughts? Has something like this been done before?
Peter



Relevant Pages

  • Re: awk or sed
    ... I was looking at it like a rotating alphabet substitution code wheel. ... What I wanted to do was change the rotation on the fly, ... military style cipher. ...
    (alt.os.linux)
  • Re: Please test this encryption
    ... >> That's merely because you've misunderstood what a secure cipher is. ... some have tried monoalphabet substitution or xoring. ... Plenty of information to crack it...and you are all so sure its easy ...
    (sci.crypt)
  • Simple cipher program help
    ... I'm trying to write a program to take 64bits of plaintext in, ... kind of key, create 64bit cipher text. ... All this done over 16 iterations. ... I was thinking, getting the input and key to binary, then XORing them, then ...
    (sci.crypt)