Senjaya, Wenny Franciska and Rahardjo, Budi (2015) Implementasi dan Pengukuran Kinerja Operasi Aritmatika Finite Field Berbasis Polinomial Biner. Jurnal Teknik Informatika dan Sistem Informasi, 1 (2). pp. 183-193. ISSN 2443-2229
|
Text
Implementasi dan Pengukuran Kinerja Operasi Aritmatika.pdf - Published Version Download (708Kb) | Preview |
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) |
| Depositing User: | Perpustakaan Maranatha |
| Date Deposited: | 20 Oct 2015 06:00 |
| Last Modified: | 20 Oct 2015 06:00 |
| URI: | http://repository.maranatha.edu/id/eprint/16129 |
Actions (login required)
 |
View Item |
