Efficient and optimal exponentiation in finite fields

DOI10.1007/BF01212964zbMath0788.68074MaRDI QIDQ685709

Joachim von zur Gathen

Publication date: 10 October 1993

Published in: Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

finite fieldarithmetic circuitsefficient exponentiation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (11)

Computing special powers in finite fields ⋮ Applying quick exponentiation for block upper triangular matrices ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ Processor-efficient exponentiation in finite fields ⋮ Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm ⋮ A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices ⋮ On Orders of Optimal Normal Basis Generators ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ Parallelizing the Weil and Tate Pairings ⋮ Algorithms for exponentiation in finite fields ⋮ Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm

Cites Work

• Unnamed Item
• On the length of word chains
• Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field
• Processor-efficient exponentiation in finite fields
• Inversion in finite fields using logarithmic depth
• Boolean circuits versus arithmetic circuits
• Constructing normal bases in finite fields
• Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• Computing Powers in Parallel
• The parallel complexity of exponentiating polynomials over finite fields

This page was built for publication: Efficient and optimal exponentiation in finite fields