
This paper introduces a new encryption method aimed at improving the cryptography process through the use of splitting radix Fourier Transform technique called Split-Radix Fast Fourier Transforms (SRFFT). The proposed method is based on splitting the FFT radix-2 and radix-4 algorithms to achieve improved information assurance by SRFFT two phases. The first phase applies direct computation of SRFFT algorithm on input plaintext to produce a ciphertext and the second phase applies the reversing SRFFT algorithm to decipher. Several types of cryptoanalysis attacks such as brute-forcing, autocorrelation and dictionary attacks are comparatively evaluated and the end result of SRFFT evaluation indicates that SRFFT is preferable in many practical encryption applications since SRFFT complexity increases with the range of split-radix computations thus eliminating the potential chances of cryptanalysis attacks.
computation, cryptanalysis, Electronic computers. Computer science, split-radix, QA75.5-76.95, complexity, encryption
computation, cryptanalysis, Electronic computers. Computer science, split-radix, QA75.5-76.95, complexity, encryption
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
