Efficient Exponentiation in GF(p m ) Using the Frobenius Map

DOI10.1007/11751632_64MaRDI QIDQ3601777zbMATH OpenOpenAlexFDO

Authors Mun-Kyu Lee, Howon Kim, Dowon Hong, Kyoil Chung

Publication date 12 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751632_64

zbMATH Keywords

cryptographyelliptic curvefinite fieldexponentiationoptimal extension field

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• scientific article; zbMATH DE number 4078798
• A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\)
• Efficient and optimal exponentiation in finite fields
• scientific article; zbMATH DE number 1796971
• Processor-efficient exponentiation in finite fields

Cited in

(4)

• scientific article; zbMATH DE number 5041296 (Why is no real title available?)
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
• Efficient and optimal exponentiation in finite fields
• Efficient Primitives from Exponentiation in ℤ p

This page was built for publication: Efficient Exponentiation in GF(p m ) Using the Frobenius Map

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