The elliptic scalar multiplication graph and its application in elliptic curve cryptography
DOI10.1080/09720529.2021.1932896zbMATH Open1483.94032OpenAlexW3204961289WikidataQ114099777 ScholiaQ114099777MaRDI QIDQ5035840FDOQ5035840
Authors: Karrar Taher R. Aljamaly, Ruma Kareem K. Ajeena
Publication date: 22 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2021.1932896
Recommendations
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication
- A new secure and efficient elliptic curve cryptosystem
- A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
- Speeding up the computations of elliptic curves cryptoschemes
- A new hybrid encryption scheme
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Cryptography (94A60) Elliptic curves (14H52)
Cites Work
- Elliptic curves. Number theory and cryptography
- Handbook of graph theory
- Expander graphs based on GRH with an application to elliptic curve cryptography
- An Introduction to Mathematical Cryptography
- Title not available (Why is that?)
- Computational problems in supersingular elliptic curve isogenies
- Fundamental circuits and cut-sets used in cryptography
- Graph theory with algorithms and its applications. In applied science and technology
Cited In (2)
This page was built for publication: The elliptic scalar multiplication graph and its application in elliptic curve cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5035840)