Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements

2013 ◽  
Author(s):  
Yinan Kong ◽  
Yufeng Lai
Keyword(s):  
Parallel Processing ◽  
Public Key ◽  
Low Latency ◽  
Modular Multiplication ◽  
Processing Elements ◽  
Public Key Cryptosystems

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.

A Scalable and Systolic Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems Based on DSPs

2017 ◽  
Vol 1 (3) ◽  
pp. 219-236 ◽  
Author(s):  
Amine Mrabet ◽  
Nadia El-Mrabet ◽  
Ronan Lashermes ◽  
Jean-Baptiste Rigaud ◽  
Belgacem Bouallegue ◽  
...  
Keyword(s):  
Public Key ◽  
Modular Multiplication ◽  
Public Key Cryptosystems ◽  
Montgomery Modular Multiplication

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 An Optimization of Tree Topology Based Parallel Cryptography

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Masumeh Damrudi ◽  
Norafida Ithnin
Keyword(s):  
Parallel Processing ◽  
Rapid Development ◽  
Parallel Architecture ◽  
Public Key Cryptography ◽  
Tree Topology ◽  
Public Key ◽  
Secure Communications ◽  
Modular Exponentiation ◽  
Public Key Cryptosystems ◽  
Reasonable Solution

Public key cryptography has become of vital importance regarding the rapid development of wireless technologies. The RSA is one of the most important algorithms for secure communications in public-key cryptosystems. Since the RSA is expensive in terms of computational task which is modular exponentiation, parallel processing and architecture is a reasonable solution to speedup RSA operations. In this paper, taking into account pipelining and optimization, we improve throughput and efficiency of the TRSA method, a parallel architecture solution for RSA security based on tree topology. The optimization and pipelining of the tree based architecture increases its efficiency and throughput. The experimental results demonstrate that these pipelined and optimized approaches outperform the main TRSA.

Sign in / Sign up

Export Citation Format

Share Document