Constructing tower extensions of finite fields for implementation of pairing-based cryptography

DOI10.1007/978-3-642-13797-6_13MaRDI QIDQ3578473zbMATH OpenOpenAlexFDO

Authors

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

Euler's conjecturesextension fieldspairing implementationpairing-based cryptosystems

Mathematics Subject Classification ID

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

Recommendations

• Implementing cryptographic pairings
• On efficient pairings on elliptic curves over extension fields
• The tower number field sieve
• Efficient implementation of pairing-based cryptosystems
• scientific article; zbMATH DE number 1942431

Cited in

(11)

• Scalable zero knowledge via cycles of elliptic curves
• Accelerated tower arithmetic
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
• Tower building technique on elliptic curve with embedding degree 18
• 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
• scientific article; zbMATH DE number 5066607 (Why is no real title available?)
• Transparent SNARKs over Galois rings

This page was built for publication: Constructing tower extensions of finite fields for implementation of pairing-based cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578473)