The elliptic scalar multiplication graph and its application in elliptic curve cryptography
From MaRDI portal
Publication:5035840
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
Cites work
- scientific article; zbMATH DE number 3717339 (Why is no real title available?)
- An Introduction to Mathematical Cryptography
- Computational problems in supersingular elliptic curve isogenies
- Elliptic curves. Number theory and cryptography
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Fundamental circuits and cut-sets used in cryptography
- Graph theory with algorithms and its applications. In applied science and technology
- Handbook of graph theory
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)