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

DOI10.1007/978-3-540-77272-9_21zbMath1154.94374OpenAlexW1494442711MaRDI QIDQ5448548

K. Bentahar, Nigel 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of the sliding window powering algorithm
• A Survey of Fast Exponentiation Methods
• More on squaring and multiplying large integers

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