scientific article; zbMATH DE number 1504802

MaRDI QIDQ4502771zbMATH OpenFDO

Authors Colin D. Walter

Publication date 7 November 2000

zbMATH Keywords

checker functionsdifferential power attackserror correctionfault tolerancehigher radix methodsMontgomery's modular multiplication algorithmRSA cryptosystemssystolic array implementationtesting

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Data encryption (aspects in computer science) (68P25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Systolic multiplier for Montgomery’s algorithm
• An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
• Fast algorithms for implemention of Montgomery's modular multiplication technique
• scientific article; zbMATH DE number 1456815
• Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications

Cited in

(11)

• Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
• Montgomery and RNS for RSA hardware implementation
• Distinguishing Multiplications from Squaring Operations
• scientific article; zbMATH DE number 2079918 (Why is no real title available?)
• scientific article; zbMATH DE number 2079919 (Why is no real title available?)
• scientific article; zbMATH DE number 1759301 (Why is no real title available?)
• Another Way of Doing RSA Cryptography in Hardware
• Generalised Mersenne numbers revisited
• Revisiting sum of residues modular multiplication
• An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
• A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSL

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 Q4502771)