Exponentiating faster with addition chains

DOI10.1007/3-540-46877-3_20MaRDI QIDQ4036874zbMATH OpenFDO

Authors Yacov Yacobi

Publication date 18 May 1993

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

Full work available at URL https://doi.org/10.1007/3-540-46877-3_20

zbMATH Keywords

data compressionDiffie-Hellman like cryptographic systemsfast computations with huge numbersfast exponentiationLempel-Ziv data compression algorithm

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Fast exponentation in cryptography
• Exponentiation in finite fields: theory and practice
• scientific article; zbMATH DE number 503339
• Efficient exponentiation using precomputation and vector addition chains

Cited in

(10)

• Integrating authentication in public key distribution system
• Analysis of sliding window techniques for exponentiation
• Analysis of the variable length nonzero window method for exponentiation
• A method for computing Lucas sequences
• Efficient implementation of algorithms for approximate exponentiation
• On the construction of short addition-subtraction chains and their applications
• Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
• Fast Exponentiation Using Data Compression
• Fast exponentation in cryptography
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques

This page was built for publication: Exponentiating faster with addition chains

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