Quad-Core RSA Processor with Countermeasure Against Power Analysis Attacks

09/08/2020
by   Javad Bagherzadeh, et al.
0

Rivest-Shamir-Adleman (RSA) cryptosystem uses modular multiplication for encryption and decryption. So, performance of RSA can be drastically improved by optimizing modular multiplication. This paper proposes a new parallel, high-radix Montgomery multiplier for 1024 bits multi-core RSA processor. Each computation step operates in radix 4. The computation speed is increased by more than 4 times. We also implement a True Random Number Generator based resilience block to protect the coprocessor against power attacks.

READ FULL TEXT

page 4

page 7

page 8

research
09/30/2020

An Embedded RISC-V Core with Fast Modular Multiplication

One of the biggest concerns in IoT is privacy and security. Encryption a...
research
04/19/2023

Baugh-Wooley Multiplication for the RISCV Processor

This article describes an efficient way to implement the multiplication ...
research
06/21/2023

NTT-Based Polynomial Modular Multiplication for Homomorphic Encryption: A Tutorial

Homomorphic Encryption (HE) allows any third party to operate on the enc...
research
01/08/2022

Horizontal DPA Attacks against ECC: Impact of Implemented Field Multiplication Formula

Due to the nature of applications such as critical infrastructure and th...
research
12/17/2016

Parallel Integer Polynomial Multiplication

We propose a new algorithm for multiplying dense polynomials with intege...
research
01/15/2018

A Multi-layer Recursive Residue Number System

We present a method to increase the dynamical range of a Residue Number ...
research
03/08/2021

A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching (Extended Version)

The iterative conditional branchings appear in various sensitive algorit...

Please sign up or login with your details

Forgot password? Click here to reset