Efficient Software Implementation of RNS-Montgomery Modular Multiplication for Embedded System

Chiraz Massoud; Anissa Sghaier; Medien Zeghid; Mohsen Machhout; IEEE

Back

Conference proceeding

Efficient Software Implementation of RNS-Montgomery Modular Multiplication for Embedded System

Chiraz Massoud, Anissa Sghaier, Medien Zeghid, Mohsen Machhout and IEEE

2016 SECOND INTERNATIONAL IMAGE PROCESSING, APPLICATIONS AND SYSTEMS (IPAS)

01/01/2016

Abstract

Computer Science

Computer Science, Information Systems

Computer Science, Software Engineering

Science & Technology

Technology

Recently, a lot of progress has been made in the implementation of asymmetric cryptography such that RSA or ECC (Elliptic Curve Cryptography) in both hardware and software. The Residue Number Systems (RNS) offer, many features make it very useful in cryptographic applications. Since the modular multiplication is the main operation, in this paper, we describe a Montgomery modular multiplication algorithm based on RNS. Then we implemented our design in TM i3 CPU, it computed the modular multiplication in only 9 ms (latency) and achieving maximum throughput of 528.

Metrics

1 Record Views

Details

Title: Efficient Software Implementation of RNS-Montgomery Modular Multiplication for Embedded System
Creators - without role: Chiraz Massoud - University of Monastir
Anissa Sghaier - University of Monastir
Medien Zeghid - Higher Inst Appl Sci & Technol, Taffala City 4003, Sousse, Tunisia
Mohsen Machhout - University of Monastir
IEEE
Publication Details: 2016 SECOND INTERNATIONAL IMAGE PROCESSING, APPLICATIONS AND SYSTEMS (IPAS)
Publisher: IEEE
Number of pages: 5
Identifiers: 9925334008331
Academic Unit: Prince Sattam Bin Abdulaziz University
Language: English
Resource Type: Conference proceeding