Processor-efficient exponentiation in finite fields

DOI10.1016/0020-0190(92)90259-XzbMath0762.68026WikidataQ126989339 ScholiaQ126989339MaRDI QIDQ1186580

Joachim von zur Gathen

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmsefficiencyfinite fieldcryptographyfinite field arithmeticparallel exponentiation

Mathematics Subject Classification ID

Cryptography (94A60) Finite fields and commutative rings (number-theoretic aspects) (11T99) Parallel numerical computation (65Y05) Distributed algorithms (68W15)

Related Items (5)

Parallel modular exponentiation using load balancing without precomputation ⋮ On quasilinear-time complexity theory ⋮ Efficient and optimal exponentiation in finite fields ⋮ An algorithm for modular exponentiation. ⋮ Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient and optimal exponentiation in finite fields
• On the length of word chains
• 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)
• Architectures for exponentiation in GF(2n)

This page was built for publication: Processor-efficient exponentiation in finite fields