High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
DOI10.1007/978-3-642-17455-1_2zbMATH Open1287.94054OpenAlexW2164960664MaRDI QIDQ3059638FDOQ3059638
Authors: Jean-Luc Beuchat, Jorge E. González-Díaz, Shigeo Mitsunari, Eiji Okamoto, Francisco Rodríguez-Henríquez, Tadanori Teruya 
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
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
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 (23)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- 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
- Memory-saving computation of the pairing final exponentiation on BN curves
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- Implementing Cryptographic Pairings over Barreto-Naehrig Curves
- Extended tower number field sieve: a new complexity for the medium prime case
- Implicit zero-knowledge arguments and applications to the malicious setting
- Title not available (Why is that?)
- An efficient self-blindable attribute-based credential scheme
- Faster $\mathbb{F}_p$ -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves
- A survey of elliptic curves for proof systems
- Parallelizing the Weil and Tate pairings
- Faster hashing to \({\mathbb G}_2\)
- Barreto-Naehrig
- Attractive subfamilies of BLS curves for implementing high-security pairings
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Beta Weil pairing revisited
- Storing and retrieving secrets on a blockchain
- An analysis of affine coordinates for pairing computation
- Efficient algorithms for secure outsourcing of bilinear pairings
- On the efficient implementation of pairing-based protocols
- Point Decomposition Problem in Binary Elliptic Curves
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)
