A Key Dependent Encryption Algorithm Based on Multiple Bitwise-Shuffling and XOR Variable-Length Partitions
Abdelfatah Aref Tamimi1 Show affiliations
- Al-Zaytoonah University of Jordan, Jordan
Journal of Computer Science, Volume 12, Issue 2, pp. 98–105 · doi.org/10.3844/jcssp.2016.98.105
Abstract
This new algorithm employs shuffling procedures combined with variable-length key-dependent XOR and S-box substitutions to perform lossless image encryption. This algorithm was implemented and tested by performing different permutations of shuffling, XOR encryption and S-box substitution. Empirical analysis using different types of test images of different sizes showed that this new algorithm is effective and resistant to statistical attacks. The idea presented by this algorithm may be generalized to apply to input data other than images and may be combined with other encryption methods.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Tamimi, A. A. (2016). A Key Dependent Encryption Algorithm Based on Multiple Bitwise-Shuffling and XOR Variable-Length Partitions. Journal of Computer Science, 12(2), 98–105. https://doi.org/10.3844/jcssp.2016.98.105
- Licence
- CC BY 3.0
- Issue
- Volume 12, Issue 2
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record