Judul: Mengenali Jenis Bakteri Aerob di Ruang Praktikum dan Ruang Pembuatan Media
Abstrak: Jasad renik merupakan bioaerosol yang memengaruhi mutu udara ruangan. Jasad renik dapat berupa bakteri, protozoa, virus dan cendawan. Keberadaan bioaerosol di dalam ruangan dipengaruhi oleh suhu, kelembaban, pencahayaan, kepadatan hunian dan sistem sirkulasi udara. Penelitian ini bertujuan untuk mengenali bakteri aerob di ruang Praktikum dan ruang Pembuatan Media. Hasil penelitian mendapatkan lima jenis bakteri aerob, yaitu Staphylococcus aureus, S. epidermidis, Micrococcus sp., Bacillus sp., Pseudomonas sp. dan Moraxella sp..
Keyword: aerob, bakteri, bioaerosol

Judul: Keragaman Mikroba di Contoh Limbah Bulu Ayam dan Hasil Samping Organ Jeroan dari Rumah Pemotongan Hewan Unggas.
Abstrak: Rumah pemotongan hewan unggas menghasilkan hasil samping seperti jeroan dan limbah bulu yang mudah tercemar oleh jasad renik. Tujuan dari penelitian ini adalah untuk mengenali populasi jasad renik seperti bakteri dan cendawan pada contoh limbah bulu ayam dan hasil samping jeroan yang diperoleh dari rumah pemotongan hewan unggas. Bakteri dan cendawan diisolasi dari contoh jeroan dan bulu ayam. Pengambilan contoh dilakukan secara acak sebanyak tiga kali pengambilan. Pemeriksaan bakteri dilakukan berupa pemeriksaan angka lempeng total, bakteri bentuk koli, Staphylococcus aureus, dan Salmonella sp., sedangkan pemeriksaan cendawan dilakukan dengan subkultur untuk mengenali kapang dan khamir. Bakteri yang terisolasi yaitu bakteri bentuk koli, Escherichia coli, Salmonella sp., Staphylococcus sp., dan Staphylococcus aureus. Cendawan yang terisolasi yaitu Aspergillus flavus, Aspergillus fumigatus, Aspergillus niger, Geotrichum sp., Penicillium sp., dan Candida albicans.
Keyword: jasad renik, jasad renik pencemar, jeroan ayam, bulu ayam, RPH-U

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