The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Security of public-key cryptosystems based on Chebyshev polynomials
Open accessAbstract
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper, we study a public-key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis, it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries if the cryptosystem is used for signing messages. Then, we point out that also other primitives, a Diffie-Hellman like key agreement scheme and an authentication scheme, designed along the same lines of the cryptosystem, are not secure due to the aforementioned attack. We close the paper by discussing the issues and the possibilities of constructing public-key cryptosystems on real numbers.
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
Handbook of Mathematical Functions
McQuarrie, D. A. (1966) · American Journal of Physics · doi:10.1119/1.1972842 · Cited by 40,433
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Synchronization in chaotic systems
Pecora, L. M., & Carroll, T. L. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.821 · Cited by 10,625
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Whittaker, E. T., & Watson, G. N. (2021) · Cambridge University Press eBooks · doi:10.1017/9781009004091 · Cited by 6,850
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
Cryptography: Theory and Practice
Stinson, D. R. (1995) · Cited by 2,743
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Introduction to algorithms: 4. Turtle graphics
Shyamasundar, R. K. (1996) · Resonance · doi:10.1007/bf02837777 · Cited by 1,467
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
Cryptography: Theory and practice
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90225-2 · Cited by 1,367
Hathaway, A. S. (1903) · Journal of the American Chemical Society · doi:10.1021/ja02004a022 · Cited by 1,115
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
The random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
Cramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 978
Chaos-based cryptography: a brief overview
Kocarev, L. (2001) · IEEE Circuits and Systems Magazine · doi:10.1109/7384.963463 · Cited by 901
Self-citationThe random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
Dachselt, F., & Schwarz, W. (2001) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/tcsi.2001.972857 · Cited by 314
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
A fast chaotic cryptographic scheme with dynamic look-up table
Wong, K. W. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)00431-0 · Cited by 199
Public-key encryption based on Chebyshev maps
Kocarev, L., & Tasev, Z. (2003) · Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03. · doi:10.1109/iscas.2003.1204947 · Cited by 195
Self-citationControlling Chaos: Theoretical and Practical Methods in Non-linear Dynamics
Kapitaniak, T. (1996) · Cited by 111
Analyses and New Designs of Digital Chaotic Ciphers
Li, S. (2003) · Surrey Research Insight Open Access (The University of Surrey) · Cited by 88
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
Method of constructing exactly solvable chaos
Umeno, K. (1997) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.55.5280 · Cited by 72
APPLICATION OF DISCRETE CHAOTIC DYNAMICAL SYSTEMS IN CRYPTOGRAPHY — DCC METHOD
Kotulski, Z., Szczepański, J., Górski, K., Paszkiewicz, A., & Zugaj, A. (1999) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127499000778 · Cited by 64
Secret sharing over infinite domains
Chor, B., & Kushilevitz, E. (1993) · Journal of Cryptology · doi:10.1007/bf02620136 · Cited by 39
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
Jacobian elliptic Chebyshev rational maps
Kohda, T., & Fujisaki, H. (2001) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(00)00184-6 · Cited by 33
Using Chebyshev chaotic map to construct infinite length hash chains
Xiao, D., Liao, X., Tang, G., & Li, C. (2004) · International Conference on Communications, Circuits and Systems · doi:10.1109/icccas.2004.1345928 · Cited by 13
Cited by
Cryptanalysis of the public key encryption based on multiple chaotic systems
Zhang, L. (2008) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2006.09.047 · Cited by 322
Qiu, S., Wang, D., Xu, G., & Kumari, S. (2020) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2020.3022797 · Cited by 224
Sine-transform-based chaotic system with FPGA implementation
Hua, Z., Zhou, B., & Zhou, Y. (2018) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2017.2736515 · Cited by 180
Metadata
- Authors
- Bergamo, P., D'Arco, P., De Santis, A., & Kocarev, L.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2005-07
- Volume
- 52
- Issue
- 7
- Pages
- 1382-1393
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2105709923
- Cited by
- 316
- References
- 37
- FWCI
- 8.59
- 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.