Complexity bounds for NP-hard problems in cryptography
Journal of Discrete Mathematical Sciences and Cryptography · 31.10.2026 · 29 (10-C) · 4509-4520
DOI: 10.47974/jdmsc-3069 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences and Cryptography, online erschienen am 31.10.2026. Verfasst von Monika Patil und 5 weiteren Autor:innen.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Patil, M., Kumar, D., Tiwari, G., Sapkal, V., Suryavanshi, J., & Shukla, S. (2026). Complexity bounds for NP-hard problems in cryptography. Journal of Discrete Mathematical Sciences and Cryptography, 29(10-C), 4509-4520. https://doi.org/10.47974/jdmsc-3069
Vancouver
Patil M, Kumar D, Tiwari G, Sapkal V, Suryavanshi J, Shukla S. Complexity bounds for NP-hard problems in cryptography. Journal of Discrete Mathematical Sciences and Cryptography. 2026;29(10-C):4509-4520. doi:10.47974/jdmsc-3069
BibTeX
@article{Patil2026,
author = {Patil, Monika and Kumar, D. and Tiwari, Gagan and Sapkal, Vinod and Suryavanshi, Jyotsna and Shukla, Sanjiv},
title = {Complexity bounds for NP-hard problems in cryptography},
journal = {Journal of Discrete Mathematical Sciences and Cryptography},
year = {2026},
volume = {29},
number = {10-C},
pages = {4509--4520},
doi = {10.47974/jdmsc-3069}
}
EUVIMED