EUVIMEDEUVIMED entdecken
Crossref

Discrete logarithm problem over hyperelliptic curves : Computational complexity and cryptographic implications

Bijaya Sethi, Debanjana Prasad, Vivek Saraswat, Udita Goyal, Kasturi Rohini, Kartikkumar Patel

Journal of Discrete Mathematical Sciences and Cryptography · 31.10.2026 · 29 (10-C) · 4659-4669

DOI: 10.47974/jdmsc-3081 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences and Cryptography, online erschienen am 31.10.2026. Verfasst von Bijaya Sethi und 5 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Sethi, B., Prasad, D., Saraswat, V., Goyal, U., Rohini, K., & Patel, K. (2026). Discrete logarithm problem over hyperelliptic curves : Computational complexity and cryptographic implications. Journal of Discrete Mathematical Sciences and Cryptography, 29(10-C), 4659-4669. https://doi.org/10.47974/jdmsc-3081

Vancouver

Sethi B, Prasad D, Saraswat V, Goyal U, Rohini K, Patel K. Discrete logarithm problem over hyperelliptic curves : Computational complexity and cryptographic implications. Journal of Discrete Mathematical Sciences and Cryptography. 2026;29(10-C):4659-4669. doi:10.47974/jdmsc-3081

BibTeX
@article{Sethi2026,
  author = {Sethi, Bijaya and Prasad, Debanjana and Saraswat, Vivek and Goyal, Udita and Rohini, Kasturi and Patel, Kartikkumar},
  title = {Discrete logarithm problem over hyperelliptic curves : Computational complexity and cryptographic implications},
  journal = {Journal of Discrete Mathematical Sciences and Cryptography},
  year = {2026},
  volume = {29},
  number = {10-C},
  pages = {4659--4669},
  doi = {10.47974/jdmsc-3081}
}
Kostenlos starten →