Computing Logarithms in Finite Fields of Characteristic Two

DOI10.1137/0605029MaRDI QIDQ3320493zbMATH OpenOpenAlexWikidataFDO

Authors Ryoh Fuji-Hara, Ronald C. Mullin, Scott A. Vanstone, Ian Blake

Publication date 1984

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0605029

zbMATH Keywords

algorithmcharacteristic twocomputation of logarithmEuclidean algorithmprimitive element of finite field

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Fast evaluation of logarithms in fields of characteristic two
• scientific article; zbMATH DE number 3918261
• Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
• A subexponential-time algorithm for computing discrete logarithms over \(\mathrm{GF}(p^2)\)
• scientific article; zbMATH DE number 3863322
• On asymptotic complexity of computing discrete logarithms over GF(p)
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Discrete logarithms in \(\mathrm{GF}(p)\)
• A polynomial form for logarithms modulo a prime (Corresp.)
• Lifting of solutions of an exponential congruence

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Algebraic coding theory
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• scientific article; zbMATH DE number 3586931 (Why is no real title available?)
• New directions in cryptography

Cited in

(27)

• On computing logarithms over GF(2**p)
• Computation of discrete logarithms in prime fields
• Computational problems in the theory of finite fields
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
• A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms
• Complexity of a determinate algorithm for the discrete logarithm
• Faster initial splitting for small characteristic composite extension degree fields
• Koblitz curves over quadratic fields
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• The index calculus method using non-smooth polynomials
• Analysis of Rabin's irreducibility test for polynomials over finite fields
• Some comments on Zech's logarithms
• scientific article; zbMATH DE number 3882551 (Why is no real title available?)
• Fast evaluation of logarithms in fields of characteristic two
• A polynomial form for logarithms modulo a prime (Corresp.)
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• scientific article; zbMATH DE number 3918261 (Why is no real title available?)
• scientific article; zbMATH DE number 4035941 (Why is no real title available?)
• Solving equations in finite fields and some results concerning the structure of GF(p/sup m/)
• Computation of low-weight parity checks for correlation attacks on stream ciphers
• Faster individual discrete logarithms in finite fields of composite extension degree
• A polynomial representation for logarithms in GF(q)
• The generalized Weil pairing and the discrete logarithm problem on elliptic curves
• Individual discrete logarithm with sublattice reduction
• Utilizing two subfields to accelerate individual logarithm computation in extended tower number field sieve
• Guest editorial: Special issue in honor of Scott A. Vanstone
• Finding shortest lattice vectors faster using quantum search

This page was built for publication: Computing Logarithms in Finite Fields of Characteristic Two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320493)