Fast exponentiation in subgroups of finite fields

DOI10.1049/EL:20020449MaRDI QIDQ3577931zbMATH OpenOpenAlexFDO

Authors

Publication date 10 July 2010

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:20020449

Mathematics Subject Classification ID

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

Recommendations

• Operation-efficient subgroups of finite fields
• scientific article; zbMATH DE number 4078798
• scientific article; zbMATH DE number 2077085
• scientific article; zbMATH DE number 1979293
• scientific article; zbMATH DE number 503339

Cited in

(8)

• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Operation-efficient subgroups of finite fields
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Double-exponentiation in factor-4 groups and its applications
• scientific article; zbMATH DE number 1979293 (Why is no real title available?)
• Efficient Primitives from Exponentiation in ℤ p
• Low-cost addition-subtraction sequences for the final exponentiation in pairings
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques

This page was built for publication: Fast exponentiation in subgroups of finite fields

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