Login / Signup
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields.
Gabrielle De Micheli
Pierrick Gaudry
Cécile Pierrot
Published in:
IACR Cryptol. ePrint Arch. (2020)
Keyphrases
</>
data structure
computational cost
benchmark datasets
orders of magnitude
significant improvement
continuous domains
data sets
neural network
search engine
objective function
computationally efficient