المستخلص: |
Although many encryption methods are available, there is always an ongoing need for more to resist the adversaries’ ever-growing analytical skills and techniques. We propose in this paper an innovative method for text encryption. We devise a random number generation function that creates sequences of signed random numbers that depend on both plaintext and key. The random numbers support the functionality of four random operations: random mutation, random cyclic shifting, random permutation, and dirty symbol random insertion. These operations ensure the data security by steadily melting the statistical structure of plaintext and relationships to a key. The experiments with our prototype implementation showed that our method has high effectiveness (in terms of diffusion, confusion, avalanche) and high efficiency with respect to the computation demands. © 2017 The Authors. Production and hosting by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
|