Implementasi dan Pengukuran Kinerja Operasi Aritmatika Finite Field Berbasis Polinomial Biner

Senjaya, Wenny Franciska and Rahardjo, Budi (2015) Implementasi dan Pengukuran Kinerja Operasi Aritmatika Finite Field Berbasis Polinomial Biner. Jurnal Teknik Informatika dan Sistem Informasi (JuTISI), 1 (2). pp. 1-11. ISSN e-ISSN: 2443-2229

Text 14. Wenny_Budi_Implementasi dan Pengukuran Kinerja Operasi Aritmatika Finite Field Berbasis Polinomial Biner.pdf - Published Version Restricted to Registered users only Download (725kB) | Request a copy

Abstract

Cryptography is a method which is commonly used to secure crucial information on data transmission. This field of study has three kinds of protocols which are Symmetric Algorithms, Asymmetric (Public Key) Algorithms, and Cryptographic Protocols. Elliptic Curve Cryptography (ECC) is a public key encryption which is requires high computation to solve arithmetic operations. Finite field has important role in ECC implementation, finite field is required in curve operations. Finite field consists of many arithmetic operations such as add, multiply, square,inverse, and div operation which can be represented in many form such as prime field GF(p) and binary field GF(2m).There are two representation in binary field, polynomial basis and normal basis. This research presents implementation of arithmetic operation algorithms on polynomial basis with maximum key 299 bits and measured it based on its time and memory usage.

Item Type:	Article
Uncontrolled Keywords:	cryptography, elliptic curve, finite field, polynomial basis, binary field
Subjects:	T Technology > T Technology (General)
Divisions:	Fakultas Teknologi Informasi
Depositing User:	admin LPPM
Date Deposited:	11 Aug 2017 06:35
Last Modified:	11 Aug 2017 06:35
URI:	http://repository.lppm.maranatha.edu/id/eprint/155

Actions (login required)

View Item