Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic

DOI10.1007/978-3-540-77272-9_21MaRDI QIDQ5448548zbMATH OpenOpenAlexFDO

Authors K. Bentahar, N. P. Smart

Publication date 7 March 2008

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77272-9_21

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A fast and secure RSA public key cryptosystem
• scientific article; zbMATH DE number 2085209
• Efficient Modular Arithmetic
• scientific article; zbMATH DE number 503341
• scientific article; zbMATH DE number 2079918

Cites work

• A Survey of Fast Exponentiation Methods
• Analysis of the sliding window powering algorithm
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• More on squaring and multiplying large integers
• Practical cryptography

This page was built for publication: Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic

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