The fast cascade exponentiation algorithm and its applications on cryptography

DOI10.1007/3-540-57220-1_82MaRDI QIDQ4341712zbMATH OpenFDO

Authors Sung-Ming Yen, Chi-Sung Laih

Publication date 7 September 1997

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

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

zbMATH Keywords

cascade exponentiationperformance analysis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Fast exponentation in cryptography
• Multi-exponentiation (cryptographic protocols)
• Fast modular multi-exponentiation using modified complex arithmetic
• A Survey of Fast Exponentiation Methods
• scientific article; zbMATH DE number 2077085

Cited in

(8)

• A method for computing Lucas sequences
• The complexity of certain multi-exponentiation techniques in cryptography
• The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
• scientific article; zbMATH DE number 4157891 (Why is no real title available?)
• Multi-exponentiation (cryptographic protocols)
• Fast Computation of Large Distributions and Its Cryptographic Applications
• scientific article; zbMATH DE number 2230910 (Why is no real title available?)
• A new strategy for generating shortest addition sequences

This page was built for publication: The fast cascade exponentiation algorithm and its applications on cryptography

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