Judul: Penentuan Dosis Optimum Pupuk Nitrogen pada Kemangi (Ocimum basilicum) di Tanah Inceptisol.
Abstrak: Penelitian ini dilakukan untuk menentukan dosis optimum pupuk nitrogen yang dapat memberikan hasil maksimum pada produksi (Yield) tanaman kemangi aksesi KM4 di tanah Inceptisol. Penelitian ini dilakukan mulai 10 Juni 2015 sampai 15 Oktober 2015 di Kebun Percobaan ADS (Agribusiness Development Station), Dramaga, Bogor. Percobaan ini menggunakan Rancangan Kelompok Lengkap Teracak (RKLT). Perlakuan yang diberikan terdiri dari lima taraf yaitu, 0X, ¼X, ½X, ¾X dan X. Dimana X = 240 kg ha-1 N atau 533 kg ha-1 Urea. Masing-masing perlakuan dilakukan 4 kali ulangan. Dosis P dan K yang digunakan adalah 100 kg ha-1 P205 dan 100 kg ha-1 K20. Hasil penelitian menunjukkan perlakuan dosis N pada tanaman kemangi meningkatkan secara kuadratik bobot kering per tanaman kemangi dan meningkatkan secara linier bobot panen per tanaman, bobot panen per petak, bobot panen per hektar, jumlah cabang panen per tanaman, dan jumlah cabang panen per petak, jumlah cabang panen per hektar. Dosis rekomendasi pemupukan N di Inceptisol Dramaga adalah 154,05 kg ha-1., This study was conducted to determine the optimum rate of nitrogen fertilizer for basil on inceptisols. The study was conducted on 10th June 2015 until 15th October 2015 at ADS (Agribusiness Development Station) Experimental Farm, Dramaga, Bogor. The study was arranged in Randomized Complete Block Design (RCBD). There were 5 rates of N in this study, i.e. 0X, ¼X, ½X, ¾X, and X. Where X = 240 kg ha-1 or 533 kg ha-1 Urea. Each treatment was repeated 4 times. Rate of P and K were 100 kg ha-1 P205 and 100 kg ha-1 K20. The result of this study showed that N application increased quadratically dry weight per plant of basil and increased linearly yield per plant, yield per plot, yield per hectare, amount of branches per plant, and amount of branches per plot, amount of branches per hectare. Recommendation rate of N fertilizer on Inceptisols Dramaga is 154,05 kg ha-1.
Keyword: inceptisol, indigenous, kemangi, produksi, urea

Judul: Penentuan Dosis Optimum dan Waktu Pemberian Pupuk Kalium untuk Produksi Benih Kemangi (Ocimum tenuiflorum).
Abstrak: Kemangi (Ocimum tenuiflorum) adalah salah satu sayuran indigenos yang dikonsumsi daunnya dan diperbanyak menggunakan benih, namun budidaya untuk produksi benih belum banyak diteliti. Penelitian ini bertujuan menentukan dosis optimum dan waktu pemberian pupuk K yang tepat untuk produksi benih kemangi. Penelitian dilaksanakan pada bulan April-November 2015 di Kebun Percobaan PKHT IPB, Bogor dan di Laboratorium Penyimpanan dan Pengujian Mutu Benih, IPB. Penelitian ini menggunakan rancangan kelompok lengkap teracak (RKLT) dua faktor dengan empat ulangan. Faktor pertama adalah dosis pupuk K terdiri atas 0, 20, 40, 60, dan 80 kg K2O ha-1. Faktor kedua adalah waktu pemberian pupuk K yang diberikan saat tanam (satu kali), serta saat tanam dan pada 3 MST (dua kali). Hasil penelitian menunjukkan bahwa pemupukan K tidak mempengaruhi pertumbuhan vegetatif dan generatif tanaman kemangi, kecuali jumlah malai per tanaman. Dosis optimum pupuk K untuk jumlah malai per tanaman adalah 30,75 K2O ha-1. Pupuk K yang diberikan saat tanam dan saat tanaman berumur 3 MST meningkatkan produksi dan bobot 1.000 butir benih.
Keyword: bobot benih, kalium, malai, sayuran indigenos

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