Exponentiation in finite fields: theory and practice

DOI10.1007/3-540-63163-1_8MaRDI QIDQ4470462zbMATH OpenFDO

Authors Joachim von zur Gathen, Michael Nöcker

Publication date 1 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63163-1_8

zbMATH Keywords

addition chainsdata compressionfinite fieldsword chains

Mathematics Subject Classification ID

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

Recommendations

• A Survey of Fast Exponentiation Methods
• Polynomial and normal bases for finite fields
• Fast exponentation in cryptography
• Efficient and optimal exponentiation in finite fields
• scientific article; zbMATH DE number 4078798

Cited in

(22)

• Algorithms for exponentiation in finite fields
• Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields
• Polynomial and normal bases for finite fields
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• On the construction of short addition-subtraction chains and their applications
• Related-key attacks against full Hummingbird-2
• Operation-efficient subgroups of finite fields
• Fast exponentiation in subgroups of finite fields
• A public key cryptosystem based upon Euclidean addition chains
• Complexity of computation in finite fields
• Exponentiating faster with addition chains
• A Survey of Fast Exponentiation Methods
• The fast cascade exponentiation algorithm and its applications on cryptography
• Fast exponentation in cryptography
• Irreducible trinomials over finite fields
• scientific article; zbMATH DE number 2162686 (Why is no real title available?)
• Computing special powers in finite fields
• IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
• Conjecture of two finite fields and its applications
• Efficient and optimal exponentiation in finite fields
• Efficient hardware implementation of finite fields with applications to cryptography
• Applying quick exponentiation for block upper triangular matrices

This page was built for publication: Exponentiation in finite fields: theory and practice

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