Judul: Kombinasi Pupuk Organik dan Anorganik untuk Perbaikan Produksi Tanaman Umbi Garut (Maranta arundinaceae L.).
Abstrak: Tanaman garut merupakan tanaman umbi yang berpotensi dikembangkan di Indonesia karena mempunyai daya adaptif yang baik pada naungan dan tanah marginal dan kaya akan kandungan gizi. Walaupun demikian, tanaman ini belum banyak dikembangkan sehingga produksinya masih rendah. Kegiatan pemupukan merupakan salah satu upaya untuk meningkatkan produktivitas tanaman garut. Penelitian ini bertujuan untuk mendapatkan kombinasi pemupukan yang tepat terhadap pertumbuhan dan produktivitas tanaman garut. Penelitian ini dilaksanakan di Kebun Percobaan Cikabayan, Institut Pertanian Bogor, Dramaga, Bogor dari bulan November 2017 hingga Mei 2018. Rancangan yang digunakan yaitu Rancangan Kelompok Lengkap Teracak (RKLT) dengan perlakuan pemupukan sebagai faktor tunggal. Hasil penelitian menunjukkan bahwa pemberian pupuk anorganik nyata meningkatkan pertumbuhan dan hasil produksi umbi garut serta dapat mengurangi dosis pupuk kandang yang digunakan. Perlakuan pupuk kandang tanpa kombinasi dengan pupuk anorganik menghasilkan tinggi tanaman, jumlah anakan, jumlah daun, panjang dan lebar daun, bobot brangkasan, bobot umbi per tanaman, jumlah umbi, panjang umbi, diameter umbi dan kandungan tepung pati garut yang tidak berbeda dengan perlakuan kontrol pada umur 6 BST.
Keyword: kombinasi pemupukan, pupuk anorganik, pupuk kandang, rimpang

Judul: Respon Pemberian Pupuk Kompos Daun Gamal, Kaliandra, dan Lamtoro terhadap Pertumbuhan Tanaman Garut (Maranta arundinacea)
Abstrak: Teknologi agroforestri dalam pengelolaan lahan kawasan hutan bertujuan untuk meningkatkan produktivitas lahan secara berkelanjutan. Penelitian bertujuan: (1) menguji pengaruh pupuk kompos yang berasal dari serasah daun pada tiga jenis pohon yang berbeda terhadap pertumbuhan bibit garut, (2) menguji perbedaan pertumbuhan garut yang diberi berbagai jenis pupuk kompos dari serasah daun pada tiga jenis pohon yang berbeda, dan (3) untuk menentukan jenis kompos serasah daun yang terbaik untuk pertumbuhan bibit garut. Pengamatan dilakukan terhadap tinggi tanaman, jumlah daun, jumlah rumpun, produktivitas umbi, serta berat kering total pada 20 satuan amatan dengan model Rancangan Acak Lengkap (RAL). Data hasil penelitian kemudian dianalisis sidik ragamnya, kemudian apabila terdapat perbedaan nyata dilanjutkan uji lanjut DMRT. Hasil penelitian menunjukkan bahwa penggunaan pupuk kompos memiliki pengaruh yang signifikan terhadap tinggi tanaman dan jumlah daun. Namun, pupuk kompos tidak memiliki pengaruh terhadap jumlah rumpun, berat kering total, serta produktivitas umbi garut. Hasil penelitian menunjukkan bahwa pupuk kompos gamal memiliki produktivitas umbi terbanyak yaitu 37,73 gr/tanaman, diikuti dengan pupuk kompos lamtoro sebesar 33,98 gr/tanaman, serta pupuk kompos kaliandra yaitu 23,05 gr/tanaman.
Keyword: agroforestry, arrowroot, compost leaves, growth, tuber productivity

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