scholarly journals Design of a Modular Multiplier for Public-Key Cryptography Applications Using Residue Number System and Signed-Digit Representation

2020 ◽  
Author(s):  
Mohammad Hizzani
Keyword(s):  
Public Key Cryptography ◽  
Number System ◽  
Residue Number System ◽  
Public Key ◽  
Modular Multiplication ◽  
Secret Key ◽  
Public Key Cryptosystems ◽  
Number Systems ◽  
Wide Range ◽  
Residue Number

Public-Key Cryptosystems are prone to wide range of cryptanalyses due to its property of having key pairs one of them is public. Therefore, the recommended length of these keys is extremely large (e.g. in RSA and D-H the key is at least 2048 bits long) and this leads the computation of such cryptosystems to be slower than the secret-key cryptosystems (i.e. AES and AES-family). Since, the key operation in such systems is the modular multiplication; in this research a novel design for the modular multiplication based on the Montgomery Multiplication, the Residue Number Systems for moduli of any form, and the Signed-Digit Representation is proposed. The proposed design outperforms the current designs in the literature in terms of delay with at least 28% faster for the key of 2048 bits long. Up to our knowledge, this design is the first design that utilizes Signed-Digit Representation with the Residue Number System for moduli of any form.

scholarly journals Revisiting Sum of Residues Modular Multiplication

2010 ◽  
Vol 2010 ◽  
pp. 1-9 ◽  
Author(s):  
Yinan Kong ◽  
Braden Phillips
Keyword(s):  
Public Key Cryptography ◽  
Number System ◽  
Residue Number System ◽  
The Other ◽  
Public Key ◽  
Modular Multiplication ◽  
Residue Number ◽  
The Cost

In the 1980s, when the introduction of public key cryptography spurred interest in modular multiplication, many implementations performed modular multiplication using a sum of residues. As the field matured, sum of residues modular multiplication lost favor to the extent that all recent surveys have either overlooked it or incorporated it within a larger class of reduction algorithms. In this paper, we present a new taxonomy of modular multiplication algorithms. We include sum of residues as one of four classes and argue why it should be considered different to the other, now more common, algorithms. We then apply techniques developed for other algorithms to reinvigorate sum of residues modular multiplication. We compare FPGA implementations of modular multiplication up to 24 bits wide. The sum of residues multipliers demonstrate reduced latency at nearly 50% compared to Montgomery architectures at the cost of nearly doubled circuit area. The new multipliers are useful for systems based on the Residue Number System (RNS).

scholarly journals Improved Sum of Residues Modular Multiplication Algorithm

Cryptography ◽  
2019 ◽  
Vol 3 (2) ◽  
pp. 14 ◽  
Author(s):  
Mohamad Ali Mehrabi
Keyword(s):  
Parallel Implementation ◽  
Critical Issue ◽  
Public Key ◽  
Practical Implementation ◽  
Modular Multiplication ◽  
Public Key Cryptosystems ◽  
Multiplication Algorithm ◽  
Number Systems ◽  
Residue Number ◽  
Hardware Architectures

Modular reduction of large values is a core operation in most common public-key cryptosystems that involves intensive computations in finite fields. Within such schemes, efficiency is a critical issue for the effectiveness of practical implementation of modular reduction. Recently, Residue Number Systems have drawn attention in cryptography application as they provide a good means for extreme long integer arithmetic and their carry-free operations make parallel implementation feasible. In this paper, we present an algorithm to calculate the precise value of “ X mod p ” directly in the RNS representation of an integer. The pipe-lined, non-pipe-lined, and parallel hardware architectures are proposed and implemented on XILINX FPGAs.

scholarly journals Practical Evaluation of Protected Residue Number System Scalar Multiplication

2018 ◽  
pp. 259-282
Author(s):  
Louiza Papachristodoulou ◽  
Apostolos P. Fournaris ◽  
Kostas Papagiannopoulos ◽  
Lejla Batina
Keyword(s):  
Public Key Cryptography ◽  
Number System ◽  
Residue Number System ◽  
Scalar Multiplication ◽  
Public Key ◽  
Side Channel ◽  
Evaluation Approach ◽  
Rings Of Integers ◽  
Residue Number ◽  
Template Attacks

