Optimizing and securing GLV multiplication over BLS pairings-friendly curves
From MaRDI portal
Cites work
- A SIGNED BINARY MULTIPLICATION TECHNIQUE
- A taxonomy of pairing-friendly elliptic curves
- Advances in Cryptology - EUROCRYPT 2004
- An introduction to the use of zk-SNARKs in blockchains
- Constructing elliptic curves with prescribed embedding degrees
- Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
- Exponent Recoding and Regular Exponentiation Algorithms
- Exponentiating in pairing groups
- Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
- Faster point multiplication on elliptic curves with efficient endomorphisms
- Guide to pairing-based cryptography
- scientific article; zbMATH DE number 708817 (Why is no real title available?)
- scientific article; zbMATH DE number 7272516 (Why is no real title available?)
- scientific article; zbMATH DE number 3193698 (Why is no real title available?)
- Identity-based encryption from the Weil pairing
- Public Key Cryptography – PKC 2004
- Securing elliptic curve point multiplication against side-channel attacks
- The width-w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks
This page was built for publication: Optimizing and securing GLV multiplication over BLS pairings-friendly curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918229)