Judul: Aritmetika Field Biner Menggunakan GMP Library dalam Pemrograman Prosedural C
Abstrak: Almost all cryptographic algorithms involve the construction of integer arithmetic operations. The operations is referred to huge operation to an integer value in order to support the level of security of a cryptosystem. Related to this, the arithmetic operations in binary field is needed to construct various cryptographic algorithms. Binary field arithmetic implementation starts with the representation of its members, who then will be done by operating the addition, multiplication, reduction, and inversion. Each operation is simulated in 1024 bit length or more. Unlike the addition of polynomial operations that are directly applicable in the binary field , multiplication operations require reduction step necessary to build . Through experiments conducted for three types of reduction each Trinomial, Pentanomial, and Full Polynomial, apparently Full Polynomials provide the most high-speed reduction.
Keyword: 

Judul: Implementasi aritmetika Optimal Extension Field (OEF) menggunakan bahasa pemrograman C
Abstrak: Cryptography is the science to keep the message secure. Cryptography involves encryption and decryption of messages. Nowadays, the minimum key size for public key cryptography to reach the minimum security is claimed to be 1024 bit (RSA). With somekind of algorithm, the desktop computer that has 32 bit machine architecture could compute a number with that size easily, but not with the smaller machine that has only 8 bit or 16 bit architecture like handphones and smart cards. Those small machines need more time or maybe unable to compute a number with that size. Elliptic Curve Cryptography (ECC) is the solution of this problem. ECC has a great advantage. It can give a high security level of cryptography with smaller key size. As an example, ECC key with the size of 160 bit is claimed to be at the same level of security as compared to the conventional RSA key with 1024 bit of size. ECC implements a different kind of arithmetic field than that of the usual cryptosystem.
Keyword: 

Judul: Karakteristik Anatomi Skelet Kepala Buaya senyulong (Tomistoma schlegelii).
Abstrak: Buaya sepit atau senyulong (Tomistoma schlegelii) merupakan jenis buaya asli Indonesia yang berhabitat di sungai-sungai Sumatera, Kalimantan, dan juga pedalaman Sulawesi. Salah satu ciri khas buaya senyulong adalah bentuk moncong yang runcing dan sempit, namun hingga saat ini informasi mengenai struktur skelet kepala buaya senyulong sangat terbatas. Penelitian ini bertujuan untuk mempelajari karakteristik anatomi skelet kepala buaya senyulong yang dikatikan dengan fungsi dan perilakunya. Penelitian dilakukan secara eksploratif dengan melakukan pengamatan, pencatatan, dan pengambilan gambar dari skelet kepala buaya senyulong. Skelet kepala berukuran panjang 70 cm, lebar 29 cm, dan tingggi 17 cm dengan permukaan kasar pada os nasale, os frontale, os maxilla, os mandibula, os lacrimale, os jugale. Jumlah gigi pada buaya ini sebanyak 78 buah, terdiri dari 4 buah gigi premaxila, 16 buah gigi maxila, dan 19 buah gigi mandibula. Pada regio orbitalis ditemukan dua pasang fenestrae temporales yang berkembang baik. Fenestra supratemporale merupakan lubang oval yang membentang di sepanjang os parietale. Fenestra infratemporale berbentuk segitiga dan dibatasi oleh os squamosum, os postorbitale, os jugulare, dan os quadratum. Os mandibula hewan ini mempunyai symphysis mandibularis yang panjang yaitu garis yang melintang di corpus mandibulae. Secara fungsional ukuran symphysis mandibularis berkaitan dengan adaptasi hewan terhadap diet makan.
Keyword: kepala, moncong, Tomistoma schlegelii