Fixed argument pairing inversion on elliptic curves
From MaRDI portal
Publication:499662
DOI10.1007/s10623-014-9993-xzbMath1329.94068OpenAlexW2018129383MaRDI QIDQ499662
Publication date: 30 September 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9993-x
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Weil pairing, and its efficient calculation
- The Eta Pairing Revisited
- Pairing Lattices
- The Hidden Root Problem
- Aspects of Pairing Inversion
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Optimal Pairings
- Approach to Pairing Inversions Without Solving Miller Inversion
- Advances in Cryptology – CRYPTO 2004
- An Analysis of the Vector Decomposition Problem
- Advances in Elliptic Curve Cryptography
This page was built for publication: Fixed argument pairing inversion on elliptic curves