Datum
2022-04-21Schlagwort
510 Mathematik ChiffrierungArnolʹd, V. I.InformationssicherheitChaostheorieComputerarithmetikMetadata
Zur Langanzeige
Aufsatz
An 8-bit precision cipher for fast image encryption
Zusammenfassung
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.
Zitierform
In: Multimedia Tools and Applications Volume 81 / issue 23 (2022-04-21) , S. 34027-34046 ; eissn:1573-7721Förderhinweis
Gefördert im Rahmen des Projekts DEALZitieren
@article{doi:10.17170/kobra-202209226884,
author={Eyebe Fouda, Jean Sire Armand and Koepf, Wolfram},
title={An 8-bit precision cipher for fast image encryption},
journal={Multimedia Tools and Applications},
year={2022}
}
0500 Oax 0501 Text $btxt$2rdacontent 0502 Computermedien $bc$2rdacarrier 1100 2022$n2022 1500 1/eng 2050 ##0##http://hdl.handle.net/123456789/14161 3000 Eyebe Fouda, Jean Sire Armand 3010 Koepf, Wolfram 4000 An 8-bit precision cipher for fast image encryption / Eyebe Fouda, Jean Sire Armand 4030 4060 Online-Ressource 4085 ##0##=u http://nbn-resolving.de/http://hdl.handle.net/123456789/14161=x R 4204 \$dAufsatz 4170 5550 {{Chiffrierung}} 5550 {{Arnolʹd, V. I.}} 5550 {{Informationssicherheit}} 5550 {{Chaostheorie}} 5550 {{Computerarithmetik}} 7136 ##0##http://hdl.handle.net/123456789/14161
2022-09-22T14:45:21Z 2022-09-22T14:45:21Z 2022-04-21 doi:10.17170/kobra-202209226884 http://hdl.handle.net/123456789/14161 Gefördert im Rahmen des Projekts DEAL eng Namensnennung 4.0 International http://creativecommons.org/licenses/by/4.0/ chaos multimedia encryption information security 510 An 8-bit precision cipher for fast image encryption Aufsatz 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. open access Eyebe Fouda, Jean Sire Armand Koepf, Wolfram doi:10.1007/s11042-022-12368-3 Chiffrierung Arnolʹd, V. I. Informationssicherheit Chaostheorie Computerarithmetik publishedVersion eissn:1573-7721 issue 23 Multimedia Tools and Applications 34027-34046 Volume 81 false
Die folgenden Lizenzbestimmungen sind mit dieser Ressource verbunden: