The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Cryptosystems with discretized chaotic maps
Abstract
Many kinds of chaotic cryptosystems have been proposed. Chaotic systems dissipate information due to orbital instability with positive Lyapunov exponents and ergodicity. If these properties are appropriately utilized, chaotic cryptosystems are supposed to realize high security. However, most of the existing secure communication techniques using chaos do not have enough security. For example, secure communication protocols based on chaos synchronization require robustness which gives useful information to attackers. The cryptosystems based on direct applications of chaotic maps have been weak against linear and differential cryptoanalysis. In this paper, a new kind of chaotic cryptosystem which overcomes these difficulties to some extent is proposed. The cryptosystem is based on a discretization of the skew tent map. We also show some of the desirable properties of the proposed cryptosystem using dynamical characteristics. These properties regarding ciphertext randomness may be closely related to the cryptological security. Our new cryptosystem uses one step to connect the theory of commonly used cryptosystems and dynamical system theory.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,320
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
Circuit implementation of synchronized chaos with applications to communications
Cuomo, K. M., & Oppenheim, A. V. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.65 · Cited by 1,729
The art of computer programming. Vol.2: Seminumerical algorithms
Knuth, D. E. (1981) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,232
Synchronization of Lorenz-based chaotic circuits with applications to communications
Cuomo, K. M., Oppenheim, A. V., & Strogatz, S. H. (1993) · IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing · doi:10.1109/82.246163 · Cited by 1,104
Dedieu, H., Kennedy, M. P., & Hasler, M. (1993) · IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing · doi:10.1109/82.246164 · Cited by 829
EXPERIMENTAL DEMONSTRATION OF SECURE COMMUNICATIONS VIA CHAOTIC SYNCHRONIZATION
KOCAREV, L., HALLE, K. S., ECKERT, K., CHUA, L. O., & PARLITZ, U. (1992) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127492000823 · Cited by 760
Extracting Messages Masked by Chaos
Pérez, G., & Cerdeira, H. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.1970 · Cited by 505
Periodic points and measures for Axiom $A$ diffeomorphisms
Bowen, R. (1971) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1971-0282372-0 · Cited by 405
STEPS TOWARD UNMASKING SECURE COMMUNICATIONS
SHORT, K. M. (1994) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749400068x · Cited by 339
Statistics of chaotic binary sequences
Kohda, T., & Tsuneda, A. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.567654 · Cited by 275
A Secret Key Cryptosystem by Iterating a Chaotic Map
Habutsu, T., Nishio, Y., Sasase, I., & Mori, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_11 · Cited by 268
Chaotic digital encoding: an approach to secure communication
Frey, D. R. (1993) · IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing · doi:10.1109/82.246168 · Cited by 226
UNMASKING A MODULATED CHAOTIC COMMUNICATIONS SCHEME
SHORT, K. M. (1996) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127496000114 · Cited by 218
DESIGN OF ONE-DIMENSIONAL CHAOTIC MAPS WITH PRESCRIBED STATISTICAL PROPERTIES
BARANOVSKY, A., & Daems, D. (1995) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127495001198 · Cited by 153
Discrete-time chaotic encryption systems. I. Statistical design approach
Götz, M., Kelber, K., & Schwarz, W. (1997) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.633885 · Cited by 125
From chaotic maps to encryption schemes
Kocarev, L., Jakimoski, G., Stojanovski, T., & Parlitz, U. (2002) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.1998.698968 · Cited by 122
Arithmetical properties of strongly chaotic motions
Percival, I. C., & Vivaldi, F. (1987) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(87)90096-0 · Cited by 106
Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT’91
Biham, E. (2007) · Springer eBooks · doi:10.1007/3-540-46416-6_49 · Cited by 86
Kotulski, Z., & Szczepański, J. (1997) · Annalen der Physik · doi:10.1002/andp.19975090504 · Cited by 75
Finite dimensional generalized baker dynamical systems for cryptographic applications
Pichler, F. R., & Scharinger, J. (1996) · Lecture notes in computer science · doi:10.1007/bfb0034782 · Cited by 57
Is every approximate trajectory of some process near an exact trajectory of a nearby process?
Nusse, H. E., & Yorke, J. A. (1988) · Communications in Mathematical Physics · doi:10.1007/bf01242136 · Cited by 54
Discrete-time chaotic encryption systems. III. Cryptographical analysis
Dachselt, F., Kelber, K., & Schwarz, W. (1998) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.721265 · Cited by 42
Cryptanalysis of Cryptosystems based on Remote Chaos Replication
Beth, T., Lazic, D. E., & Mathias, A. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_30 · Cited by 35
Secure communication with chaotic systems of difference equations
Papadimitriou, S. T., Bezerianos, A., & Bountis, T. (1997) · IEEE Transactions on Computers · doi:10.1109/12.559800 · Cited by 32
DYNAMICAL CHARACTERISTICS OF DISCRETIZED CHAOTIC PERMUTATIONS
Masuda, N., & Aihara, K. (2002) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127402005686 · Cited by 19
Self-citationKolmogorov systems: Internal time, irreversibility and cryptographic applications
Scharinger, J. (1998) · AIP conference proceedings · doi:10.1063/1.56321 · Cited by 6
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
Chaos-based cryptography: a brief overview
Kocarev, L. (2001) · IEEE Circuits and Systems Magazine · doi:10.1109/7384.963463 · Cited by 901
A NOVEL FAST IMAGE ENCRYPTION SCHEME BASED ON 3D CHAOTIC BAKER MAPS
MAO, Y., CHEN, G., & LIAN, S. (2004) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812740401151x · Cited by 611
A symmetric image encryption algorithm based on mixed linear–nonlinear coupled map lattice
Zhang, Y.-Q., & Wang, X.-Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.02.156 · Cited by 566
An 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
Metadata
- Authors
- Masuda, N., & Aihara, K.
- Venue
- IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
- Published
- 2002
- Volume
- 49
- Issue
- 1
- Pages
- 28-40
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2166934960
- Cited by
- 265
- References
- 27
- FWCI
- 11.23
- 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.