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

zbMATH Keywords

optimal pairingTate pairingordinary curvefinite field arithmeticBarreto-Naehrig curvebilinear pairing software implementation

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Theory of software (68N99)

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

Cited in

(22)

• Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
• Implicit zero-knowledge arguments and applications to the malicious setting
• A survey of elliptic curves for proof systems
• Parallelizing the Weil and Tate pairings
• An efficient self-blindable attribute-based credential scheme
• scientific article; zbMATH DE number 7746256 (Why is no real title available?)
• KDM security for the Fujisaki-Okamoto transformations in the QROM
• Memory-saving computation of the pairing final exponentiation on BN curves
• Attractive subfamilies of BLS curves for implementing high-security pairings
• Faster hashing to \({\mathbb G}_2\)
• Faster $\mathbb{F}_p$ -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves
• Pseudo 8–Sparse Multiplication for Efficient Ate–Based Pairing on Barreto–Naehrig Curve
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Beta Weil pairing revisited
• Barreto-Naehrig
• Storing and retrieving secrets on a blockchain
• An analysis of affine coordinates for pairing computation
• On the efficient implementation of pairing-based protocols
• Extended tower number field sieve: a new complexity for the medium prime case
• The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
• Efficient algorithms for secure outsourcing of bilinear pairings

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)