Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
From MaRDI portal
Publication:2889998
DOI10.1007/978-3-642-27954-6_7zbMATH Open1292.94021OpenAlexW2164985605MaRDI QIDQ2889998FDOQ2889998
Authors: Diego F. Aranha, Jean-Luc Beuchat, Jérémie Detrey, 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
Recommendations
- Pairing Calculation on Supersingular Genus 2 Curves
- Supersingular hyperelliptic curves of genus 2 over finite fields
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
- Pairings on hyperelliptic curves
- Faster pairing computation on genus \(2\) hyperelliptic curves
- Omega pairing on hyperelliptic curves
- scientific article; zbMATH DE number 705079
- Ate Pairing on Hyperelliptic Curves
- 2‐Selmer parity for hyperelliptic curves in quadratic extensions
- Information Security and Cryptology - ICISC 2003
Cites Work
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- Faster explicit formulas for computing pairings over ordinary curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pairing-Friendly Elliptic Curves of Prime Order
- Computing in the Jacobian of a Hyperelliptic Curve
- Efficient pairing computation with theta functions
- The Weil pairing, and its efficient calculation
- Efficient pairing computation on supersingular abelian varieties
- Title not available (Why is that?)
- The Eta Pairing Revisited
- Pairing Lattices
- Optimal Pairings
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Algorithmic Number Theory
- Pairings for cryptographers
- Reducing elliptic curve logarithms to logarithms in a finite field
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Ate Pairing on Hyperelliptic Curves
- Cryptography and Coding
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Title not available (Why is that?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- Constructive and destructive facets of Weil descent on elliptic curves
- Efficient software implementation of binary field arithmetic using vector instruction sets
- Using abelian varieties to improve pairing-based cryptography
- Distortion maps for supersingular genus two curves
- FPGA implementation of pairings using residue number system and lazy reduction
- TATE PAIRING COMPUTATION ON THE DIVISORS OF HYPERELLIPTIC CURVES OF GENUS 2
- New Software Speed Records for Cryptographic Pairings
- Parallelizing the Weil and Tate pairings
- On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings
- Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
- Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
- High speed cryptoprocessor for \(\eta _{T }\) pairing on 128-bit secure supersingular elliptic curves over characteristic two fields
- High-speed parallel software implementation of the \(\eta_{T}\) pairing
- Compact hardware for computing the Tate pairing over 128-bit-security supersingular curves
Cited In (9)
- Pairing Calculation on Supersingular Genus 2 Curves
- Distortion maps for supersingular genus two curves
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- 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
- A survey of fault attacks in pairing based cryptography
- Compact hardware for computing the Tate pairing over 128-bit-security supersingular curves
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
- Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$
Uses Software
This page was built for publication: Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889998)
