Skip to main content
Springer Nature Link
Log in

ENR DigiSig: an efficient post-quantum digital signature scheme using polar codes

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

Digital signatures play a vital role in data security as they provide authenticity and non-repudiation of digital data. Code-based digital signatures are in high demand as quantum computers are extremely effective at breaking widely used digital signatures. The Courtois–Finiasz–Sendrier (CFS) scheme is one of the most popular code-based digital signature schemes. However, it has some disadvantages, such as a large public key size and poor signing efficiency. To address this issue, we construct a digital signature scheme named ENR DigiSig (Ekta Narwal and Rupali Digital Signature) using polar codes with several characteristics such as small signature size, low signing time, and high signing efficiency. Here, the hash of a shorter length is used in a specific way; then, padding is done to the hash output so that the result can be decoded. For this study, we have selected a fixed polar code rate of 0.5 and a blocklength of \(N=2^{n};n\leqslant 4\). According to the experimental results, more than 96% of the signatures are generated successfully.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability

Data used in this paper are openly available at locations cited in the reference section.

References

  1. Naser, S.M.: Cryptography: from the ancient history to now, it’s applications and a new complete numerical model. Int. J. Math. Stat. Stud. 9(3), 11–30 (2021). https://doi.org/10.13140/RG.2.2.13438.51524

    Article  MathSciNet  Google Scholar 

  2. Balamurugan, C., Singh, K., Ganesan, G., Rajarajan, M.: Post-quantum and code-based cryptography-some prospective research directions. Cryptography 5(4), 38 (2021)

    Article  Google Scholar 

  3. Valentijn, A.: Goppa Codes and Their Use in the McEliece Cryptosystems, Syracuse University Honors Program Capstone Projects, (2015)

  4. Vambol, A., Kharchenko, V., Potii, O.(2017) McEliece and Niederreiter Cryptosystems Analysis in the Context of Post-Quantum Network Security. In: 2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) (pp. 134-137). IEEE. https://doi.org/10.1109/MCSI.2017.31

  5. Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a mceliece-based digital signature scheme. Lecture Notes in Computer Science including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics 2248, 157–174 (2001). https://doi.org/10.1007/3-540-45682-1_10

    Article  MathSciNet  Google Scholar 

  6. Stern, J.: A new identification scheme based on syndrome decoding, Lecture Notes in Computer Science, Advances in Cryptology - CRYPTO’ 93 pp. 13-21, https://doi.org/10.1007/3-540-48329-2_2

  7. Kabatianskii, G., Krouk, E., Smeets, B.: A digital signature scheme based on random error-correcting codes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1355, 161–167 (1997). https://doi.org/10.1007/bfb0024461

  8. Zheng, D., Li, X., Chen, K. (2007) Code-based ring signature scheme. Int. J. Netw. Sec. 5(2), 154–157. DOI: https://doi.org/10.1.1.123.8085

  9. Alamélou, Q., Blazy, O., Cauchie, S., Gaborit, P.: A Code - Based Group Signature Scheme. In: The 9th International Workshop on Coding and Cryptography 2015 WCC2015, (2015)

  10. Gottesman, D., Chuang, I.L.: Quantum Digital Signatures, (2001)

  11. Lu, Y.-S., et al.: Efficient quantum digital signatures without symmetrization step. Opt. Exp. 29(7), 10162–10171 (2021). https://doi.org/10.1364/oe.420667

    Article  Google Scholar 

  12. Yin, H.L., et al.: Experimental quantum secure network with digital signatures and encryption. Natl Sci Rev 10(4), nwac228 (2023). https://doi.org/10.1093/nsr/nwac228

    Article  ADS  Google Scholar 

  13. Li, B.H., et al.: One-time universal hashing quantum digital signatures without perfect keys. Phys. Rev. Appl. 20(4), 044011 (2023). https://doi.org/10.1103/PhysRevApplied.20.044011

    Article  ADS  Google Scholar 

  14. Khurana, R., Narwal, E., Deepika, D.: Padding techniques for identifying decodable syndrome in post-quantum digital signature schemes. Indian J Sci Technol 16(48), 4638–4647 (2023). https://doi.org/10.17485/IJST/v16i48.1871

    Article  Google Scholar 

  15. Khurana, R., Narwal, E.: Analysis of code-based digital signature schemes. Int. J. Electric. Comput. Eng. (IJECE), 13(5), 5534–5541 (2023). https://doi.org/10.11591/ijece.v13i5.pp5534-5541

    Article  Google Scholar 

  16. El Kaime, I., Madi, A.A., Erguig, H.: A survey of polar codes,. 7th Mediterr. Congr. Telecommun. 2019, C. 2019C(2019), 1–7 (2019). https://doi.org/10.1109/CMT.2019.8931392

    Article  Google Scholar 

  17. Forghani, P., Shooshtari, M.K., Aref, M.R.: PolarSig: an efficient digital signature based on polar codes. IET Commun. 14(17), 2889–2897 (2020). https://doi.org/10.1049/iet-com.2019.0578

    Article  Google Scholar 

  18. Hooshmand, R., Jafari, A., Karamali, G.: Id-PC: an identification scheme based on polar codes. Inf. Sec. J. 32(4), 283–296 (2022). https://doi.org/10.1080/19393555.2021.2023239

    Article  Google Scholar 

  19. Arikan, E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theory 55(7), 3051–3073 (2009). https://doi.org/10.1109/TIT.2009.2021379

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The first author gratefully acknowledges the financial support from the “University Grant Commission (UGC), New Delhi, India."

Funding

The University Grant Commission, India, sponsored this research in terms of research scholarship.

Author information

Authors and Affiliations

  1. Department of Mathematics, M.D. University, Rohtak, India

    Rupali Khurana, Ekta Narwal & Sonika Ahlawat

Authors
  1. Rupali Khurana
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ekta Narwal
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Sonika Ahlawat
    View author publications

    You can also search for this author inPubMed Google Scholar

Contributions

Rupali Khurana helped in conceptualization, idea for the article, writing—original draft preparation, and investigation. Ekta Narwal was involved in supervision, writing—reviewing and editing, validation, and visualization. Sonika Ahlawat contributed to polar codes construction, reviewing, and editing.

Corresponding author

Correspondence to Ekta Narwal.

Ethics declarations

Conflicts of interest

There are no competing financial interests or personal relationships known to the authors that could have influenced their work. We have no relevant financial or non-financial interests to disclose.

Ethical approval

The authors of this article have not conducted any studies with human participants or animals.

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

Khurana, R., Narwal, E. & Ahlawat, S. ENR DigiSig: an efficient post-quantum digital signature scheme using polar codes. Quantum Inf Process 23, 259 (2024). https://doi.org/10.1007/s11128-024-04462-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-024-04462-2

Keywords

Mathematics Subject Classification