Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
From MaRDI portal
Publication:2889998
DOI10.1007/978-3-642-27954-6_7zbMath1292.94021OpenAlexW2164985605MaRDI QIDQ2889998
Jérémie Detrey, Diego F. Aranha, Jean-Luc Beuchat, Nicolas Estibals
Publication date: 8 June 2012
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-27954-6_7
Related Items
Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$ ⋮ A survey of fault attacks in pairing based cryptography ⋮ New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 ⋮ Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- Pairings for cryptographers
- Using abelian varieties to improve pairing-based cryptography
- Constructive and destructive facets of Weil descent on elliptic curves
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- 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
- Parallelizing the Weil and Tate Pairings
- Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication
- FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
- High Speed Cryptoprocessor for η T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields
- TATE PAIRING COMPUTATION ON THE DIVISORS OF HYPERELLIPTIC CURVES OF GENUS 2
- The Eta Pairing Revisited
- On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
- New Software Speed Records for Cryptographic Pairings
- Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets
- Pairing Lattices
- Distortion maps for supersingular genus two curves
- Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
- Computing in the Jacobian of a Hyperelliptic Curve
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- Efficient Pairing Computation with Theta Functions
- Optimal Pairings
- High-Speed Parallel Software Implementation of the η T Pairing
- Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Pairing-Friendly Elliptic Curves of Prime Order
- Ate Pairing on Hyperelliptic Curves
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Cryptography and Coding
- Algorithmic Number Theory
This page was built for publication: Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
