Parallelizing the Weil and Tate pairings
From MaRDI portal
Curves over finite and local fields (11G20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Network protocols (68M12) Parallel algorithms in computer science (68W10)
Recommendations
- High-speed parallel software implementation of the \(\eta_{T}\) pairing
- Implementing pairings at the 192-bit security level
- New Software Speed Records for Cryptographic Pairings
- The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
- Faster explicit formulae for computing pairings via elliptic nets and their parallel computation
Cites work
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Advances in Cryptology - EUROCRYPT 2004
- Ate Pairing on Hyperelliptic Curves
- Compact hardware for computing the Tate pairing over 128-bit-security supersingular curves
- Cryptography and Coding
- Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
- ECC2K-130 on Cell CPUs
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Efficient and optimal exponentiation in finite fields
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- Efficient pairing computation on supersingular abelian varieties
- Efficient software implementation of binary field arithmetic using vector instruction sets
- Faster $\mathbb{F}_p$ -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves
- Faster explicit formulas for computing pairings over ordinary curves
- Faster pairing computations on curves with high-degree twists
- Faster squaring in the cyclotomic subgroup of sixth degree extensions
- Five, six, and seven-term Karatsuba-like formulae
- FPGA implementation of pairings using residue number system and lazy reduction
- High-speed parallel software implementation of the \(\eta_{T}\) pairing
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- scientific article; zbMATH DE number 5532069 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1406771 (Why is no real title available?)
- Integer Variable χ–Based Ate Pairing
- Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
- New Software Speed Records for Cryptographic Pairings
- On Software Parallel Implementation of Cryptographic Pairings
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Optimal Pairings
- Pairing Lattices
- Pairing-Friendly Elliptic Curves of Prime Order
- Pairings for cryptographers
- Selected Areas in Cryptography
- The Eta Pairing Revisited
- The Weil pairing, and its efficient calculation
Cited in
(9)- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- Beta Weil pairing revisited
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
- On Software Parallel Implementation of Cryptographic Pairings
- Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
- Implementing pairings at the 192-bit security level
- High-speed parallel software implementation of the \(\eta_{T}\) pairing
- EAGL: an elliptic curve arithmetic GPU-based library for bilinear pairing
This page was built for publication: Parallelizing the Weil and Tate pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104701)
