Analisis Keamanan Protokol Mutual Autentikasi Menggunakan Hyperelliptic Curve Cryptosystem (HECC)
Keywords:
Hyperelliptic Curve Cryptosystem (HECC), Hyperelliptic Curve Digital Signature Algorithm (HECDSA), Protokol Mutual AutentikasiAbstract
Hyperelliptic Curve Cryptosystem (HECC) sangat cocok digunakan untuk mengamankan komunikasi dalam jaringan sensor nirkabel yang memiliki sumber daya terbatas (seperti: penyimpanan, waktu atau daya) pada batasan titik sensor yang digunakan untuk teknik keamanan konvensional. Kita bisa membangun genus 2 HECC 80-bit pada finite field untuk mencapai tingkat keamanan yang sama seperti 160-bit Elliptic Curve Cryptography (ECC) atau 1024-bit RSA. Pada paper ini dijelaskan protokol mutual autentikasi yang didasarkan pada Hyperelliptic Curve Digital Signature Algorithm (HECDSA) untuk akses keamanan dalam perangkat yang dibatasi sehingga memungkinkan kedua entitas untuk memverifikasi keaslian masing-masing. Hasil penelitian menunjukkan bahwa protokol ini memiliki tingkat keamanan yang memadai karena tahan terhadap beberapa serangan (attack).
References
[1] R. M. Avanzi, “Aspects of hyper-elliptic curves over large prime fields in software implementations”,Cryptographic Hardware and Embedded Systems, LNCS vol. 3156, pp. 148-162, 2004.
[2] M. A. Azim and A. Jamalipour. “An efficient elliptic curve cryptography based authenticated key agreement protocol for wireless LAN security”, International Workshop on High Performance Switching and Routing (HPSR’05), pp. 376-380, 2005.
[3] P. E. Abi-char, A. Mhamed, and B. E. Hassan, “A secure authenticated key agreement protocol based on elliptic curve cryptography”, IEEE International Symposium on Information Assurance and Security, vol.57, pp. 89-94, 2007.
[4] L. Adleman, J. DeMarrais, and M. Huang, “A subexponential algorithm for discrete. logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields”, Algorithmic Number Theory (ANTS-1), LNCS 877, pp. 28-40, 1994.
[5] M. Aydos, T. Yanık, and C. K. Koc, “High-speed implementation of an ECC-based wireless authentication protocol on an ARM microprocessor”, IEE Proceedings: Communications, vol.148, no. 5, pp.273–279, 2001.
[6] H. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks”, Proceedings of the IEEE Security and Privacy Symposium, pp. 197-213 , 2003.
[7] D. G. Cantor, “Computing in the Jacobian of a hyperelliptic curve”, Mathematics of Computation, vol.48, pp. 95-101, 1987.
[8] H. Cohen and G. Frey, “Handbook of Elliptic and Hyperelliptic Curve Cryptography”, Chapman & Hall/CRC Press, 2006.
[9] K. Chatterjee and D. Gupta, “Evolution of Hyperelliptic Curve Cryptosystems”, in proceedings of ICDCIT 2010, LNCS 5966, pp.206-211, Springer -Verlag Berlin Heidelberg 2010.
[10] L. Eschenauer and V. Gligor. “A key management scheme for distributed sensor networks”, Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS’02), pp. 41-47, 2002.
[11] G. Frey and H. Ruck, “A remark concerning mdivisibility and the discrete logarithm in the divisor class group of curves”, Mathematics of Computation, vol. 62, pp. 865-874, 1994.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
