Chaotic block ciphers: from theory to practical algorithms
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Digital chaotic ciphers have been investigated for more than a decade. However, their overall performance in terms of the tradeoff between security and speed, as well as the connection between chaos and cryptography, has not been sufficiently addressed. We propose a chaotic Feistel cipher and a chaotic uniform cipher. Our plan is to examine crypto components from both dynamical-system and cryptographical points of view, thus to explore connection between these two fields. In the due course, we also apply dynamical system theory to create cryptographically secure transformations and evaluate cryptographical security measures.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Applied cryptography: Protocols, algorithms, and source code in C
(1994) · Computer Law & Security Report · doi:10.1016/0267-3649(94)90017-5 · Cited by 3,411
Symmetric 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 2×
“The idea of chaotic block ciphers is centered around the use of modified chaotic maps in this purpose [4], [8]–[15].”
Background
Cited by
CRYPTANALYSIS 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
Implementation and practical problems of chaos-based cryptography revisited
Teh, J. S., Alawida, M., & Sii, Y. C. (2020) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2019.102421 · Cited by 104
Cheng, C.-J., & Cheng, C.-B. (2013) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2013.02.011 · Cited by 36
Cryptanalysis and security improvement for a symmetric color image encryption algorithm
Hoang, T. M., & Thanh, H. X. (2018) · Optik · doi:10.1016/j.ijleo.2017.10.072 · Cited by 30
Efficient and secure message authentication algorithm at the physical layer
Noura, H. N., Melki, R., Chehab, A., & Hernandez Fernandez, J. (2024) · Wireless Networks · doi:10.1007/s11276-020-02371-7 · Cited by 10
Novel one round message authentication scheme for constrained IoT devices
Noura, H. N., Salman, O., Couturier, R., & Chehab, A. (2022) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-021-02913-7 · Cited by 7
Metadata
- Authors
- Masuda, N., Jakimoski, G., Aihara, K., & Kocarev, L.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2006-06
- Volume
- 53
- Issue
- 6
- Pages
- 1341-1352
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2101411296
- Cited by
- 112
- References
- 3
- FWCI
- 4.31
- Type
- journal article
- Language
- en
- Open access
- closed
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.