Skip to main content

Advertisement

Log in

A digital signature scheme based on general Chebyshev polynomial

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Despite the operational efficiency and lower computational costs of public key cryptography based on the Chebyshev polynomial compared to elliptic curve cryptography (ECC), the digital signature schemes based on the Chebyshev polynomial have not been widely applied. The primary obstacle includes its short period characteristic and coefficient fixation issue, which makes cryptosystems vulnerable to exhaustive attacks. To enhance the resistance of cryptosystems to the exhaustive attack, the general Chebyshev polynomial (GCP) is developed in this paper. It still possesses the semigroup property that public key cryptosystems rely on and provides an optional parameter that improves its complexity and pluralism. A novel digital signature scheme with reduced design complexity and enhanced security based on GCP is proposed. Theoretical analyses and experimental results show that this digital signature scheme offers more advantages in terms of both security and efficiency than existing schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4
Fig. 1

Similar content being viewed by others

Data availability

Not applicable.

References

  1. Wang Y, Wong K-W, Liao X, Chen G (2011) A new chaos-based fast image encryption algorithm. Appl Soft Comput 11(1):514–522

    Article  MATH  Google Scholar 

  2. Man Z, Li J, Di X, Sheng Y, Liu Z (2021) Double image encryption algorithm based on neural network and chaos. Chaos, Solitons Fractals 152:111318

    Article  MathSciNet  MATH  Google Scholar 

  3. Alawida M (2023) A novel chaos-based permutation for image encryption. J King Saud Univ-Comput Inf Sci 35(6):101595

    MATH  Google Scholar 

  4. Ayubi P, Setayeshi S, Rahmani AM (2023) Chaotic complex hashing: a simple chaotic keyed hash function based on complex quadratic map. Chaos, Solitons Fractals 173:113647

    Article  MathSciNet  MATH  Google Scholar 

  5. Teh JS, Alawida M, Ho JJ (2020) Unkeyed hash function based on chaotic sponge construction and fixed-point arithmetic. Nonlinear Dyn 100(1):713–729

    Article  MATH  Google Scholar 

  6. Han S (2008) Security of a key agreement protocol based on chaotic maps. Chaos, Solitons Fractals 38(3):764–768

    Article  MathSciNet  MATH  Google Scholar 

  7. Yoon E-J, Jeon I-S (2011) An efficient and secure diffie-hellman key agreement protocol based on chebyshev chaotic map. Commun Nonlinear Sci Numerical Simul 16(6):2383–2389

    Article  MathSciNet  MATH  Google Scholar 

  8. Shaqbou’a R, Tahat N, Ababneh O, Al-Hazaimeh OM (2022) Chaotic map and quadratic residue problems-based hybrid signature scheme. International Journal for Computers & Their Applications 29(4)

  9. Abbasinezhad-Mood D, Ostad-Sharif A, Mazinani SM, Nikooghadam M (2020) Provably secure escrow-less chebyshev chaotic map-based key agreement protocol for vehicle to grid connections with privacy protection. IEEE Trans Indus Inf 16(12):7287–7294

    Article  Google Scholar 

  10. Abbasinezhad-Mood D, Nikooghadam M (2018) Efficient anonymous password-authenticated key exchange protocol to read isolated smart meters by utilization of extended chebyshev chaotic maps. IEEE Trans Indus Inf 14(11):4815–4828

    MATH  Google Scholar 

  11. Wang C, Li X, Ma M, Zhou T, Xu G, Xiong N, Zhang Y (2023) Psak: a provably secure authenticated key agreement scheme based on extended chebyshev chaotic maps for smart grid environments. Trans Emerg Telecommun Technol 34(5):4752. https://doi.org/10.1002/ett.4752

    Article  MATH  Google Scholar 

  12. Deebak BD, Hwang SO (2023) A cloud-assisted medical cyber-physical system using a privacy-preserving key agreement framework and a chebyshev chaotic map. IEEE Systems Journal

  13. Xiao D, Liao X, Wei P (2009) Analysis and improvement of a chaos-based image encryption algorithm. Chaos, Solitons Fractals 40(5):2191–2199. https://doi.org/10.1016/j.chaos.2007.10.009

    Article  MathSciNet  MATH  Google Scholar 

  14. Kocarev L, Tasev Z (2003) Public-key encryption based on chebyshev maps. In: Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS’03., vol. 3, p. IEEE

  15. Bergamo P, D’Arco P, De Santis A, Kocarev L (2005) Security of public-key cryptosystems based on chebyshev polynomials. IEEE Trans. Circuits Syst I: Regular Papers 52(7):1382–1393

    Article  MathSciNet  MATH  Google Scholar 

  16. Kocarev L, Makraduli J, Amato P (2005) Public-key encryption based on chebyshev polynomials. Circuits Syst Signal Proc 24:497–517

    Article  MathSciNet  MATH  Google Scholar 

  17. Liao X, Chen F, Wong K-W (2010) On the security of public-key algorithms based on chebyshev polynomials over the finite field \(z_n\). IEEE Trans Comput 59(10):1392–1401

    Article  MathSciNet  MATH  Google Scholar 

  18. Wang C, Li X, Ma M, Zhou T, Xu G, Xiong N, Zhang Y (2023) Psak: a provably secure authenticated key agreement scheme based on extended chebyshev chaotic maps for smart grid environments. Trans Emerg Telecommun Technol 34(5):4752

    Article  MATH  Google Scholar 

  19. Deebak BD, Hwang SO (2023) A cloud-assisted medical cyber-physical system using a privacy-preserving key agreement framework and a chebyshev chaotic map. IEEE Systems Journal

  20. Qiao H, Dong X, Jiang Q, Ma S, Liu C, Xi N, Shen Y (2023) Anonymous lightweight authenticated key agreement protocol for fog-assisted healthcare iot system. IEEE Int Things J 10(19):16715–16726

    Article  Google Scholar 

  21. Zhang L, Zhu Y, Ren W, Wang Y, Choo K-KR, Xiong NN (2021) An energy-efficient authentication scheme based on chebyshev chaotic map for smart grid environments. IEEE Int Things J 8(23):17120–17130

    Article  Google Scholar 

  22. Zheng Y, Hu S, Wei L, Chen Y, Wang H, Yang Y, Li Y, Xu B, Huang W, Chen L (2020) Design and analysis of a security-enhanced three-party authenticated key agreement protocol based on chaotic maps. IEEE Access 8:66150–66162

    Article  MATH  Google Scholar 

  23. Cui J, Wang Y, Zhang J, Xu Y, Zhong H (2020) Full session key agreement scheme based on chaotic map in vehicular ad hoc networks. IEEE Trans Vehicular Technol 69(8):8914–8924

    Article  MATH  Google Scholar 

  24. Chain K, Kuo W-C (2013) A new digital signature scheme based on chaotic maps. Nonlinear Dyn 74:1003–1012

    Article  MathSciNet  MATH  Google Scholar 

  25. Tahat N, Hijazi MS (2019) A new digital signature scheme based on chaotic maps and quadratic residue problems. Appl Math Inf Sci 13(1):115–120

    Article  MathSciNet  MATH  Google Scholar 

  26. Tahat N, Ismail ES (2018) Improvement of signature scheme based on factoring and chaotic maps. Int J Electron Security Digital Forensics 10(2):155–167

    Article  MATH  Google Scholar 

  27. Meshram C, Ibrahim RW, Obaid AJ, Meshram SG, Meshram A, Abd El-Latif AM (2021) Fractional chaotic maps based short signature scheme under human-centered iot environments. J Adv Res 32:139–148

    Article  MATH  Google Scholar 

  28. Meshram C, Lee C-C, Meshram SG, Meshram A (2020) Oos-sss: an efficient online/offline subtree-based short signature scheme using chebyshev chaotic maps for wireless sensor network. IEEE Access 8:80063–80073

    Article  MATH  Google Scholar 

  29. Xiao D, Liao X, Deng S (2007) A novel key agreement protocol based on chaotic maps. Inf Sci 177(4):1136–1142

    Article  MathSciNet  MATH  Google Scholar 

  30. Bergamo P, D’Arco P, De Santis A, Kocarev L (2005) Security of public-key cryptosystems based on chebyshev polynomials. IEEE Trans Circuits SystI: Regular Papers 52(7):1382–1393

    Article  MathSciNet  MATH  Google Scholar 

  31. Fee GJ (2004) Cryptography using chebyshev polynomials. In: Maple Summer Workshop, Burnaby, Canada https://api.semanticscholar.org/CorpusID:12590062

  32. Zhang L (2008) Cryptanalysis of the public key encryption based on multiple chaotic systems. Chaos, Solitons Fractals 37(3):669–674

    Article  MathSciNet  MATH  Google Scholar 

  33. Roy S, Chatterjee S, Das AK, Chattopadhyay S, Kumari S, Jo M (2017) Chaotic map-based anonymous user authentication scheme with user biometrics and fuzzy extractor for crowdsourcing internet of things. IEEE Int Things J 5(4):2884–2895

    Article  Google Scholar 

  34. Abbasinezhad-Mood D, Nikooghadam M (2018) Efficient anonymous password-authenticated key exchange protocol to read isolated smart meters by utilization of extended chebyshev chaotic maps. IEEE Trans Indus Inf 14(11):4815–4828

    MATH  Google Scholar 

  35. Bellare M, Neven G (2006) Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 390–399

  36. Thomas K (2005) Elementary number theory with applications. Elsevier

  37. Bellare M, Rogaway P (1993) Random oracles are practical. In: Proceedings of the 1st ACM Conference on Computer and Communications Security - CCS ’93 . https://doi.org/10.1145/168588.168596

  38. Meshram C, Obaidat MS, Tembhurne JV, Shende SW, Kalare KW, Meshram SG (2020) A lightweight provably secure digital short-signature technique using extended chaotic maps for human-centered iot systems. IEEE Syst J 15(4):5507–5515

    Article  MATH  Google Scholar 

  39. Johnson D, Menezes A, Vanstone S (2001) The elliptic curve digital signature algorithm (ecdsa). Int J Inf Security 1:36–63

    Article  MATH  Google Scholar 

  40. ElGamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theor 31(4):469–472

    Article  MathSciNet  MATH  Google Scholar 

  41. Tahat N, Shatnawi MT, Shatnawi S, Ababneh O, Al-Hazaimeh OM (2022) A signature algorithm based on chaotic maps and factoring problems. J Discrete Math Sci Cryptography 25(8):2783–2794

    Article  MATH  Google Scholar 

  42. Li Z-H, Cui Y-D, Xu H-M (2011) Fast algorithms of public key cryptosystem based on chebyshev polynomials over finite field. The J China Univ Posts Telecommun 18(2):86–93

    Article  MATH  Google Scholar 

  43. Toradmalle D, Singh R, Shastri H, Naik N, Panchidi V (2018) Prominence of ecdsa over rsa digital signature algorithm. In: 2018 2nd International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud)(I-SMAC) I-SMAC (IoT in Social, Mobile, Analytics and Cloud)(I-SMAC), 2018 2nd International Conference On, pp. 253–257 . IEEE

Download references

Acknowledgements

The authors gratefully acknowledge the anonymous reviewers for their constructive comments. This work is supported in part by Gansu Provincial Science and Technology Plan Project Foundation (No.22YF7GA006), the Fundamental Research Funds for the Central Universities of China (No. lzujbky-2022-pd12), Talent Project of Gansu Province, China, and the National Key Research and Development Program of China (No.2021ZD0111405). All authors have read and agreed to the published version of the manuscript.

Author information

Authors and Affiliations

Authors

Contributions

S.L. and R.M. wrote the main manuscript text. J.Z. prepared the software validation, and J.H. and Y.S. contributed to the formal analysis and investigation. Z.Y. supervised the methodology and project administration, while Y.Y. reviewed and edited the manuscript. All authors reviewed the manuscript.

Corresponding authors

Correspondence to Rudong Min or Zhen Yang.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest to this work.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, S., Min, R., Zhang, J. et al. A digital signature scheme based on general Chebyshev polynomial. J Supercomput 81, 595 (2025). https://doi.org/10.1007/s11227-025-07074-4

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11227-025-07074-4

Keywords