Re: Advice on a new encryption algorithm

From: Stefan Tillich (stefanti_at_gmx.at)
Date: 04/29/05 

Date: Fri, 29 Apr 2005 09:28:47 +0200

Joseph P. schrieb:
>>How are these tables generated?
>
>
> I have also developed 'false' Random number Generator. The reason I
> say false is because it is based on a Non-Random Number Generator. I
> want to study that more before I release that algorithm but it does
> produce number strings that do not follow a pattern.

You probably mean pseuo-random generators. How do you seed them? Or are
the tables always the same for every encryption.

Now back to the
> question at hand, implementing this step might be a bit more difficult
> in pratice than in design. I created a small application that spits
> out the array declarations to be used in the code. I then copy and
> paste directly into the source code. The tables are variable in
> length.
>
>
>
>>How is the structure of this set? Is the block length fixed over the
>>complete run of encryption? Or does it change wich ever new block?
>
>
> The block sizes do change with every new block.
>
>
>
>>How about some pseudocode here? What exactly are you doing? XOR,
>
> modular
>
>>addition, integer addition?
>
>
> Here is where I worry that all the math gurus will cut my algorithm to
> shreds. All I am doing is converting the characters of the plaintext
> into their ACSII codes adding the shift number from the table and then
> adding the character position in the block. Lastly I convert the sum
> back to the ASCII character matching the new number.

I guess you mean that you are using addition modulo 256.

>
>
>
>>So what if I want to encrypt a binary file?
>
>
> I will encrypt the data regardless of the format it is in. Note: I
> have only tested with plaintext but I developed the algorithm to be a
> file encrypter so it should still work. If you want you can send me a
> file and I can send you back the results.
>
>
>
>>Do you mean it is appended to the ciphertext?
>
>
> Yes!
>
>
>
>>How is that key composed?
>
>
> The key is created as the algorithm randomly choses what table will be
> used next for both the blocks and the encryption.

So lets summarize:

You use some kind of (random?) seed (S) to generate some tables (T) with
some kind of pseudo-random mechanism (PR):

T = PR(S)

For encryption (E) you do the following: You use the tables (T) derive
the ciphertext (CT) and something you call "key" (K) from the plaintext
(PT).

(CT,K) = E(PT,T)

You send CT and K to the receipient (aka Bob). Now what? How does Bob
retrieve the plaintext? Do you also send the seed S or the tables T?

Let's assume Bob has the seed S and regenerates T. He must use the
decryption function (D) to get:

PT = D(CT,K,T)

It this the way it should work? If not, please correct.

Regards

Stefan Tillich

Relevant Pages

  • Re: OK What do you need? was:Re: Please test this encryption
    ... > strong encryption can be broken with brute force methods. ... than key material and some idea of what the plaintext will look like) can be ... a short/single sample is sufficient to figure out an algorithm. ... show logically that a single ciphertext string is insufficient to determine ...
    (sci.crypt)
  • Re: Advice on a new encryption algorithm
    ... I have also developed 'false' Random number Generator. ... Here is where I worry that all the math gurus will cut my algorithm to ... back to the ASCII character matching the new number. ... used next for both the blocks and the encryption. ...
    (sci.crypt)
  • Re: New Encryption Idea
    ... performing the 5 reads necessary in the example algorithm results in a delay ... Panama at 400MB/sec, or RC4 at about 90MB/sec, or AES in CTR mode at ... and the speed failings of your design become very clear. ... > Manansala Encryption and Authentication System ...
    (sci.crypt)
  • Meganets "unbreakable" cryptography? Im skeptical.
    ... Meganet makes such grandiose claims that I can't help but ... There's plenty of coverage on secret encryption algorithms ... encryption algorithm that was granted U.S. Patent ... Labor has bought into this "snake oil" and without a doubt ...
    (sci.crypt)
  • Re: Enigma machine strenght using a computer
    ... cipher with rotors that spin backwards, forwards, stop and start based ... on other rotors, change their values according to the phase of the moon ... encryption less error-prone and they were a cost effective way to get ... case) than not since a wider base uses the same algorithm. ...
    (sci.crypt)
Quantcast