Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques

2017 ◽  
Vol 119 ◽  
pp. 25-38 ◽  
Author(s):  
Satyanarayana Vollala ◽  
Ramasubramanian N.
Keyword(s):  
Energy Efficient ◽  
Public Key Cryptography ◽  
Public Key ◽  
Modular Exponentiation

An Improved Montgomery Window Algorithm on Modular Exponentiation Secure against Side Channel Attacks

2013 ◽  
Vol 392 ◽  
pp. 862-866
Author(s):  
Mu Han ◽  
Jia Zhao ◽  
Shi Dian Ma
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
Side Channel ◽  
Modular Exponentiation ◽  
Side Channel Attacks ◽  
The Core

As one of the core algorithms in most public key cryptography, modular exponentiation has a flaw of its efficiency, which often uses the Montgomerys algorithm to realize the fast operation. But the Montgomerys algorithm has the issue of side channel leakage from the final conditional subtraction. Aiming at this problem, this paper presents an improved fast Montgomery window algorithm. The new algorithm generates the remainder table with odd power to reduce the amount of pre-computation, and combines with the improved Montgomerys algorithm to realize modular exponentiation, which can accelerate the speed and reduce the side channel leakage. The new algorithm cant only thwart side channel attacks, but also improve the efficiency.

An energy-efficient reconfigurable public-key cryptography processor

2001 ◽  
Vol 36 (11) ◽  
pp. 1808-1820 ◽  
Author(s):  
J. Goodman ◽  
A.P. Chandrakasan
Keyword(s):  
Energy Efficient ◽  
Public Key Cryptography ◽  
Public Key

Energy-Efficient Modular Exponential Techniques for Public-Key Cryptography

2021 ◽  
Author(s):  
Satyanarayana Vollala ◽  
N. Ramasubramanian ◽  
Utkarsh Tiwari
Keyword(s):  
Energy Efficient ◽  
Public Key Cryptography ◽  
Public Key

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.

scholarly journals Efficient FPGA Implementation of Modular Multiplication and Exponentiation

2020 ◽  
Vol 3 (1) ◽  
pp. 1-13
Author(s):  
M Issad ◽  
M Anane ◽  
B Boudraa ◽  
A M Bellemou ◽  
N Anane
Keyword(s):  
Execution Time ◽  
Public Key Cryptography ◽  
Fpga Implementation ◽  
Public Key ◽  
Modular Exponentiation ◽  
Modular Multiplication ◽  
Montgomery Modular Multiplication ◽  
Implementation Approach ◽  
On Chip ◽  
Data Length

This paper presents an FPGA implementation of the most critical operations of Public Key Cryptography (PKC), namely the Modular Exponentiation (ME) and the Modular Multiplication (MM). Both operations are integrated in Hardware (HW) as Programmable System on Chip (PSoC). The processor Microblaze of Xilinx is used for flexibility. Our objective is to achieve a best trade-off between execution time, occupied area and flexibility. In order to satisfy this constraint, Montgomery Power Ladder and Montgomery Modular Multiplication (MMM) algorithms are utilized for the ME and for the MM implementations as HW accelerators, respectively. Our implementation approach is based on the digit-serial method for performing the basic arithmetic operations. Efficient parallel and pipeline strategies are developed at the digit level for the optimization of the execution time. The application for 1024-bits data length shows that the MMM run in 6.24 µs and requires 647 slices. The ME is executed in 6.75 ms, using 2881 slices.

Sign in / Sign up

Export Citation Format

Share Document