International audienceThis paper is a survey of Montgomery reduction in the context of residue number system arithmetic. We present the main variants of RNS Montgomery reduction, some efficient embedded hardware implementations, applications in asymmetric cryptography (RSA, ECC, pairing, lattices), to end with the use of RNS against side-channel analysis and fault attacks
© Copyright 2006 IEEEThe Montgomery residue number system (MRNS) for long word-length arithmetic is ...
Public-key cryptography is a mechanism for secret communication between parties who have never befor...
Cette thèse se situe à l'intersection de la cryptographie et de l'arithmétique des ordinateurs. Elle...
The majority of currently established public-key cryptosystems, e.g., RSA, ECC, requires modular mul...
The majority of currently established public-key cryptosystems, e.g., RSA, ECC, requires modular mul...
International audienceThe modular exponentiation on large numbers is computationally intensive. An e...
During the last years, different fast hardware implementations of RSA encryption have been done. In ...
Modular multiplication can be performed in the residue number system (RNS) using a type of Montgomer...
Scalar multiplication, the main operation in elliptic curve cryptographic protocols, is vulnerable ...
International audienceThe paper describes a new RNS (residue number system) modular multiplication a...
International audienceThe paper describes a new RNS (residue number system) modular multiplication a...
International audienceThis paper analyzes the robustness of RSA countermeasures against electromagne...
International audienceOn an embedded device, an implementation of cryptographic operation, like an R...
A brand new methodology for embedding residue arithmetic inside a dual-field Montgomery modular mult...
The modular exponentiation on large numbers is computationally intensive. An effective way for perfo...
© Copyright 2006 IEEEThe Montgomery residue number system (MRNS) for long word-length arithmetic is ...
Public-key cryptography is a mechanism for secret communication between parties who have never befor...
Cette thèse se situe à l'intersection de la cryptographie et de l'arithmétique des ordinateurs. Elle...
The majority of currently established public-key cryptosystems, e.g., RSA, ECC, requires modular mul...
The majority of currently established public-key cryptosystems, e.g., RSA, ECC, requires modular mul...
International audienceThe modular exponentiation on large numbers is computationally intensive. An e...
During the last years, different fast hardware implementations of RSA encryption have been done. In ...
Modular multiplication can be performed in the residue number system (RNS) using a type of Montgomer...
Scalar multiplication, the main operation in elliptic curve cryptographic protocols, is vulnerable ...
International audienceThe paper describes a new RNS (residue number system) modular multiplication a...
International audienceThe paper describes a new RNS (residue number system) modular multiplication a...
International audienceThis paper analyzes the robustness of RSA countermeasures against electromagne...
International audienceOn an embedded device, an implementation of cryptographic operation, like an R...
A brand new methodology for embedding residue arithmetic inside a dual-field Montgomery modular mult...
The modular exponentiation on large numbers is computationally intensive. An effective way for perfo...
© Copyright 2006 IEEEThe Montgomery residue number system (MRNS) for long word-length arithmetic is ...
Public-key cryptography is a mechanism for secret communication between parties who have never befor...
Cette thèse se situe à l'intersection de la cryptographie et de l'arithmétique des ordinateurs. Elle...