Double-Size Bipartite Modular Multiplication

DOI10.1007/978-3-540-73458-1_18MaRDI QIDQ3608919zbMATH OpenOpenAlexFDO

Authors Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume

Publication date 6 March 2009

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73458-1_18

zbMATH Keywords

RSAsmartcardbipartite modular multiplicationcrypto-coprocessordouble-size technique

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Speeding up bipartite modular multiplication
• scientific article; zbMATH DE number 1341879
• Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication
• scientific article; zbMATH DE number 5679233
• Topics in Cryptology – CT-RSA 2004

Cited in

(4)

• Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication
• Speeding up bipartite modular multiplication
• Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
• On Quisquater's multiplication algorithm

This page was built for publication: Double-Size Bipartite Modular Multiplication

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