Adequate Elliptic Curves for Computing the Product of n Pairings
From MaRDI portal
Publication:5267791
DOI10.1007/978-3-319-55227-9_3zbMATH Open1409.94875OpenAlexW2604299953MaRDI QIDQ5267791FDOQ5267791
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Short signatures from the Weil pairing
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Pairing-Friendly Elliptic Curves of Prime Order
- 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
- 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)
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)
