Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

DOI10.1007/978-3-642-13013-7_13zbMath1279.94079OpenAlexW1846967348MaRDI 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 cryptographyfinite field arithmetictorus-based cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (16)

Faster Hashing to ${\mathbb G}_2$ ⋮ Memory-saving computation of the pairing final exponentiation on BN curves ⋮ 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 ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ A survey of elliptic curves for proof systems ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves ⋮ Unnamed Item ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Updating key size estimations for pairings ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Point Decomposition Problem in Binary Elliptic Curves ⋮ Parallelizing the Weil and Tate Pairings ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings

This page was built for publication: Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions