Judul: Tinjauan Kekebalan Beberapa Penyakit Protozoa Darah pada Sapi di Indonesia
Abstrak: Di Indonesia beberapa pcnyzkit yang disebabkan oleh protozoa darah sangat menirnbulkan wzbak yang sangat merugikan usaha-usaha pet ernakan. Sarnpai saat ini penyakit protozoa darah seperti Babesiosis, Theileriosis dan Try panosomiasis serta parasit darah dari golongan Rickettsia yang menyebabkan Anaplasmosis sudah menyebar hampir seluruh wilayah Indonesia. Dalam penularan penyakit-penyakit ini kepada sapi dan kerbau diperlukan vektor.
Keyword: 

Judul: Infeksi Parasit Darah pada Sapi Perah di Kawasan Usaha Ternak (KUNAK) Cibungbulang, Kabupaten Bogor
Abstrak: Kasus penyakit yang disebabkan oleh parasit darah umumnya bersifat kronis, namun pada beberapa kasus ada yang bersifat akut. Kerugian ekonomi yang disebabkan oleh penyakit parasit darah dapat berupa pertumbuhan terhambat, penurunan bobot badan, penurunan daya reproduksi, penurunan produksi susu, dan abortus. Penelitian ini bertujuan untuk mengetahui keberadaan parasit darah dan tingkat parasitemia pada sapi perah di kawasan usaha ternak (KUNAK) Cibungbulang, Kabupaten Bogor. Terdapat 100 sampel darah sapi perah dalam penelitian ini yang terdiri dari 21 sampel dari kelompokm umur ≤ 2 tahun dan 79 sampel dari kelompok umur >2 tahun. Variabel yang diamati adalah presentase hewan yang terinfeksi dan tingkat infeksi dengan mengetahui persentase parasitemia. Hasil penelitian dari 100 sampel ditemukan 69 ekor yang terinfeksi (69%). Ada 3 jenis parasit darah yang ditemukan dalam penelitian ini yaitu Babesia sp., Anaplasma sp. dan Theileria sp.. Persentase hewan terinfeksi parasit tertinggi yaitu Theileria sp. (50%), kemudian Anaplasma sp. (15%) dan terendah Babesia sp. (4%).Persentase parasitemia pada berbagai tingkat umur memiliki nilai sama yaitu kurang dari 1%, yang tergolong dalam tingkat parasitemia rendah
Keyword: parasit darah, tingkat infeksi, persentase parasitemia

Judul: Algorithm construction of HLI hash function
Abstrak: Cryptography is a study of mathematical techniques related to aspects of information security regarding on confidentiality, data integrity, entity authentication, and data origin authentication. Data integrity is a service, which is associated with the conversion of data carried out by unauthorized parties. To maintain data integrity, one can use hash functions. An hash function is a computationally efficient function to map an arbitrary length bitstring to a fixed length bitstring called as hash value. The use of hash function in maintaining the information integrity and authentication is in digital signatures, virus protection, and software distribution. Illustration of the hash function in the integrity and authentication of information that is emailed as follow. The sender sends the information and hash value to the recipient. If the hash value of the information is equal to the hash value that is sent by the sender, then information has not been changed. Otherwise the information has been changed. An hash function has two properties, one way and collision resistance. An hash function is called one way if it is computationally infeasible to find any input such that when given any hash value . Meanwhile an hash function is called collision resistant if it is computationally infeasible to find any two inputs where such that . The purpose of this study is to construct a HLI hash function algorithm, to analyze the speed and security of the hash functions as a results of construction. Furthermore, it is to compare it with SWIFFT. Hash function is constructed based on the result of algebraic operations on modular polynomial ringwith . Modular polynomial ring noted as is a set of all polynomials of degree at most with coefficients in . can be represented as a set of integer vector of modulo in dimension . So, it is simple to implement in a computer. In vector operations, is lattice . Furthermore, alattice that is defined from certain polynomial ring is called ideal lattice. HLI hash function is consists of addition and multiplication algorithm in the ring. Addition algorithm consists of sumation operations of modulo and multiplication consists of multiplication operations of modulo . Generally, algorithm of HLI hash function consists of multiplication operations of modulo and addition operations of modulo . However, if the input is binary number then multiplication algorithm only consists of multiplication operation of modulo , so algorithm of HLI hash function consists of multiplication operations of modulo and addtion operations of modulo . An hash function is secured if it has two properties, i.e., one way and collision resistance. HLI hash function hash is one way, it is following the proof of Micciancio. It is has collision resistant because of polynomial is irreducible over and monic. Moreover, it is proved that for every unit vector , the vector is small vector. If the input of hash function is a binary number then HLI hash function only involves addition operations of modulo . So the time that used almost same with SWIFFT. The excellence of HLI hash function is the key size smaller than SWIFFT. This effect on
Keyword: hash function, modular polynomial ring, lattice