Judul: Penggunaan Zat Pengatur Tumbuh dalam Perkecambahan Benih Bengkuang (Pachyrhizus erosus L.).
Abstrak: Penelitian ini bertujuan mengetahui pengaruh pemberian zat pengatur tumbuh dan menentukan metode efektif untuk meningkatkan viabilitas dan vigor benih bengkuang serta menentukan pengamatan hitungan pertama dan kedua pada perkecambahan benih bengkuang. Penelitian dilaksanakan dari bulan Juni hingga Agustus 2018 di rumah kaca Kebun Percobaan Cikabayan dan Laboratorium Pengujian dan Penyimpanan Benih, Departemen Agronomi dan Hortikultura, Fakultas Pertanian, Institut Pertanian Bogor. Penelitian menggunakan Rancangan Kelompok Lengkap Teracak dua faktor yaitu jenis larutan (Kontrol, Aquades, GA3 50 ppm, GA3 100 ppm, BAP 50 ppm dan GA3+BAP 50 ppm) dan lama perendaman (5 jam dan 10 jam). Hasil penelitian menunjukkan bahwa terdapat interaksi antara jenis larutan dan lama perendaman terhadap perkecambahan benih bengkuang. Perlakuan paling efektif untuk meningkatkan viabilitas dan vigor benih bengkuang adalah perendaman dengan aquades selama 5 jam. Perlakuan tersebut menghasilkan daya berkecambah yaitu 93.3%, potensi tumbuh maksimum 93.3%, indeks vigor 68% dan kecepatan tumbuh 9.4% etmal-1.
Keyword: daya berkecambah, viabilitas, vigor

Judul: Pengaruh perlakuan pra perkecambahan dan jenis media perkecambahan terhadap viabilitas benih mengkudu ( Morinda citrifolia L. )
Abstrak: Penelitian ini dilakukan untuk mengetahui pengaruh perlakuan pra perkecambahan dan jenis media perkecambahan terbaik bagi viabilitas benih mengkudu. Penelitian dilaksanakan di Laboratorium Ilmu dan Teknologi Benih dan Rumah Kasa Leuwikopo Darmaga, Bogor mulai bulan Maret 2004 dan berakhir pada bulan Juni 2004. niversit Penelitian ini disusun secara faktorial dengan Rancangan Acak Kelompok menggunakan dua faktor. Faktor pertama adalah perlakuan pra perkecambahan dengan delapan macam perlakuan yaitu kontrol (P₁), digunting (P2), direndam KNO3 1% selama 24 jam (P3), direndam KNO3 2% selama 24 jam (P4), direndam dalam air hangat dengan suhu 47 °C selama 15 menit (Ps), digunting kemudian direndam KNO3 1% selama 24 jam (P6), digunting kemudian direndam KNO3 2% selama 24 jam (P7) dan digunting kemudian direndam dalam air hangat dengan suhu 47 °C selama 15 menit (Ps). Faktor kedua adalah jenis media perkecambahan benih yang terdiri dari tiga macam perlakuan, yaitu pasir (M₁), arang sekam (M2) dan media campuran tanah dan kompos dengan perbandingan 1:1 b/b (M3). Masing-masing perlakuan diulang tiga kali sehingga terdapat 72 satuan percobaan. Pengamatan dilakukan terhadap parameter Viabilitas Total dengan tolok ukur potensi tumbuh maksimum (PTM), Viabilitas Potensial dengan tolok ukur daya berkecambah (DB) dan Vigor Kekuatan Tumbuh dengan tolok ukur kecepatan tumbuh (Kcr) dan vigor bibit. Hasil penelitian menunjukkan bahwa perlakuan pra perkecambahan tidak berpengaruh nyata terhadap semua tolok ukur yang diamati kecuali tolok ukur vigor bibit berdasarkan jumlah daun. Jenis media perkecambahan berpengaruh sangat nyata terhadap semua tolok ukur yang diamati, sedangkan interaksi antara perlakuan pra perkecambahan dan jenis media tidak berpengaruh nyata terhadap semua tolok ukur yang diamati...
Keyword: 

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