Judul: Pemberian konsentrat dengan dan tanpa monensin pada domba
Abstrak: Penelitian ini bertujuan untuk mengevaluasi pengaruh penambahan monensin pada ransum domba yang berupa konsentrat Beef kwik SPT 4. ...
Keyword: Animal feeding, domba

Judul: Performa Domba Lokal dengan Pemberian Pakan Konsentrat Komersial dan Sorinfer pada Taraf yang Berbeda
Abstrak: Performa domba dipengaruhi oleh beberapa aspek seperti manajemen pakan. Penelitian bertujuan mengkaji performa domba lokal dengan pemberian pakan kombinasi sorinfer terhadap performa produksi domba lokal. Domba yang digunakan adalah domba betina lokal betina yang berumur 1-2 tahun (I0- I1) sebanyak 15 ekor dengan rataan bobot awal 19,38±3,11 kg. Penelitian menggunakan 3 perlakuan ransum yaitu konsentrat yang dikombinasikan dengan silase sorinfer dengan rasio P1 75:25, P2 50:50, P3 25:75. Peubah yang diamati adalah konsumsi ransum as feed, bahan kering (BK), protein kasar (PK), energi (TDN), konversi ransum as feed, BK, pertambahan bobot badan (PBB), bobot akhir, serta feed cost per gain (FCG). Data dianalisis kovarian (ANCOVA) menggunakan Statistical Product and Service Solution (SPSS) yang diuji lanjut dengan metode Duncan. Hasil penelitian menunjukkan konsumsi ransum as feed, BK, PK pada perlakuan P1 nyata lebih tinggi (P<0,05) dibandingkan dengan perlakuan lainnya. Nilai TDN, konversi as feed, konversi BK, PBB, dan FCG ketiga perlakuan tidak berbeda nyata (P>0,05). Perlakuan P1 menghasilkan performa domba terbaik berdasarkan konsumsi as feed, konsumsi BK, dan konsumsi PK.
Keyword: Domba Lokal, Konsentrat, Performa, Sorinfer

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