Performance Study of genus 3 Hyperelliptic Curve Cryptosystem
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Hyperelliptic Curve Cryptosystem (HECC) is well suited for all kinds of embedded processor architectures, where resources such as storage, time, or power are constrained due to short operand sizes. We can construct genus 3 HECC on 54-bit finite fields in order to achieve the same security level as 160-bit ECC or 1024-bit RSA due to the algebraic structure of Hyperelliptic Curve. This paper explores various possible attacks to the discrete logarithm in the Jacobian of a Hyperelliptic Curve (HEC) and addition and doubling of the divisor using explicit formula to speed up the scalar multiplication. Our aim is to develop a cryptosystem that can sign and authenticate documents and encrypt / decrypt messages efficiently for constrained devices in wireless networks. The performance of our proposed cryptosystem is comparable with that of ECC and the security analysis shows that it can resist the major attacks in wireless networks.
Abstract
Hyperelliptic Curve Cryptosystem (HECC) is well suited for all kinds of embedded processor architectures, where resources such as storage, time, or power are constrained due to short operand sizes. We can construct genus 3 HECC on 54-bit finite fields in order to achieve the same security level as 160-bit ECC or 1024-bit RSA due to the algebraic structure of Hyperelliptic Curve. This paper explores various possible attacks to the discrete logarithm in the Jacobian of a Hyperelliptic Curve (HEC) and addition and doubling of the divisor using explicit formula to speed up the scalar multiplication. Our aim is to develop a cryptosystem that can sign and authenticate documents and encrypt / decrypt messages efficiently for constrained devices in wireless networks. The performance of our proposed cryptosystem is comparable with that of ECC and the security analysis shows that it can resist the major attacks in wireless networks.
참고문헌 (31)
- O.Goldreich, "Session-Key Generation Using Human Passwords only", LNCS, (2139), pp.408~432 (2001), Crypto
- R.Katz, "Efficient Password Authenticated Key Exchange Using Human Memorable Passwords", LNCS, (2045), pp.475~494 (2001), Eurocrypt
- M.Aydos, "High-Speed Implementation of an ECC-based Wireless Authentication Protocol on an ARM Microprocessor", IEE Proceedings: Communications, 148(5), pp.273~279 (2001)
- V. Boyko, "Provably secure password authenticated Key Exchange using Diffie-Hellman", LNCS, (1807), pp.156~171 (2000), EuroCrypt
- 염대현, "EPA: An efficient password-based protocol for authenticated key exchange", Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2727 LNCS(0), pp.452~463 (2003), Springer Verlag
- E. Ryu, "A Simple Key Agreement Protocol", In Proc. of IEEE 37th Annual International Carnahan Conference 2003, pp.128~131 (2003)
- K.Jung, "Password-Based Independent Authentication and Key Exchange Protocol", ICICS-PCM 2003, pp.1908~1912 (2003), IEEE
- Julien Bringer, "Password Based Key Exchange Protocols on Elliptic Curves Which Conceal the Public Parameters", LNCS, (6123), pp.291~308 (2010), ACNS
- Kakali Chatterjee, "Timestamp based Authentication Protocol for Smart Card using ECC", LNCS, (6987), pp.368~375 (2011), WISM
- Meng-Hui Lim, "A Secure and Efficient Three-Pass Authenticated Key Agreement Protocol Based on Elliptic Curves", LNCS, (4982), pp.170~182 (2008), NETWORKING
- Koblitz, N., "Hyperelliptic cryptosystems", Journal of Cryptology, 1(3), pp.139~150 (1989)
- Adleman L, "A subexponential algorithm for discrete. logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields", LNCS, (877), pp.28~40 (1994), ANTS-1
- Frey G, "A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves", Mathematics of Computation, 62, pp.865~874 (1994)
- Ruck H.G, "On the discrete logarithms in the divisor class group of curves", Mathematics Computation, 68, pp.805~806 (1999)
- Henry Cohen, "Handbook of Elliptic and Hyperelliptic Curve Cryptography" (2006), CRC Press
- "n elementary introduction to hyperelliptic curves"[URL]
- Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves, "J.Pelzl", 351~365, pp.Cryptology ePrint Archieve, Report 026 (2003)
- Cantor D.G., "Computing in the Jacobian of a hyperelliptic curve", Mathematics of Computation, 48, pp.95~101 (1987)
- "Fast Arithmetic on Genus Two Curves"[URL]
- Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves, "Lange.T", ~, pp.Cryptology ePrint Archieve, Report 147 (2002)
- Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae, "Lange.T", ~, pp.Cryptology ePrint Archive, Report 121 (2002)
- "Aspects of hyperelliptic Curves over Large Prime Fields in Software Implementation"[URL]
- J.Pelzl, "Elliptic & Hyperelliptic Curves on Embedded μP", ACM special issue Security and Embedded Systems Vol.no.0164-0925, 0100-0111, pp.2003, ~
- Gonda.M, "Improvements of addition algorithm on genus 3 hyperelliptic curves and their implementations", Proc of SCIS, pp.89~96 (2004)
- Fan.X, "Efficient explicit formulae for genus 3 hyperelliptic curve cryptosystems over binary fields", IET Inf.Secur., 1(2), pp.65~81 (2007)
- Kuroki.J, "Fast Genus Three Hyperelliptic Curve- Cryptosystems", pp.503~507 (2002), SCIS
- Sakai.Y, "On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation", IEICE Trans, E83-A(4), pp.692~703 (2000)
- "Decomposed Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field"[URL]
- Benjamin Smith, "Isogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves", pp.163~180 (2008), EUROCRYPT
- Kakali Chatterjee, "Evolution of Hyperelliptic Curve Cryptosystems", LNCS, (5966), pp.206~211 (2010), ICDCIT
- Performance Comparison of Elliptic Curve and RSA Digital Signatures, "Nicholas Jansma", University of Michigan, ~ (2004)