New public key techniques based on double discrete logarithm problem
Hassan M. A. Elkamchouchi, MOHAMED E. M. NASR, Roayat Esmail
Abstract
Hassan M. A. Elkamchouchi, MOHAMED E. M. NASR, Roayat Esmail
Abstract
This paper introduces three new public key algorithms . The main one-way trapdoor functions of these algorithms are the double discrete logarithm problem (DDLP) and the integer factorization problem (IFP).The first proposed algorithm depends on the DDLP while the second and third proposed algorithms depend simultaneously on both the DDLP and the IFP. The validity of these algorithms is proven by applying to messages that are either an integer or a text and returning the original message in various numerical examples. The proposed cryptosystems have many advantages that are explained in details.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper introduces three new public key algorithms . The main one-way trapdoor functions of these algorithms are the double discrete logarithm problem (DDLP) and the integer factorization problem (IFP).The first proposed algorithm depends on the DDLP while the second and third proposed algorithms depend simultaneously on both the DDLP and the IFP. The validity of these algorithms is proven by applying to messages that are either an integer or a text and returning the original message in various numerical examples. The proposed cryptosystems have many advantages that are explained in details.
Key concepts: Discrete logarithm, Integer factorization, Logarithm, Key (lock), Computer science, Integer (computer science), Public-key cryptography, Cryptosystem