Efficient scalar multiplication algorithms on elliptic curves over prime fields for resource-constrained cryptographic devices
Journal of Discrete Mathematical Sciences and Cryptography · 31.10.2026 · 29 (10-B) · 4397-4406
DOI: 10.47974/jdmsc-3060 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences and Cryptography, online erschienen am 31.10.2026. Verfasst von M. Reddy und 5 weiteren Autor:innen.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Reddy, M., Hasan, F., Gupta, S., Chaudhary, S., Pawar, M. S., & Islam, S. (2026). Efficient scalar multiplication algorithms on elliptic curves over prime fields for resource-constrained cryptographic devices. Journal of Discrete Mathematical Sciences and Cryptography, 29(10-B), 4397-4406. https://doi.org/10.47974/jdmsc-3060
Vancouver
Reddy M, Hasan F, Gupta S, Chaudhary S, Pawar MS, Islam S. Efficient scalar multiplication algorithms on elliptic curves over prime fields for resource-constrained cryptographic devices. Journal of Discrete Mathematical Sciences and Cryptography. 2026;29(10-B):4397-4406. doi:10.47974/jdmsc-3060
BibTeX
@article{Reddy2026,
author = {Reddy, M. and Hasan, Fazil and Gupta, Shivangi and Chaudhary, Shivam and Pawar, Manisha Sagar and Islam, Shaziya},
title = {Efficient scalar multiplication algorithms on elliptic curves over prime fields for resource-constrained cryptographic devices},
journal = {Journal of Discrete Mathematical Sciences and Cryptography},
year = {2026},
volume = {29},
number = {10-B},
pages = {4397--4406},
doi = {10.47974/jdmsc-3060}
}
EUVIMED