Implementation of RSA algorithm based on RNS Montgomery multiplication

DOI10.1007/3-540-44709-1_30MaRDI QIDQ4797394zbMATH OpenFDO

Authors Hanae Nozaki, Masahiko Motoyama, Atsushi Shimbo, Shinichi Kawamura

Publication date 20 March 2003

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

Full work available at URL https://doi.org/10.1007/3-540-44709-1_30

zbMATH Keywords

modular exponentiationMontgomery multiplicationresidue number systemsRSA cryptography

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Cryptography (94A60)

Recommendations

• Montgomery and RNS for RSA hardware implementation
• An RNS Montgomery modular multiplication algorithm
• scientific article; zbMATH DE number 65248
• scientific article; zbMATH DE number 503341
• RM- RSA algorithm
• An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
• Fast algorithms for implemention of Montgomery's modular multiplication technique
• An efficient RSA implementation without precomputation
• scientific article; zbMATH DE number 2230910
• Parallel implementation of the rsa public-key cryptosystem

Cited in

(7)

• Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA
• Partial-collision attack on the round-reduced compression function of Skein-256
• Montgomery and RNS for RSA hardware implementation
• Cox-Rower architecture for fast parallel Montgomery multiplication
• Revisiting sum of residues modular multiplication
• Exploiting the Power of GPUs for Asymmetric Cryptography
• RM- RSA algorithm

This page was built for publication: Implementation of RSA algorithm based on RNS Montgomery multiplication

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