Lower bounds on the linear complexity of the discrete logarithm in finite fields
Work
Year: 2001
Type: article
Authors Wilfried Meidl, Arne Winterhof
Institution Austrian Academy of Sciences
Cites: 16
Cited by: 24
Related to: 10
FWCI: 3.168
Citation percentile (by year/subfield): 85.69
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed