Efficient and optimal exponentiation in finite fields

DOI10.1007/BF01212964zbMATH Open0788.68074MaRDI QIDQ685709FDOQ685709

Joachim von zur Gathen

Publication date: 10 October 1993

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

Recommendations

• Processor-efficient exponentiation in finite fields
• scientific article; zbMATH DE number 1246620
• Computing special powers in finite fields
• scientific article; zbMATH DE number 2077085
• Efficient Exponentiation in GF(p m ) Using the Frobenius Map

zbMATH Keywords

arithmetic circuitsfinite fieldefficient exponentiation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (19)

• The parallel complexity of exponentiating polynomials over finite fields
• An Algorithm for Computing Optimal Exponent Pairs
• On Orders of Optimal Normal Basis Generators
• Algorithms for exponentiation in finite fields
• Applying quick exponentiation for block upper triangular matrices
• Processor-efficient exponentiation in finite fields
• A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices
• Polynomial Evaluation and Side Channel Analysis
• Low-cost addition-subtraction sequences for the final exponentiation in pairings
• Title not available (Why is that?)
• Parallelizing the Weil and Tate Pairings
• Efficient Finite Fields in the Maxima Computer Algebra System
• Message encoding and retrieval for spread and cyclic orbit codes
• Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
• Title not available (Why is that?)
• Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
• Efficient Primitives from Exponentiation in ℤ p
• Efficient Exponentiation in GF(p m ) Using the Frobenius Map
• Computing special powers in finite fields

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

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