ScholarLens Back to search
2005•Proceedings. ICCEA 2004. 2004 3rd International Conference on Computational Electromagnetics and Its Applications, 2004.Requires access

New public key encryption techniques based on generalized discrete logarithm, integer factorization and double integer factorization problems

MOHAMED E. M. NASR

Open publisher page 0 citations

Abstract

This paper introduces two new public key encryption techniques namely the "logarithmic-factorized (LF)" and the "double-exponentiation (DE)" cryptosystems. The main one-way trapdoor functions of these algorithms are the general form of the generalized discrete logarithm problem (GDLP), the integer factorization problem (IFP) and the double IFP (DIFP). The LF algorithm depends simultaneously on both the GDLP and the IFP, while the DE algorithm depends on the DIFP. The validity of these algorithms is proven by applying them to messages and returning the original messages in various numerical examples. The proposed cryptosystems have many advantages that are explained in detail.

About this research paper

What this paper is about

This paper introduces two new public key encryption techniques namely the "logarithmic-factorized (LF)" and the "double-exponentiation (DE)" cryptosystems. The main one-way trapdoor functions of these algorithms are the general form of the generalized discrete logarithm problem (GDLP), the integer factorization problem (IFP) and the double IFP (DIFP). The LF algorithm depends simultaneously on both the GDLP and the IFP, while the DE algorithm depends on the DIFP. The validity of these algorithms is proven by applying them to messages and returning the original messages in various numerical examples. The proposed cryptosystems have many advantages that are explained in detail.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper introduces two new public key encryption techniques namely the "logarithmic-factorized (LF)" and the "double-exponentiation (DE)" cryptosystems. The main one-way trapdoor functions of these algorithms are the general form of the generalized discrete logarithm problem (GDLP), the integer factorization problem (IFP) and the double IFP (DIFP). The LF algorithm depends simultaneously on both the GDLP and the IFP, while the DE algorithm depends on the DIFP. The validity of these algorithms is proven by applying them to messages and returning the original messages in various numerical examples. The proposed cryptosystems have many advantages that are explained in detail.

Key concepts: Integer factorization, Discrete logarithm, Exponentiation, Cryptosystem, Integer (computer science), Post-quantum cryptography, Encryption, Public-key cryptography

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
New public key encryption techniques based on generalized discrete logarithm, integer factorization and double integer factorization problems — Research Paper | ScholarLens