ENCRYPTOR RESULTED FROM BEATING THE 7Z FOR INCOMPRESSIBLE FILES

JOAO, SILVESTRE (2014) ENCRYPTOR RESULTED FROM BEATING THE 7Z FOR INCOMPRESSIBLE FILES. In: Second International Conference on Advances in Computing, Electronics and Communication - ACEC 2014, 25 - 26 October 2014, Zurich, Switzerland.

[img]
Preview
Text
20150117_052140 (1).pdf - Published Version

Download (2MB) | Preview
Official URL: https://www.seekdl.org/conferences/paper/details/4...

Abstract

The generation of incompressible files to 7z led to a new encryption algorithm. In this paper is presented the new encryption algorithm and the results of testing the new encryption technique, named Encryptor. The new algorithm, is a private algorithm, with only 64 bits in the state variable, but can be extended to other lengths. The Encryptor is protected from password attacks by a very long hash algorithm. The inferred characteristics of the algorithm are of infinite length sequence, and therefore can not be attacked by the sequence. The characteristics of sequence are Gold code. Hitting the mark is only a result that can decrypt, everything else is noise. The algorithm is not a maximum length sequence, but a random length sequence. For example a sequence with four bytes repeats almost at four Gigabytes of data. The statistics of data at various lengths is flat. The brute force attack can take 264 executions of the Encryptor that is a sequential algorithm and takes to long to attack. The only way to attack the Encryptor is the DNA algorithm but has the problem of processing 16Exabytes. The implementation of this new algorithm is very fast and can be suitable for hardware implementations for its simplicity.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: MD5 hashing, Single source shortest path, Three tier security
Depositing User: Mr. John Steve
Date Deposited: 30 May 2019 10:18
Last Modified: 30 May 2019 10:18
URI: http://publications.theired.org/id/eprint/3070

Actions (login required)

View Item View Item