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: Pengaruh Bahan Tanam dan Waktu Pemupukan Pupuk Kandang terhadap Pertumbuhan Garut (Maranta arundinaceae L.)
Abstrak: Tanaman garut (Maranta arundinaceae L.) merupakan tanaman umbi-umbian yang digolongkan dalam famili Marantaceae dan dikelompokkan pada umbi-umbian minor. Peningkatan produktivitas garut dapat dilakukan melalui pemupukan dan penggunaan bahan tanam. Penelitian ini bertujuan mempelajari pengaruh bahan tanam dan pemberian pupuk kandang sapi, serta interaksinya terhadap pertumbuhan dan produktivitas tanaman garut. Penelitian dilaksanakan di Kebun Percobaan Cikabayan IPB, Dramaga, Bogor dari bulan Februari hingga Agustus 2019. Percobaan pertama menggunakan Rancangan Kelompok Lengkap Teracak (RKLT) dengan faktor tunggal, pengaruh bahan tanam. Bahan tanam bagian tengah umbi menghasilkan rataan jumlah stek bertunas dan jumlah tunas per stek tertinggi. Percobaan kedua menggunakan Rancangan Split Plot dengan petak utama waktu pemupukan dan anak petak perlakuan bahan tanam. Perlakuan waktu pemupukan tidak mempengaruhi peubah yang diamati. Perlakuan bagian umbi sebagai bahan tanam memberikan pengaruh pada tinggi anakan, dan jumlah anakan saat 12 dan 20 MST, kehijauan daun tanaman induk dan anakan serta bobot kering brangkasan, bobot segar brangkasan tanaman garut.
Keyword: produktivitas, sumber karbohidrat, pupuk kandang, bibit

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