An 8-bit precision cipher for fast image encryption
| dc.date.accessioned | 2022-09-22T14:45:21Z | |
| dc.date.available | 2022-09-22T14:45:21Z | |
| dc.date.issued | 2022-04-21 | |
| dc.description.sponsorship | Gefördert im Rahmen des Projekts DEAL | ger |
| dc.identifier | doi:10.17170/kobra-202209226884 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/14161 | |
| dc.language.iso | eng | |
| dc.relation.doi | doi:10.1007/s11042-022-12368-3 | |
| dc.rights | Namensnennung 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | * |
| dc.subject | chaos | eng |
| dc.subject | multimedia encryption | eng |
| dc.subject | information security | eng |
| dc.subject.ddc | 510 | |
| dc.subject.swd | Chiffrierung | ger |
| dc.subject.swd | Arnolʹd, V. I. | ger |
| dc.subject.swd | Informationssicherheit | ger |
| dc.subject.swd | Chaostheorie | ger |
| dc.subject.swd | Computerarithmetik | ger |
| dc.title | An 8-bit precision cipher for fast image encryption | eng |
| dc.type | Aufsatz | |
| dc.type.version | publishedVersion | |
| dcterms.abstract | Implementing chaos based ciphers usually involves 32-bit floating-point arithmetics that is hardware resources costly. The limitation of the computational precision is hardware imposed and transforms chaotic orbits into limit cycles with short periods, hence alters their randomness. In cryptographic applications, short period dynamics and weak randomness result in security issues. In order to address this concern, we propose an 8-bit precision cipher that can be implemented with low-end microprocessors running 8-bit integer arithmetics. The cipher includes a quantized pseudo-random number generator (QPRNG) based on a 16-dimensional quantized Arnold’s cat map (QACM). We used entropy measure, statistical, sensitivity and key space analyses to evaluate its security level under limited computational precision. Simulation results attest that it is as highly secure as those involving real-number arithmetics, even for only 8-bit precision. We also showed that the period of the proposed QACM can be chosen such that Tₓ > 10²⁷, which is very large as compared to existing QACM. Such a large period implies a high randomness of the derived QPRNG that is confirmed by statistical NIST tests. Contrary to existing ciphers that include other chaotic systems than the QACM for strengthening the security level, ours is exclusively based on the QACM and is fast, despite the included high-dimensional QACM. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Eyebe Fouda, Jean Sire Armand | |
| dcterms.creator | Koepf, Wolfram | |
| dcterms.source.identifier | eissn:1573-7721 | |
| dcterms.source.issue | issue 23 | |
| dcterms.source.journal | Multimedia Tools and Applications | eng |
| dcterms.source.pageinfo | 34027-34046 | |
| dcterms.source.volume | Volume 81 | |
| kup.iskup | false |