Efficient parallel exponentiation in using normal basis representations

DOI10.1016/J.JALGOR.2004.06.005MaRDI QIDQ4652411zbMATH OpenOpenAlexFDO

Authors Mun-Kyu Lee, Yoonjeong Kim, Yookun Cho, Kunsoo Park

Publication date 22 February 2005

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.06.005

zbMATH Keywords

CryptographyExponentiationFinite fieldNormal basis representationParallel algorithm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
• Processor-efficient exponentiation in finite fields
• Polynomial and normal bases for finite fields
• Some remarks on parallel exponentiation (extended abstract)
• Arithmetic operations in \(GF(2^ m)\)

Cited in

(4)

• Processor-efficient exponentiation in finite fields
• Some remarks on parallel exponentiation (extended abstract)
• Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
• Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm

This page was built for publication: Efficient parallel exponentiation in using normal basis representations

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