Fast exponentation in cryptography

DOI10.1007/3-540-60114-7_11MaRDI QIDQ4352792zbMATH OpenFDO

Authors Irina E. Bocharova, Boris D. Kudryashov

Publication date 27 October 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-60114-7_11

zbMATH Keywords

data compressionexponentiationnumber of multiplications

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A Survey of Fast Exponentiation Methods
• scientific article; zbMATH DE number 177037
• scientific article; zbMATH DE number 2077085
• scientific article; zbMATH DE number 503339

Cited in

(11)

• The complexity of certain multi-exponentiation techniques in cryptography
• A note on an algorithm in cryptography
• scientific article; zbMATH DE number 177037 (Why is no real title available?)
• A Survey of Fast Exponentiation Methods
• Fast Exponentiation Using Data Compression
• scientific article; zbMATH DE number 613355 (Why is no real title available?)
• The fast cascade exponentiation algorithm and its applications on cryptography
• scientific article; zbMATH DE number 1950337 (Why is no real title available?)
• scientific article; zbMATH DE number 2077085 (Why is no real title available?)
• Fast Computation of Large Distributions and Its Cryptographic Applications
• scientific article; zbMATH DE number 2230910 (Why is no real title available?)

This page was built for publication: Fast exponentation in cryptography

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