By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Elkamchouchi, H.M. ; Fac. of Eng., Alexandria Univ., Egypt ; Nasr, M.E. ; Esmail, R.

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.

Published in:

Computational Electromagnetics and Its Applications, 2004. Proceedings. ICCEA 2004. 2004 3rd International Conference on

Date of Conference:

1-4 Nov. 2004