A Generalization of Addition Chains and Fast Inversions in Binary Fields

DOI10.1109/TC.2014.2375182MaRDI QIDQ2982085zbMATH OpenOpenAlexFDO

Authors Kimmo Järvinen, Reza Azarderakhsh, Vassil S. Dimitrov

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2014.2375182

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Numerical algorithms for computer arithmetic, etc. (65Y04) Cryptography (94A60)

Cited in

(3)

• IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
• An application of the method of additive chains to inversion in finite fields
• Low-cost addition-subtraction sequences for the final exponentiation in pairings

This page was built for publication: A Generalization of Addition Chains and Fast Inversions in Binary Fields

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