Earticle

초록

영어

As a public key cryptography, Elliptic Curve Cryptography (ECC) is well known to be the most secure algorithms that can be used to protect information during the transmission. ECC in its arithmetic computations suffers from modular inversion operation. Modular Inversion is a main arithmetic and very long-time operation that performed by the ECC crypto-processor. The use of projective coordinates to define the Elliptic Curves (EC) instead of affine coordinates replaced the inversion operations by several multiplication operations. Many types of projective coordinates have been proposed for the elliptic curve E: y2 =x3 +ax+b which is defined over a Galois field GF(p) to do EC arithmetic operations where it was found that these several multiplications can be implemented in some parallel fashion to obtain higher performance. In this work, we will study Hessian projective coordinates systems over GF (p) to perform ECC doubling operation by using parallel multipliers to obtain maximum parallelism to achieve maximum gain.

목차

Abstract
 1. Introduction
 2. ECC Cryptosystem-Revisited
 3. System Equations
  3.1. Using Affine Coordinates
  3.2. Using Projection (X/Z, Y/Z)
  3.3. Using Projection (X/Z, Y/Z2)
  3.4. Using Projection
 4. Modeling and Analysis
 5. Cost Comparison
 6. Summary of Results
 7. Conclusions
 8. References

키워드

저자

• Fahad Bin Muhaya [ King Saud University (KSU), Prince Muqrin Chair for IT Security, Kingdom of Saudi Arabia, Riyadh ]
• Qasem Abu Al-Haija' [ Jordan University of Science and Technology (JUST), Department of Computer Jordan University of Science and Technology (JUST), Department of Computer ]
• Lo'ai Tawalbeh [ Jordan University of Science and Technology (JUST), Department of Computer Jordan University of Science and Technology (JUST), Department of Computer ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605