IEEE Transactions on Information Theory · 1990 · 61 citations · 8 references
ComputingComputer ScienceMathematicsCombinatoricsCryptographyTheory Of ComputationAlgebraic Number TheoryNumber-theoretic AlgorithmsAlgebraic Number Field ComputationsApplications In CryptographyArithmetic Of Finite FieldsComputational Galois TheoryDiscrete Logarithm AlgorithmsDiscrete Logarithm ProblemElliptic Curve Arithmetic
Some properties of Zech's logarithms are stated and exploited to compute Zech's logarithms from a restricted set of key elements. Zech's logarithms are recommended for the fast solution of quadratic, cubic, and quartic equations over GF(2/sup m/).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
8
Some connections between nonuniform and uniform complexity classes
Richard M. Karp, Richard J. Lipton · 1980 · 582 citations · Full text