root@x71c9:~$ navigated to thesis
COMPUTATIONAL MODELS FOR CALCULATING THE DISCRETE LOGARITHM
Abstract
Given a primitive element γ of a finite field GF(q), the discrete logarithm of a nonzero element ω ∈ GF(q) is the smallest integer x such that ω = γx.
Given a primitive element γ of a finite field GF(q), the discrete logarithm of a nonzero element ω ∈ GF(q) is the smallest integer x such that ω = γx.
"You have no idea how much poetry there is in calculating a table of logarithms" - Carl Friedrich Gauss
Click on the canvas to see more
