Faster squaring in the cyclotomic subgroup of sixth degree extensions
From MaRDI portal
Publication:3562897
Recommendations
Cited in
(18)- A survey of elliptic curves for proof systems
- Updating key size estimations for pairings
- Parallelizing the Weil and Tate pairings
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Memory-saving computation of the pairing final exponentiation on BN curves
- Attractive subfamilies of BLS curves for implementing high-security pairings
- Faster hashing to \({\mathbb G}_2\)
- Scalable zero knowledge via cycles of elliptic curves
- LOVE a pairing
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Secure and Efficient Pairing at 256-Bit Security Level
- Subgroup security in pairing-based cryptography
- An analysis of affine coordinates for pairing computation
- scientific article; zbMATH DE number 5831613 (Why is no real title available?)
- Choosing and generating parameters for pairing implementation on BN curves
- Pairings in rank-1 constraint systems
- Families of SNARK-friendly 2-chains of elliptic curves
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
This page was built for publication: Faster squaring in the cyclotomic subgroup of sixth degree extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562897)