An encryption algorithm (T-key) based on a 4D tesseract
Ali M Alshahrani, Stuart D. Walker · 2015
In this paper, innovative 4D tesseract-based solutions (T-key) are suggested, implemented, tested and shown to overcome the drawbacks of most existing algorithms. They are based on a symmetric block cipher technique and have a large key-space (e.g. 384-bit). Three key size are suggested as examples, which are tested and evaluated: T-{0,1}128, T-{0,1}256and T- {0,1}512. Moreover, four lightweight coding rounds are applied to create these keys from the 4D tesseract key containers. The execution speed of the T-key was compared with the AES cipher , and the results indicated that the first two encryption key sizes suggested here are faster than the first two encryption keys of AES. Furthermore, the security evaluations carried out on the suggested algorithm showed fully resistance the statistical attacks and pass the correlation coefficient test.