Open AccessAsymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
Author(s) -
Gabrielle De Micheli,
Pierrick Gaudry,
Cécile Pierrot
Publication year - 2020
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - discrete logarithm , logarithm , pairing , finite field , algorithm , computer science , mathematics , discrete mathematics , mathematical analysis , physics , quantum mechanics , encryption , public key cryptography , superconductivity , operating system