Adequate elliptic curves for computing the product of n pairings

DOI10.1007/978-3-319-55227-9_3zbMATH Open1409.94875OpenAlexW2604299953MaRDI QIDQ5267791FDOQ5267791

Authors: Loubna Ghammam, Emmanuel Fouotsa 

Publication date: 13 June 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-55227-9_3

Recommendations

• Analysis of optimum pairing products at high security levels
• Efficient optimal ate pairing at 128-bit security level
• Improving the computation of the optimal ate pairing for a high security level
• Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level
• Implementing pairings at the 192-bit security level

zbMATH Keywords

BN curvesoptimal ate pairingBLS curvesKSS16 curvesproduct of \(n\) pairingssubgroup attacks

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20)

Cites Work

• Short signatures from the Weil pairing
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Title not available (Why is that?)
• Efficient Identity-Based Encryption Without Random Oracles
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Pairing-Friendly Elliptic Curves of Prime Order
• Elliptic curves. Number theory and cryptography
• The Weil pairing, and its efficient calculation
• Faster hashing to \({\mathbb G}_2\)
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• The Eta Pairing Revisited
• Implementing pairings at the 192-bit security level
• The history of the LLL-algorithm
• Advances in Cryptology – CRYPTO 2004
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Identity-Based Encryption Gone Wild
• Topics in Cryptology – CT-RSA 2004
• Topics in Cryptology – CT-RSA 2005
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Title not available (Why is that?)
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• Analysis of Optimum Pairing Products at High Security Levels
• Subgroup Security in Pairing-Based Cryptography
• Adequate Elliptic Curves for Computing the Product of n Pairings

Cited In (5)

• Secure and Efficient Pairing at 256-Bit Security Level
• Hashing to elliptic curves of \(j\)-invariant 1728
• Updating key size estimations for pairings
• Beta Weil pairing revisited
• Adequate Elliptic Curves for Computing the Product of n Pairings

This page was built for publication: Adequate elliptic curves for computing the product of \(n\) pairings

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