Pairing inversion for finding discrete logarithms
From MaRDI portal
Publication:2515203
DOI10.1007/s10958-015-2349-xzbMath1357.94063OpenAlexW2057562740MaRDI QIDQ2515203
Publication date: 31 July 2015
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-015-2349-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prime chains and Pratt trees
- On a problem of Oppenheim concerning Factorisatio Numerorum
- A note on the Tate pairing of curves over finite fields
- On the complexity of computing gröbner bases for quasi-homogeneous systems
- Pairing Lattices
- The Hidden Root Problem
- Aspects of Pairing Inversion
- Every Prime Has a Succinct Certificate
- On waiting time in the scheme of random allocation of coloured particies
- Optimal Pairings
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
This page was built for publication: Pairing inversion for finding discrete logarithms