Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
From MaRDI portal
Publication:3578473
DOI10.1007/978-3-642-13797-6_13zbMath1245.11122MaRDI 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
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11G20: Curves over finite and local fields
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Scalable zero knowledge via cycles of elliptic curves, Accelerated tower arithmetic, Explicit factorization of \(X^{2^m}p^n-1\) over a finite field, Point Decomposition Problem in Binary Elliptic Curves, Subgroup Security in Pairing-Based Cryptography, An Analysis of Affine Coordinates for Pairing Computation, On the Efficient Implementation of Pairing-Based Protocols, Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings, Efficient Implementation of Bilinear Pairings on ARM Processors