EUVIMEDEUVIMED entdecken
Crossref

Investigation of expander graph families for designing highperformance cryptographic hash functions

Suraj Bhan, M. Rao, Frederick Correa, Shobhit Goyal, Kamineni Sairam, Vikram Patel

Journal of Discrete Mathematical Sciences and Cryptography · 31.10.2026 · 29 (10-C) · 4705-4718

DOI: 10.47974/jdmsc-3085 ↗

Kurz gefasst

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

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Bhan, S., Rao, M., Correa, F., Goyal, S., Sairam, K., & Patel, V. (2026). Investigation of expander graph families for designing highperformance cryptographic hash functions. Journal of Discrete Mathematical Sciences and Cryptography, 29(10-C), 4705-4718. https://doi.org/10.47974/jdmsc-3085

Vancouver

Bhan S, Rao M, Correa F, Goyal S, Sairam K, Patel V. Investigation of expander graph families for designing highperformance cryptographic hash functions. Journal of Discrete Mathematical Sciences and Cryptography. 2026;29(10-C):4705-4718. doi:10.47974/jdmsc-3085

BibTeX
@article{Bhan2026,
  author = {Bhan, Suraj and Rao, M. and Correa, Frederick and Goyal, Shobhit and Sairam, Kamineni and Patel, Vikram},
  title = {Investigation of expander graph families for designing highperformance cryptographic hash functions},
  journal = {Journal of Discrete Mathematical Sciences and Cryptography},
  year = {2026},
  volume = {29},
  number = {10-C},
  pages = {4705--4718},
  doi = {10.47974/jdmsc-3085}
}
Kostenlos starten →