Cox-Rower architecture for fast parallel Montgomery multiplication

zbMATH Open1082.94524MaRDI QIDQ3374935FDOQ3374935

Authors Shinichi Kawamura, Masanobu Koike, Fumihiko Sano, Atsushi Shimbo

Publication date 1 March 2006

Mathematics Subject Classification ID

Cryptography (94A60) Parallel algorithms in computer science (68W10) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 1882024
• Highly parallel modular multiplication in the residue number system using sum of residues reduction
• Systolic multiplier for Montgomery’s algorithm
• An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
• A systolic, high speed architecture for an RSA cryptosystem

Cited in

(7)

• Highly parallel modular multiplier for elliptic curve cryptography in residue number system
• Trade-off approaches for leak resistant modular arithmetic in RNS
• Exploiting the Power of GPUs for Asymmetric Cryptography
• Partial-collision attack on the round-reduced compression function of Skein-256
• Highly parallel modular multiplication in the residue number system using sum of residues reduction
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• Toward Acceleration of RSA Using 3D Graphics Hardware

This page was built for publication: Cox-Rower architecture for fast parallel Montgomery multiplication

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