The Residue Number System (RNS) arithmetic is gaining grounds in public key cryptography, because it offers fast, efficient and secure implementations over large prime fields or rings of integers. In this paper, we propose a generic, thorough and analytic evaluation approach for protected scalar multiplication implementations with RNS and traditional Side Channel Attack (SCA) countermeasures in an effort to assess the SCA resistance of RNS. This paper constitutes the first robust evaluation of RNS software for Elliptic Curve Cryptography against electromagnetic (EM) side-channel attacks. Four different countermeasures, namely scalar and point randomization, random base permutations and random moduli operation sequence, are implemented and evaluated using the Test Vector Leakage Assessment (TVLA) and template attacks. More specifically, variations of RNS-based Montgomery Powering Ladder scalar multiplication algorithms are evaluated on an ARM Cortex A8 processor using an EM probe for acquisition of the traces. We show experimentally and theoretically that new bounds should be put forward when TVLA evaluations on public key algorithms are performed. On the security of RNS, our data and location dependent template attacks show that even protected implementations are vulnerable to these attacks. A combination of RNS-based countermeasures is the best way to protect against side-channel leakage.

scholarly journals High-Performance RNS Modular Exponentiation by Sum-Residue Reduction

2020 ◽  
Author(s):  
Tao Wu
Keyword(s):  
High Performance ◽  
Computer Arithmetic ◽  
Number System ◽  
Residue Number System ◽  
Modular Exponentiation ◽  
Number Systems ◽  
Diffie Hellman ◽  
Residue Number ◽  
Diffie Hellman Key Exchange ◽  
Rsa Cryptography

Abstract Modular exponentiation is fundamental in computer arithmetic and is widely applied in cryptography such as ElGamal cryptography, Diffie-Hellman key exchange protocol, and RSA cryptography. Implementation of modular exponentiation in residue number system leads to high parallelism in computation, and has been applied in many hardware architectures. While most RNS based architectures utilizes RNS Montgomery algorithm with two residue number systems, the recent modular multiplication algorithm with sum-residues performs modular reduction in only one residue number system with about the same parallelism. In this work, it is shown that high-performance modular exponentiation and RSA cryptography can be implemented in RNS. Both the algorithm and architecture are improved to achieve high performance with extra area overheads, where a 1024-bit modular exponentiation can be completed in 0.567 ms in Xilinx XC6VLX195t-3 platform, costing 26,489 slices, 87,357 LUTs, 363 dedicated multipilers of $18\times 18$ bits, and 65 Block RAMs.

scholarly journals Efficient Montgomery Modular Multiplication by using Residue Number System

2012 ◽  
Vol 2 (1) ◽  
pp. 56-62
Author(s):  
Elham Khani
Keyword(s):  
Elliptic Curve Cryptography ◽  
Arithmetic Operation ◽  
Digital Signal ◽  
Number System ◽  
Residue Number System ◽  
Binary Number ◽  
Modular Multiplication ◽  
Free System ◽  
Montgomery Modular Multiplication ◽  
Residue Number

Residue number system is a carry free system that performs arithmetic operation on residues instead of the weighted binary number. By applying Residue Number System (RNS) to Montgomery modular multiplication the delay of modular multiplication will be decreased. Modular multiplication over large number is frequently used in some application such as Elliptic Curve Cryptography, digital signal processing, and etc.By choosing appropriate RNS moduli sets the time consuming operation of multiplication can be replaced by smaller operations.  In addition because of the property of RNS, arithmetic operations are done over smaller numbers called residues. In this paper by choosing appropriate moduli sets the efficiency of conversion from RNS to RNS that is the most time consuming part of the Montgomery modular multiplication will be increased.

Fast modular multiplication execution in residue number system

2016 ◽  
Author(s):  
Nikolai I. Chervyakov ◽  
Mikhail G. Babenko ◽  
Viktor A. Kuchukov ◽  
Maxim A. Deryabin ◽  
Nataliya N. Kuchukova ◽  
...  
Keyword(s):  
Number System ◽  
Residue Number System ◽  
Modular Multiplication ◽  
Residue Number
Sign in / Sign up

Export Citation Format

Share Document