The parallel complexity of exponentiating polynomials over finite fields

DOI10.1145/44483.44496zbMath0652.68032MaRDI QIDQ3798223

Martin Tompa, Faith E. Fich

Publication date: 1988

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/44483.44496

zbMATH Keywords

parallel algorithm; algebraic complexity; polynomials over finite field; \(NC^ 2\); modular polynomial exponentiation

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

11T06: Polynomials over finite fields

12-04: Software, source code, etc. for problems pertaining to field theory

Related Items

Efficient and optimal exponentiation in finite fields