High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
DOI10.1007/978-3-642-17455-1_2zbMATH Open1287.94054OpenAlexW2164960664MaRDI QIDQ3059638FDOQ3059638
Jean-Luc Beuchat, Eiji Okamoto, Shigeo Mitsunari, Francisco Rodríguez-Henríquez, Tadanori Teruya, Jorge E. González-Díaz
Publication date: 26 November 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17455-1_2
optimal pairingTate pairingordinary curvefinite field arithmeticBarreto-Naehrig curvebilinear pairing software implementation
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Theory of software (68N99)
Cited In (20)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- On the Efficient Implementation of Pairing-Based Protocols
- An Efficient Self-blindable Attribute-Based Credential Scheme
- Pseudo 8–Sparse Multiplication for Efficient Ate–Based Pairing on Barreto–Naehrig Curve
- Storing and Retrieving Secrets on a Blockchain
- Memory-saving computation of the pairing final exponentiation on BN curves
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- Title not available (Why is that?)
- A survey of elliptic curves for proof systems
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Barreto-Naehrig
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Beta Weil pairing revisited
- Efficient algorithms for secure outsourcing of bilinear pairings
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting
- Parallelizing the Weil and Tate Pairings
- Faster Hashing to ${\mathbb G}_2$
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
- Point Decomposition Problem in Binary Elliptic Curves
- An Analysis of Affine Coordinates for Pairing Computation
Recommendations
- The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets 👍 👎
- Pseudo 8–Sparse Multiplication for Efficient Ate–Based Pairing on Barreto–Naehrig Curve 👍 👎
- Speeding Up Ate Pairing Computation in Affine Coordinates 👍 👎
- An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication 👍 👎
- Improving the computation of the optimal ate pairing for a high security level 👍 👎
- Faster Ate pairing computation on Selmer's model of elliptic curves 👍 👎
- Parallel Implementation of Curvilinear High-order Formulas 👍 👎
- Optimised Versions of the Ate and Twisted Ate Pairings 👍 👎
- Reduction Optimal Trinomials for Efficient Software Implementation of the η T Pairing 👍 👎
- Solving 114-bit ECDLP for a Barreto-Naehrig curve 👍 👎
This page was built for publication: High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059638)
