A Like ELGAMAL Cryptosystem But Resistant To Post-Quantum Attacks

Ahmed EL-YAHYAOUI; Fouzia OMARY

No Detail Found!

A Like ELGAMAL Cryptosystem But Resistant To Post-Quantum Attacks

Author(s)

Ahmed EL-YAHYAOUI Intelligent Processing & Security of Systems Team (IPSS) Faculty of Sciences, Mohammed V University in Rabat, Morocco

Fouzia OMARY Intelligent Processing & Security of Systems Team (IPSS) Faculty of Sciences, Mohammed V University in Rabat, Morocco

Abstract

The Modulo 1 Factoring Problem (M1FP) is an elegant mathematical problem which could be exploited to design safe cryptographic protocols and encryption schemes that resist to post quantum attacks. The ELGAMAL encryption scheme is a wellknown and efficient public key algorithm designed by Taher ELGAMAL from discrete logarithm problem. It is always highly used in Internet security and many other applications after a large number of years. However, the imminent arrival of quantum computing threatens the security of ELGAMAL cryptosystem and impose to cryptologists to prepare a resilient algorithm to quantum computer-based attacks. In this paper we will present a likeELGAMAL cryptosystem based on the M1FP NP-hard problem. This encryption scheme is very simple but efficient and supposed to be resistant to post quantum attacks.

Publication Details

Page(s) 132-136

DOI DOI not available

Published Journal: International Journal of Communication Networks and Information Security, Volume: 14, Issue: 1, Year: 2022

Request the full text from PASTIC

Keywords

cryptography, ElGamal, public key, NP-hard, M1FP, one-way function, post quantum attacks, cryptosystem

Citations

Downloads

Views