Paper 2019/800
Can we Beat the Square Root Bound for ECDLP over via Representations?
Claire Delaplace and Alexander May
Abstract
We give a 4-list algorithm for solving the Elliptic Curve Discrete Logarithm (ECDLP) over some quadratic field
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. NuTMiC 2019
- Keywords
- ECDLP
- Contact author(s)
- claire delaplace @ rub de
- History
- 2019-07-14: received
- Short URL
- https://ia.cr/2019/800
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/800, author = {Claire Delaplace and Alexander May}, title = {Can we Beat the Square Root Bound for {ECDLP} over $\mathbb{F}_{p^2}$ via Representations?}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/800}, year = {2019}, url = {https://eprint.iacr.org/2019/800} }