Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
Department of Electrical Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
Department of Electrical Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
Springer Nature
pub.1044654632
dimensions_id
978-3-540-15658-1
Advances in Cryptology
978-3-540-39568-3
algorithm
feasible algorithm
base
generator
https://doi.org/10.1007/3-540-39568-7_8
logarithm
base α
discrete logarithm problem
true
field
integers x
elements
nonzero elements
logarithm problem
finite field
https://scigraph.springernature.com/explorer/license/
Consider the finite field having q elements and denote it by GF(q). Let α be a generator for the nonzero elements of GF(q). Hence, for any element b≠0 there exists an integer x, 0≤x≤q−2, such that b=αx. We call x the discrete logarithm of b to the base α and we denote it by x=logαb and more simply by log b when the base is fixed for the discussion. The discrete logarithm problem is stated as follows:Find a computationally feasible algorithm to compute logαb for any b∈GF(q), b≠0.
chapter
log B
73-82
problem
GF
1985
1985-01-01
q elements
2022-11-24T21:15
Computing Logarithms in GF (2n)
chapters
discussion
discrete logarithm
doi
10.1007/3-540-39568-7_8
S. A.
Vanstone
Blake
I. F.
Blakley
George Robert
Computation Theory and Mathematics
Chaum
David
R. C.
Mullin
Springer Nature - SN SciGraph project
Information and Computing Sciences