Konstruksi Algoritme Aritmetik GF(2n) dengan Operasi Perkalian Oibangkitkan dari Sifat Orup Siklik
The construction of Arithmetic Algorithm GF(2") with Multiplication Generated by Cyclic Gronp
Abstract
Teknologi informasi saal ini sudah banyak macamnya dan memudahkan seseorang mendapatkan informasi yang dibutuhkan. Untuk mengamankan informasi yang sifatnya rahasia diperlukan suatu teknik pengamanan. Teknik tersebut dapat dilakukan dengan mengamankan secara fisik atau non fisiko Salah satu pengamanan secara non fisik yailu dengan mengenkripsi informasi rahasia menggunakan teknik kriplografi. People have always had a fascination with keeping infonnation away from others. The techniques needed to protect data belong to the field of cryptography. To construct a cryptographic algorithm, many arithmetic concepts are needed. In the last decade, the usual arithmetic concept was modular arithmetic. If the use of this arithmetic is associated with security aspect, then it requires large computational works. This thesis aims to construct a new arithmetic algorithm as an alternative to the previous algorithm. This new algorithm is called GF(2n) , which depends on intractability of the discrete logarithm problem similar to generalized ElGamal encryption.