From chaotic maps to encryption schemes
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Relationship between cryptography and chaos theory, and similarities of their crucial concepts such as: mixing property, and sensitivity to changes in initial conditions and parameters are explained. An example of an encryption algorithm based on chaotic maps is presented.
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×
“In accordance with Shannon's prescriptions [l], every encryption algorithm possesses properties of confusion, diffusion, mixing and sensitivity to changes in plaintext and secret key.”
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
Cited by
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
“…ciphertext feedback) [Frey, 1993; Zhou & Ling, 1997b; Zhou & Feng, 2000; L¨u et al. , 2004]; • Block ciphers based on chaotic round function or S-boxes [Kocarev et al. , 1998; Guo et al. , 1999; Jakimoski & Kocarev, 2001; Papadimitriou et al. , 2001; Tang et al. , 2005]; • Block ciphers based…”
BackgroundAn image encryption scheme based on chaotic tent map
Li, C., Luo, G., Qin, K., & Li, C. (2017) · Nonlinear Dynamics · doi:10.1007/s11071-016-3030-8 · Cited by 497
A block cipher based on a suitable use of the chaotic standard map
Lian, S., Sun, J., & Wang, Z. (2005) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2004.11.096 · Cited by 412
“For example, a cryptosystem was proposed in [10,11] by directly discretizing the 2-D baker map, and the relationship between the original map and the discretized map was then discussed in [12].”
MethodCryptosystems with discretized chaotic maps
Masuda, N., & Aihara, K. (2002) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.974872 · Cited by 265
Image encryption process based on chaotic synchronization phenomena
Volos, C. K., Kyprianidis, I. M., & Stouboulos, I. N. (2013) · Signal Processing · doi:10.1016/j.sigpro.2012.11.008 · Cited by 257
Metadata
- Authors
- Kocarev, L., Jakimoski, G., Stojanovski, T., & Parlitz, U.
- Venue
- ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187)
- Publisher
- IEEE
- Published
- 2002-11-27
- Volume
- 4
- Pages
- 514-517
- ISSN
- 0271-4302 (ISSN-L)
- OpenAlex
- W2134891545
- Cited by
- 122
- References
- 2
- FWCI
- 1.61
- Type
- conference paper
- 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.