scientific article; zbMATH DE number 1456815

MaRDI QIDQ4954413zbMATH OpenFDO

Authors David Naccache, David M'Raïhi

Publication date 7 June 2000

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
• scientific article; zbMATH DE number 1759301
• A faster modular multiplication algorithm
• New frameworks for Montgomery’s modular multiplication method

Cited in

(16)

• The Montgomery inverse and its applications
• scientific article; zbMATH DE number 1759301 (Why is no real title available?)
• scientific article; zbMATH DE number 1504802 (Why is no real title available?)
• scientific article; zbMATH DE number 1979274 (Why is no real title available?)
• Formally verified Montgomery multiplication
• Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication
• scientific article; zbMATH DE number 2127886 (Why is no real title available?)
• Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
• Montgomery reduction with even modulus
• Subtraction-free almost Montgomery inverse algorithm
• Progress in Cryptology - INDOCRYPT 2004
• Optimal use of Montgomery multiplication on smart cards
• Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
• An efficient RSA implementation without precomputation
• Introduction
• Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields

This page was built for publication:

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