Fast simultaneous scalar multiplication
From MaRDI portal
Publication:990540
Recommendations
- Elliptic curve scalar multiplication algorithm using complementary recoding
- scientific article; zbMATH DE number 1941262
- scientific article; zbMATH DE number 2219248
- scientific article; zbMATH DE number 2085210
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
Cites work
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- A SIGNED BINARY MULTIPLICATION TECHNIQUE
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology – CRYPTO 2004
- Elliptic Curve Cryptosystems
- Elliptic curve cryptosystems and their implementation
- Elliptic curve scalar multiplication algorithm using complementary recoding
Cited in
(7)- Approximate computation of scalar products
- Optimizing memory cost of multi-scalar multiplication
- scientific article; zbMATH DE number 2085210 (Why is no real title available?)
- Fast multiplication and sparse structures
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication
- scientific article; zbMATH DE number 1941262 (Why is no real title available?)
- scientific article; zbMATH DE number 7272516 (Why is no real title available?)
This page was built for publication: Fast simultaneous scalar multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990540)