DS2 Encryption (Midkiff/Greenwoodf)

DS2 Encryption is ideally suited to secure the digital transfer of information on public
networks such as the Internet. The DS2 salt technique can theoretically output 1,078,203,909,375 different encrypted byte streams from just one input stream. Therefore even if the same data is transmitted again it will not look the same. Along with slick clean math function this cipher is fast and secure. From analysis, certain forms of differential attacks may be successful on lesser round variants of this algorithm but nothing is certain. The key-size is variable length and is undeterminable from analysis. Meaning very large keys can be achieved!
SALT TECHNIQUES USED:
This is achieved by selecting 5 random bytes and adding them to the byte stream. The byte stream then undergoes CBC (Cipher Block Chaining), byte & bit level processing before being spit out as 1 of the 1,078,203,909,375 different possible ciphertext results.

Original Author: Dave Greenwood

About this post

Posted: 2002-06-01
By: ArchiveBot
Viewed: 110 times

Comments

No comments have been added for this post.

You must be logged in to make a comment.