Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$

DOI10.1137/0219049zbMath0697.68049OpenAlexW101018159MaRDI QIDQ3474890

Douglas R. Stinson

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

finite fieldparallel algorithmexponentiationnormal basis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Constructing normal bases in finite fields, Computing special powers in finite fields, Processor-efficient exponentiation in finite fields, Efficient and optimal exponentiation in finite fields, On Orders of Optimal Normal Basis Generators, Algorithms for exponentiation in finite fields