Open Access
Research Article·pp. 4509–4520·Vol. 29, Issue 10-COct 2026
Complexity bounds for NP-hard problems in cryptography
Monika Patil, D. Sathis Kumar, Gagan Tiwari, Vinod S. Sapkal, Jyotsna Suryavanshi, Sanjiv Kumar Shukla
Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3069
In this paper: The complexity bounds of NP-hard problems are one of the main topics in modern cryptography, where the security of a scheme is frequently based on the intractability of the computations. This paper ex...
