earticle

논문검색

Comparative Study of Hyperelliptic Curve Cryptosystem over Prime Field and Its Survey

초록

영어

Public key cryptography is the famous cryptography technique used in many corporate sectors for developing software to provide security services. Hyperelliptic Curve Cryptosystem (HECC) is one of the public key cryptographic technique, an expansion of Elliptic Curve Cryptography which offers the similar level of security compared with other cryptosystems such as RSA, ECC and DSA. HECC supervise the ECC due to shorter operand size. This paper will analysis the performance of HECC over genus curve 2, 3, 4, 5, 6 and compares the result with ECC. It also inspects the use of Hyperelliptic Curve Cryptography technique and affords complete survey on its performance for many applications.

목차

Abstract
 1. Introduction
 2. Mathematical background of Hyperelliptic Curve Cryptography
  2.1. Hyperelliptic curve
  2.2. Types of genus curve
  2.3. Jacobian of Hyperelliptic Curve
  2.4. Mumford representation
  2.5. Cantor’s algorithm
 3. Hyperelliptic Curve Cryptosystem
  3.1. Algorithm for public & private key generation
  3.2. Encryption algorithm
  3.3. Decryption algorithm
 4. Performance Analysis
 5. HECC Survey and its Application
  5.1. Security of HECC
  5.2. Software and hardware implementation of HECC
  5.3 Discussion and recommendation
 6. Conclusion
 References

저자정보

  • P. Vijayakumar Research Scholar, Department of ECE, Pondicherry Engineering College
  • V. Vijayalakshmi Research Scholar, Department of ECE, Pondicherry Engineering College
  • G. Zayaraz Associate Professor, Department of CSE, Pondicherry Engineering College

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.