Enhanced Montgomery multiplication

DOI10.1007/3-540-36400-5_5MaRDI QIDQ4425686zbMATH OpenFDO

Authors Shay Gueron

Publication date 11 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2523/25230046.htm

zbMATH Keywords

non-reduced Montgomery multiplication

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07) Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• New frameworks for Montgomery’s modular multiplication method
• A faster modular multiplication algorithm
• Modular Multiplication Without Trial Division
• Montgomery-suitable cryptosystems
• Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications

Cited in

(4)

• A fast parallel modular exponentiation algorithm
• New frameworks for Montgomery’s modular multiplication method
• A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSL
• Progress in Cryptology - INDOCRYPT 2004

This page was built for publication: Enhanced Montgomery multiplication

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