Double-Size Bipartite Modular Multiplication

DOI10.1007/978-3-540-73458-1_18zbMATH Open1213.94143OpenAlexW1603133956MaRDI QIDQ3608919FDOQ3608919

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

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

zbMATH Keywords

RSAsmartcardbipartite modular multiplicationcrypto-coprocessordouble-size technique

Mathematics Subject Classification ID

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

Cited In (4)

• Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
• Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication
• Speeding up bipartite modular multiplication
• 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)