Closed formulae for the Weil pairing inversion
From MaRDI portal
Publication:938771
DOI10.1016/j.ffa.2007.12.003zbMath1175.11028OpenAlexW2051494591MaRDI QIDQ938771
Publication date: 27 August 2008
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2007.12.003
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Elliptic curves over local fields (11G07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof for explicit formulas for discrete logarithms in finite fields
- Elliptic curves with low embedding degree
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- The Weil pairing, and its efficient calculation
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- A note on the Tate pairing of curves over finite fields
- The Weil pairing and the Hilbert symbol
- Polynomial approximation of bilinear Diffie-Hellman maps
- A polynomial form for logarithms modulo a prime (Corresp.)
- On Polynomial Interpolations related to Verheul Homomorphisms
- The Eta Pairing Revisited
- A polynomial representation for logarithms in GF(q)
- Hyperelliptic Pairings
- On the Minimal Embedding Field
- Simplified pairing computation and security implications
- Coding and Cryptography
- Advances in Cryptology - ASIACRYPT 2003