Judul: Pengaruh Komposisi Media Tanam dan Rhizobakteri Pemacu Pertumbuhan Tanaman terhadap Pertumbuhan Bibit Pepaya.
Abstrak: Pepaya (Carica papaya L.) merupakan salah satu buah tropika yang telah dibudidayakan secara intensif di Indonesia. Penelitian ini bertujuan untuk mengetahui pengaruh komposisi media tanam dan konsentrasi suspensi plant growth promoting rhizobacteria (PGPR) yang tepat untuk pertumbuhan bibit pepaya di pembibitan dan di lapangan. Percobaan dilaksanakan pada bulan Juli hingga Desember 2016 di Kebun Tirta Mekarsari, Kecamatan Rancabungur, Kabupaten Bogor, dengan rancangan kelompok lengkap teracak (RKLT) 2 faktor dan 3 ulangan. Perlakuan terdiri atas suspensi PGPR dengan konsentrasi 0 ml/l, 5 ml/l, 10 ml/l dan 15 ml/l dan komposisi media tanam (1:1) yang terdiri atas kontrol tanah: pupuk kandang (M0), (1:1:2) tanah: pupuk kandang: arang sekam (M1), dan (1:1:2) tanah: pupuk kandang: cocopeat (M2) sehingga terdapat 12 kombinasi perlakuan. Hasil percobaan menunjukkan bahwa konsentrasi suspensi PGPR mempengaruhi tinggi tanaman, jumlah daun, diameter batang dan panjang daun tanaman pepaya di pembibitan dan di lapangan. Komposisi media tanam hanya berpengaruh terhadap tinggi tanaman pepaya di lapangan. Interaksi antara konsentrasi suspensi PGPR sebesar 15 ml/l (K3) dengan campuran media tanam tanah dan pupuk kandang (M0) tidak berbeda dengan campuran media tanam tanah, pupuk kandang dan arang sekam (M1) yang mendukung pertumbuhan bibit yang baik.
Keyword: Carica papaya L., cocopeat, pupuk kandang

Judul: Pertumbuhan Bibit Pepaya pada Berbagai Komposisi Media Tanam
Abstrak: Pepaya merupakan buah tropika yang lebih efisien diperbanyak dengan biji. Media pembibitan yang biasa digunakan oleh petani pepaya adalah campuran tanah dan bahan organik yang berat, sehingga kurang praktis dalam transportasi dan distribusi bibit. Penelitian ini bertujuan untuk memperoleh media pembibitan yang ringan namun dapat mendukung pertumbuhan bibit pepaya hingga siap tanam di lapangan. Percobaan dilakukan dari bulan Januari sampai Juni 2013 di Kebun Percobaan Pusat Kajian Hortikultura Tropika IPB Pasirkuda Ciomas, Bogor, dengan rancangan kelompok lengkap teracak 1 faktor dan 3 ulangan. Perlakuannya adalah komposisi media tanam yang terdiri dari 3 jenis bahan dengan perbandingan volume 1:1:1 yaitu tanah + pupuk kandang ayam + arang sekam, tanah + pupuk kandang ayam + sekam, tanah + pupuk kandang ayam + cocopeat, tanah + pupuk kandang ayam + serbuk gergaji, tanah + kompos + arang sekam, tanah + kompos + sekam, tanah + kompos + cocopeat dan tanah + kompos + serbuk gergaji. Hasil percobaan menunjukkan bahwa komposisi media tanam mempengaruhi tinggi tanaman, jumlah daun, diameter batang dan waktu tunas bunga pertama muncul. Komposisi media tanam tanah + pupuk kandang ayam + sekam dan tanah + pupuk kandang ayam + cocopeat merupakan komposisi media tanam yang memiliki bobot bibit per polybag paling ringan dan memberikan pertumbuhan optimum pada bibit pepaya di polybag dan di lapangan. Komposisi media tanam tanah + pupuk kandang ayam + sekam memiliki biaya produksi yang lebih murah dibanding komposisi media tanam tanah + pupuk kandang ayam + cocopeat.
Keyword: arang sekam, cocopeat, pembibitan, pupuk kandang ayam, sekam

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