Parallelizing the Weil and Tate Pairings
From MaRDI portal
Publication:3104701
DOI10.1007/978-3-642-25516-8_17zbMath1279.11115OpenAlexW54640647MaRDI QIDQ3104701
Francisco Rodríguez-Henríquez, Diego F. Aranha, Edward Knapp, Alfred J. Menezes
Publication date: 16 December 2011
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25516-8_17
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Network protocols (68M12)
Related Items
Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree ⋮ Beta Weil pairing revisited ⋮ The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient and optimal exponentiation in finite fields
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- Pairings for cryptographers
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- The Weil pairing, and its efficient calculation
- Efficient pairing computation on supersingular abelian varieties
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
- FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Five, six, and seven-term Karatsuba-like formulae
- The Eta Pairing Revisited
- ECC2K-130 on Cell CPUs
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
- Faster Pairing Computations on Curves with High-Degree Twists
- New Software Speed Records for Cryptographic Pairings
- Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets
- Pairing Lattices
- Integer Variable χ–Based Ate Pairing
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Faster $\mathbb{F}_p$ -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves
- Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
- On Software Parallel Implementation of Cryptographic Pairings
- Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Optimal Pairings
- High-Speed Parallel Software Implementation of the η T Pairing
- Advances in Cryptology - EUROCRYPT 2004
- Pairing-Friendly Elliptic Curves of Prime Order
- Ate Pairing on Hyperelliptic Curves
- Selected Areas in Cryptography
- Cryptography and Coding
