ScholarLens Back to search
2004•Unpublished venueRequires access

NEW PUBLIC KEY ENCRYPTION TECHNIQUES BASED ON GENERALIZED DISCRETE LOGARITHM, INTEGER FACTORIZATION AND DOUBLE INTEGER FACTORIZATION PROBLEMS Hassaii M. Elkamchouclii Moliamed E. Nasr

Roayat Esmil

Open publisher page 0 citations

Abstract

This paper introduces two new public key encryption techniques namely the Lognn'fhmic-Factori~ed, (LF) and the 'Double-Eponentiatiog (DE) . c'yptosystems. The main one-way trapdoorfinctiom of these algon'thms are the general form of the Generalized Discrete Logarithm Problem (GDLP), the Integer Factorization Problem QFP) and the Double IFP (DIFP).The LF algorithm depend simultaneously on both fhe GDLP and the, IFP, while the DE algorithm depend on the DIFP. The validity of these algorithms is proven by applying ib messages and retumlng the onginnl messages in various nwnerica1 examples. The proposed cryptoqstems have many advantages that are explained in details.

About this research paper

What this paper is about

This paper introduces two new public key encryption techniques namely the Lognn'fhmic-Factori~ed, (LF) and the 'Double-Eponentiatiog (DE) . c'yptosystems. The main one-way trapdoorfinctiom of these algon'thms are the general form of the Generalized Discrete Logarithm Problem (GDLP), the Integer Factorization Problem QFP) and the Double IFP (DIFP).The LF algorithm depend simultaneously on both fhe GDLP and the, IFP, while the DE algorithm depend on the DIFP. The validity of these algorithms is proven by applying ib messages and retumlng the onginnl messages in various nwnerica1 examples. The proposed cryptoqstems have many advantages that are explained in details.

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 Lognn'fhmic-Factori~ed, (LF) and the 'Double-Eponentiatiog (DE) . c'yptosystems. The main one-way trapdoorfinctiom of these algon'thms are the general form of the Generalized Discrete Logarithm Problem (GDLP), the Integer Factorization Problem QFP) and the Double IFP (DIFP).The LF algorithm depend simultaneously on both fhe GDLP and the, IFP, while the DE algorithm depend on the DIFP. The validity of these algorithms is proven by applying ib messages and retumlng the onginnl messages in various nwnerica1 examples. The proposed cryptoqstems have many advantages that are explained in details.

Key concepts: Integer factorization, Discrete logarithm, Integer (computer science), Factorization, Logarithm, Mathematics, Key (lock), Encryption

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 Hassaii M. Elkamchouclii Moliamed E. Nasr — Research Paper | ScholarLens