Abstract
Chebyshev map is a chaotic map frequently used in design of cryptography schemes and cryptosystems based on the hardness of the Chebyshev map-based discrete logarithm (CMDL) problem. The properties of Chebyshev map have great impact on the security of these cryptosystems. It has been known that the polynomial sequences generated by Chebyshev map defined on finite fields exhibit strong periodical features which may be utilized for cryptanalysis. This paper presents the periodical properties of Chebyshev polynomial sequences. Based on the properties, an improved cryptanalysis algorithm is proposed for the CMDL problem. It turns out that a chebyshev map-based cryptosystem using Chebyshev prime number as its modulus will have better security, where the Chebyshev prime number is defined as the prime number p satisfying that \((p\,{+}\,1)/2\) or \((p\,{-}\,1)/2\) is also a prime number. In support of cryptanalysis, fast algorithms to calculate the value of a Chebyshev polynomial and find the minimal period of a Chebyshev polynomial sequence are proposed, too. An example is given to show the process of cryptanalysis. Computational results have shown that only a small fraction of prime numbers are valid Chebyshev prime numbers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Deng, S., Huang, G., Chen, Z., Xiao, X.: Self-adaptive image encryption algorithm based on chaotic map. J. Comput. Appl. 31(6), 1502–1504 (2011)
Tseng, H.-R., Jan, R.-H., Yang, W.: A chaotic maps-based key agreement protocol that preserves user anonymity. In: IEEE ICC, pp. 850–855 (2009)
Li, C.-T., Lee, C.-C., Weng, C.-Y.: A secure chaotic maps and smart cards based password authentication and key agreement scheme with user anonymity for telecare medicine information systems. J. Med. Syst. 38, 77 (2014)
Shu, J.: An efficient three-party password-based key agreement protocol using extended chaotic maps. Chin. Phys. B 24(6), 060509 (2015)
Jangirala, S., Das, A.K., Wazid, M., Kumar, N.: Anonymous lightweight chaotic map-based authenticated key agreement protocol for industrial internet of things. IEEE Trans. Dependable Secure Comput. 17, 1133–1146 (2018)
Hao, X., Wang, J., Yang, Q., et al.: A chaotic map-based authentication scheme for telecare medicine information systems. J. Med. Syst. 37, 9919 (2013)
Chain, K., Chang, K.-H., Kuo, W.-C., Yang, J.-F.: Enhancement authentication protocol using zero-knowledge proofs and chaotic maps. Int. J. Commun. Syst. 30(1), e2945 (2017)
Roy, S., Chatterjee, S., Das, A.K., et al.: Chaotic map-based anonymous user authentication scheme with user biometrics and fuzzy extractor for crowdsourcing internet of things. IEEE Internet Things J. 5(4), 2884–2895 (2018)
Chatterjee, S., Roy, S., Das, A.K., et al.: Secure biometric-based authentication scheme using Chebyshev chaotic map for multi-server environment. IEEE Trans. Dependable Secure Comput. 15(5), 824–839 (2018)
Liu, W., Wang, X., Peng, W.: Secure remote multi-factor authentication scheme based on chaotic map zero-knowledge proof for crowdsourcing internet of things. IEEE Access 8(1), 8754–8767 (2020)
Hue, T.T.K., Hoang, T.M., Braeken, A.: Lightweight signcryption scheme based on discrete Chebyshev maps. In: 12th International Conference for Internet Technology and Secured Transactions (ICITST-2017) (2017)
Kocarev, L., Makraduli, J., Amato, P.: Public-key encryption based on Chebyshev polynomials. Circ. Syst. Signal Process. 24(5), 497–517 (2005)
Lima, J.B., Panario, D., de Souza, R.M.C.: Public-key encryption based on Chebyshev polynomials over GF(q). Inf. Process. Lett. 111, 51–56 (2010)
Lawnik, M., Kapczyński, A.: Application of modified Chebyshev polynomials in asymmetric cryptography. Comput. Sci. 20(3), 289–303 (2019)
Islam, S.H.: Identity-based encryption and digital signature schemes using extended chaotic maps (2014)
Liao, X., Chen, F., Wong, K.-W.: On the security of public-key algorithms based on Chebyshev polynomials over the finite field \(Z_N\). IEEE Trans. Comput. 59(10), 1392–1401 (2010)
Li, Z., Cui, Y., Jin, Y., Xu, H.: Parameter selection in public key cryptosystem based on Chebyshev polynomials over finite field. J. Commun. 6(5), 400–408 (2011)
Li, Z., Cui, Y., Xu, H.: Fast algorithms of public key cryptosystem based on Chebyshev polynomials over finite field. J. China Univ. Posts Telecommun. 18(2), 86–93 (2011)
Fu C., Zhang G.-Y., Gao B.-L., Sun J., Wang X.: A new color image encryption scheme based on chaotic hénon Map and lü System. In: SpaCCS 2017 (2017)
Bergamo, P., D’Arco, P., De Santis, A., Kocarev, L.: Security of public key cryptosystems based on Chebyshev polynomials. IEEE Trans. Circ. Syst. I 52(7), 1382–1393 (2005)
Yoshioka, D.: Properties of Chebyshev polynomials modulo \(p^{k}\). IEEE Trans. Circ. Syst.-II: Exp. Briefs 65(3), 386–390 (2018)
Yoshioka, D.: Security of public-key cryptosystems based on Chebyshev polynomials over \(\cal{Z}/p^{k}\cal{Z}\). IEEE Trans. Circ. Syst.-II: Exp. Briefs 67(10), 2204–2208 (2020)
Farash, M.S., Attari, M.A.: Cryptanalysis and improvement of a chaotic map-based key agreement protocol using Chebyshev sequence membership testing. Nonlinear Dyn. 76, 1203–1213 (2014)
Acknowledgments
This work was supported by the project from National Natural Science Foundation of China under grant no. 661702541.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Peng, W., Song, S., Liu, W. (2021). An Improved Cryptanalysis Algorithm for Chebyshev Map-Based Discrete Logarithm Problem. In: Wang, G., Chen, B., Li, W., Di Pietro, R., Yan, X., Han, H. (eds) Security, Privacy, and Anonymity in Computation, Communication, and Storage. SpaCCS 2020. Lecture Notes in Computer Science(), vol 12382. Springer, Cham. https://doi.org/10.1007/978-3-030-68851-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-68851-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-68850-9
Online ISBN: 978-3-030-68851-6
eBook Packages: Computer ScienceComputer Science (R0)