Cryptanalysis of a one round chaos-based Substitution Permutation Network
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
The interleaving of chaos and cryptography has been the aim of a large set of works since the beginning of the nineties. Many encryption proposals have been introduced to improve conventional cryptography. However, many of possess serious problems according to the basic requirements for the secure exchange of information. In this paper we highlight some of the main problems of chaotic cryptography by means of the analysis of a very recent chaotic cryptosystem based on a one round Substitution Permutation Network. More specifically, we show that it is not possible to avoid the security problems of that encryption architecture just by including a chaotic system as the core of the derived encryption system. Highlights? The security problems of one round Substitution Permutation Networks are discussed. ? The problems of considering unimodal maps as the core of cryptosystems are analysed. ? The cryptanalysis of an specific permutation-only cipher is performed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“The plinth of cryptography is built upon the properties of confusion and diffusion as stated by Shannon in 1949 [1], which can be linked to the main characteristics of chaotic systems: ergodicity and sensitivity to control parameters and initial conditions.”
BackgroundAccuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119 · cited 3×
“In this flavour, our recommendation is on the line of the set of rules given in [13, 8, 2].”
BackgroundSymmetric Ciphers Based on Two-Dimensional Chaotic Maps
Fridrich, J. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749800098x · Cited by 1,917 · cited 1×
“A very important family of chaotic cryptosystems is the one inheriting the characteristics of the Substitution-Permutation Networks (SPNs), as it is explained in [3].”
BackgroundBaptista, M. S. (1998) · Physics Letters A · doi:10.1016/s0375-9601(98)00086-3 · Cited by 885
A novel colour image encryption algorithm based on chaos
Wang, X., Teng, L., & Qin, X. (2012) · Signal Processing · doi:10.1016/j.sigpro.2011.10.023 · Cited by 715 · cited 10×
“For the sake of clarity, we have first modified the notation used in [7] and second divided the encryption method into four stages (see Fig.”
BackgroundMethodInfluentialLi, S., Li, C., Chen, G., Bourbakis, N. G., & Lo, K.-T. (2008) · Signal Processing: Image Communication · doi:10.1016/j.image.2008.01.003 · Cited by 339 · cited 1×
“Once the substitution keystream B and the selection vector S have been obtained, it is possible to reconstruct the input of the shuffling procedures according to [21, 23] 1 .”
MethodCRYPTANALYSIS OF FRIDRICH'S CHAOTIC IMAGE ENCRYPTION
SOLAK, E., ÇOKAL, C., YILDIZ, O. T., & BIYIKOĞLU, T. (2010) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127410026563 · Cited by 215
Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
Li, C., & Lo, K.-T. (2011) · Signal Processing · doi:10.1016/j.sigpro.2010.09.014 · Cited by 213 · cited 3×
“As it is commented in [21], the fact that Eq.”
BackgroundMethodA new compound mode of confusion and diffusion for block encryption of image based on chaos
Wang, X.-Y., Chen, F., & Wang, T. (2010) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2009.10.001 · Cited by 105
Cited by
A new 1D chaotic system for image encryption
Zhou, Y., Bao, L., & Chen, C. L. P. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.10.034 · Cited by 859
“But, they also have three problems including: (1) the limited or/and discontinuous range of chaotic behaviors [32, 33]; (2) the vulnerability to low-computation-cost analysis using iteration and correlation functions [34]; and (3) the nonuniform data distribution of output chaotic sequences.”
Background2D Sine Logistic modulation map for image encryption
Hua, Z., Zhou, Y., Pun, C.-M., & Chen, C. L. P. (2015) · Information Sciences · doi:10.1016/j.ins.2014.11.018 · Cited by 777
A new color image encryption using combination of the 1D chaotic map
Pak, C., & Huang, L. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.03.011 · Cited by 632
A novel bit-level image encryption algorithm based on 2D-LICM hyperchaotic map
Cao, C., Sun, K., & Liu, W. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.08.020 · Cited by 385
A new color image encryption scheme based on DNA sequences and multiple improved 1D chaotic maps
Wu, X., Kan, H., & Kurths, J. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.08.008 · Cited by 335
Metadata
- Authors
- Arroyo, D., Diaz, J., & Rodriguez, F. B.
- Venue
- Signal Processing
- Publisher
- Elsevier BV
- Published
- 2013-05
- Volume
- 93
- Issue
- 5
- Pages
- 1358-1364
- ISSN
- 0165-1684 (ISSN-L)
- OpenAlex
- W1995946569
- Cited by
- 108
- References
- 10
- FWCI
- 6.56
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.