Judul: Penyandian File Teks Menggunakan Algoritma AES (Advanced Encryption Standard)
Abstrak: Perkembangan teknologi dan informatika saat ini sangatlah pesat, sehingga diperlukan adanya kriptografi sebagai upaya pengamanan data. Algoritma Advanced Encryption Standard (AES) termasuk ke dalam sistem kriptografi modern yang simetris. Algoritma AES yang umum dipakai saat ini adalah AES-128, AES-192 dan AES-256. Penelitian ini merekonstruksi tahapan-tahapan algoritma AES baik secara teknis implementasi maupun konsep matematika yang digunakan, serta menerapkan algoritma AES dalam penyandian file teks dan mengukur run-time algoritma tersebut. Algoritma AES diawali dengan mengubah plaintext menjadi sejumlah blok teks berukuran 128 bit, serta melakukan proses key scheduling untuk memperoleh sejumlah round key. Proses enkripsi meliputi AddRoundKey dengan menggunakan round key yang telah diperoleh, ShiftRows, SubBytes dan MixColumn sebanyak beberapa putaran. Proses dekripsi AES merupakan kebalikan dari proses enkripsi. Proses-proses pada algoritma AES terjadi di sebuah lapangan yang disebut Galois Field (GF(2^8)). Berdasarkan hasil yang diperoleh, waktu yang diperlukan untuk mengenkripsi dan dekripsi file meningkat secara linear tergantung pada ukuran file., The current development of technology and informatics has been advanced rapidly, hence the need for cryptography as an effort to secure data. The Advanced Encryption Standard (AES) algorithm belongs to the category of modern symmetric cryptography. The commonly used AES algorithms today are AES-128, AES-192, and AES-256. This research reconstructs the stages of the AES algorithm, both in technical implementation and the mathematical concepts employed. It also applies the AES algorithm in encoding text files and measures the algorithm's run-time. The AES algorithm starts by converting plaintext into a series of text blocks, each sized at 128 bits. It also undergoes a key scheduling process to obtain a set of round keys. The encryption process involves AddRoundKey using the obtained round key, followed by ShiftRows, SubBytes, and MixColumn for several rounds. The decryption process in AES is the reverse of the encryption process. These processes in the AES algorithm occur in a field known as Galois Field (GF(2^8)). Based on the obtained results, the time required for encrypting and decrypting files increases linearly depending on the file size.
Keyword: AES, algorithm, cryptography, Galois Field, security

Judul: Analisis dan Implementasi Algoritme Advanced Encryption Standard (AES) Secara Paralel
Abstrak: AES is an algorithm for symmetric key cryptography. AES is expected to replace Data Encryption Standard (DES) as a recognized standard for various applications. The complexity of AES encryption and decryption process is O(n), it has fast computation in both encryption and decryption but its execution time will increase as the input data increase. In this research the AES algorithm would be parallelized by dividing the data to each processor (domain decomposition) and by dividing the constituent computing of AES to each processor (functional decomposition), and their performance would be analyzed. Parallel implementation of AES algorithm uses Message Passing Interface (MPI). The objectives of this research are to measure and analyze the performance of parallel AES algorithm using performance metrics. The best result of the parallel AES algorithm in this research is in the decryption process using domain decomposition method. A file with 118.525 MB size has 127.227 seconds decryption execution time using sequential AES algorithm, whereas using 16 processors, its decryption execution time is 34.896 seconds. The speedup is 3.646 and the efficiency is 0.228. This result is not good enough because the speedup is not equal to the number of processors used and the efficiency is below one. This is because the AES decryption in this research has a fast computational process, yet it has a big overhead for data communication. The worst result of the parallel AES algorithm is in the decryption process using functional decomposition method. Using the same file and three processors, the decryption execution time is 168.089 seconds. The speedup is 0.755 and the efficiency is 0.252. This is due to the fact that computing process decomposition is not equally distributed among the processes and the use of MPI blocking communication routine which cause a big overhead for data communication. Both parallel algorithms used in this research are not cost-optimal
Keyword: 

Judul: Etno-ornitologi Burung Kancilan Flores (Pachycephala nudigula nudigula Hartert 1897) pada Masyarakat Lio di Taman Nasional Kelimutu
Abstrak: Bare-throathed whistler is one of several wild birds in Kelimutu National Park (TNKL) that is believed to have correlation with Lio Community‟s belief. The estimation of Bare-throated whistler‟s population in Kelimutu National Park was about 186.41-1668.07 individual by the density about 0.0389-0.3481 ind/ha with the sex ratio 6.2:1 that spreaded on area with height of 1100 – 1600 masl. The characteristic of Bare-throated whistler‟s habitat is a natural forest with various canopy level, high plant species diversity and high density. The habitat characteristics related to the availability of food in the form of insects, cover, safety and a nesting site. Generally the most of Lio community knew the existence of Bare-throated whistler directly or from their parents‟ stories. The perceptions of Lio Community to the Bare-throated whistler‟s existence is generally support the conservation efforts. The perceptions construct the Lio Community‟s atitude that tend to be conservative to the existence of Bare-throated whistler. The attitude shown by their behavior that not cathing the Bare-throated whistler from the TNKL‟s area or the outside. The attitude have an important role to the existence of Bare-throated whistler in Kelimutu National Park‟s area.
Keyword: