Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography

DOI10.1007/978-3-642-13797-6_13zbMath1245.11122OpenAlexW2159868780MaRDI QIDQ3578473

No author found.

Publication date: 20 July 2010

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

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

zbMATH Keywords

pairing-based cryptosystemsextension fieldspairing implementationEuler's conjectures

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (9)

Efficient Implementation of Bilinear Pairings on ARM Processors ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Explicit factorization of \(X^{2^m}p^n-1\) over a finite field ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Point Decomposition Problem in Binary Elliptic Curves ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings ⋮ Accelerated tower arithmetic

This page was built for publication: Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography