International Association for Cryptologic Research

Ph.D. Database

The aim of the IACR Ph.D. database is twofold. On the first hand, we want to offer an overview of Ph.D. already completed in the domain of cryptology. Where possible, this should also include a subject classification, an abstract, and access to the full text. On the second hand, it deals with Ph.D. subjects currently under investigation. This way, we provide a timely map of contemporary research in cryptology. All entries or changes need to be approved by an editor. You can contact them via phds (at) iacr.org.

Details

Ehab Alnfrawy (#555)
Name Ehab Alnfrawy
Personal Homepage http://sites.google.com/site/alnfrawy/
Institution Cairo University
Topic of his/her doctorate. Towards an Efficient Public Key Cryptosystem
Category public-key cryptography
Keywords ECC Efficiency
Ph.D. Supervisor(s) Aly A. Fahmy, Mohamed M. Abd-Eldayem
Year of completion 2010
Abstract The speed of public key encryption techniques is slow compared with the speed of symmetric encryption techniques, therefore symmetric encryption techniques are preferred to be used in encryption applications, and public key encryption techniques are used in applications that symmetric encryption techniques can’t be used. Many research works try to improve the efficiency of public key encryption techniques to speed up security application at high level of security. Elliptic Curve Cryptosystem (ECC) is the best candidate public key encryption technique to achieve this target. ECC efficiency can be improved by speeding up finite field operations or elliptic curve operations. Elliptic curve point scalar multiplication is the most operation that affect on the efficiency of ECC, therefore the efficiency of the proposed ECC algorithm is improved based on speeding up the elliptic curve point scalar multiplication operation using a another proposed algorithm for computing addition subtraction chain. Also we suggest a new combination for using mixed coordinates to speed up the elliptic curve scalar multiplication which gives a new idea for securing the ECC. In this thesis, the proposed algorithm to compute the addition subtraction chain gives improvement (in shorten the chains of 160 bit integers) by 20%. Also the proposed algorithm to compute scalar multiplication gives speeding up the ECCs with 26% specially ECIECS and PSEC.
E-Mail Address alnfrawy (at) gmail.com
Last Change 2011-05-16 05:38:24
To provide an update on this entry, please click .

Contact: phds (at) iacr.org

[ IACR home page ] [ IACR PhDs page ] © IACR