Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

DOI10.1007/978-3-642-13013-7_13zbMath1279.94079MaRDI QIDQ3562897

No author found.

Publication date: 28 May 2010

Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_13

zbMATH Keywords

pairing-based cryptography; finite field arithmetic; torus-based cryptography

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

Related Items

Unnamed Item, A survey of elliptic curves for proof systems, Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves, Memory-saving computation of the pairing final exponentiation on BN curves, Scalable zero knowledge via cycles of elliptic curves, Choosing and generating parameters for pairing implementation on BN curves, Updating key size estimations for pairings, LOVE a pairing, Families of SNARK-friendly 2-chains of elliptic curves, Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation, Point Decomposition Problem in Binary Elliptic Curves, Faster Hashing to ${\mathbb G}_2$, Subgroup Security in Pairing-Based Cryptography, An Analysis of Affine Coordinates for Pairing Computation, Parallelizing the Weil and Tate Pairings, Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings