Fast Modular Exponentiation Methods for Public-Key Cryptography

Modular exponentiation (ME) is a complex operation for several public-key cryptosystems (PKCs). Moreover, ME is expensive for resource-constrained devices in terms of computation time and energy consumption, especially when the exponent is large. ME is defined as the task of raising an integer x to...

Full description

Saved in:
Bibliographic Details
Main Authors: El Makkaoui, Khalid, Lamriji, Youssef, Ouahbi, Ibrahim, Nabil, Omayma, Bouzahra, Anas, Beni-Hssane, Abderrahim
Format: Conference Proceeding
Language:English
Subjects:
Communications technology
Complexity theory
Energy consumption
Java
Modular exponentiation (ME)
Public key cryptography
public-key cryptosystem (PKC)
Raspberry Pi
RSA
Security
Task analysis
window method (WM)
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Modular exponentiation (ME) is a complex operation for several public-key cryptosystems (PKCs). Moreover, ME is expensive for resource-constrained devices in terms of computation time and energy consumption, especially when the exponent is large. ME is defined as the task of raising an integer x to power k and reducing the result modulo some integer n . Several methods to calculate ME have been proposed. In this paper, we present the efficient ME methods. We then implement the methods using different security levels of RSA keys on a Raspberry Pi. Finally, we give the fast ME method.
ISSN:2771-7402
DOI:10.1109/CommNet56067.2022.9993851