Faster individual discrete logarithms in finite fields of composite extension degree
Work
Year: 2018
Type: article
Abstract: Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., $\rm {GF}(p^2)$, $\rm {GF}(p^{12})$) are the Numb... more
Source: Mathematics of Computation
Author Aurore Guillevic
Institution Computer Algorithms for Medicine
Cites: 49
Cited by: 9
Related to: 10
FWCI: 0.803
Citation percentile (by year/subfield): 74.78
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green