Judul: Pengaruh perlakuan pematahan dormansi benih dan media perkecambahan terhadap viabilitas benih aren (Arenga pinnata (Wurmb) Merr)
Abstrak: Tujuan penelitian ini adalah untuk mempelajari pengaruh terbaik daru berbagai perlakuan benih dan media yang dapat mematahkan dormansi benih area. Pelaksanaan penelitian pada bulan Februari - Agustus 2006 di Laboratorium Ilmu dan Teknologi Benih IPB Turfgrass.
Keyword: 

Judul: Pengaruh Perlakuan Pematahan Dormansi dan Kedalaman Tanam terhadap Viabilitas Benih Aren (Arenga pinnata (Wurmb.) Merr.)
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh berbagai perlakuan pematahan dormansi dan kedalaman tanam terhadap viabilitas benih aren (Arenga pinna/a (Wurmb.) Merr.). Penelitian dilaksanakan di Laboratorium Ilmu dan Teknologi Benih Baranangsiang dan rumah kaea Jurusan Budi Daya Pertanian, Fakultas Pertanian, Institut Pertanian Bogor, mulai bulan Februari sampai dengan Agustus 1998. Penelitian disusun seeara faktorial menggunakan Raneangan Aeak Kelompok dengan dua faktor. Faktor pertama adalah pematahan dormansi benih yang terdiri atas tiga perlakuan yaitu: (PO) tanpa perlakuan pematahan dormansi (kontrol), (PI) perendaman benih dalam larutan GA3 500 ppm selama 24 jam dan (P2) perendaman benih dalam larutan KN03 0.2 % selama 24 jam. Faktor kedua adalah kedalaman tanam benih yang terdiri atas: (TI) benih ditanam di permukaan media tanam, (T2) benih ditanam sedalam dua em dari permukaan media tanam dan (T3) benih ditanam sedalam empat em dari permukaan media tanam. Pengamatan dilakukan terhadap Viabilitas Total dengan to 10k ukur potensi tumbuh maximum; Viabilitas Potensial dengan tolok ukur daya berkeeambah; Vigor Kekuatan Tumbuh dengan tolok ukur keeepatan tumbuh, spontanitas tumbuh, germination vallie; dan Vigor Kekuatan Tumbuh bibit dengan tolok ukur panjang akar, panjang seludang kotil, panjang seludang daun dan bobot kering bibit. Hasil penelitian menunjukkan bahwa pematahan dormansi dengan merendam benih dalam GA3 500 ppm selama 24 jam menghasilkan daya berkeeambah sebesar 7.8 %, keeepatan tumbuh sebesar 0.07 %/etmal, spontanitas tumbuh sebesar 5.6 %, germination vallie sebesar 0.000084, panjang akar 26.8 em, panjang seludang kotil 6.3 em, panjang seludang daun 6.9 em dan bobot kering bibit sebesar 4.0 gram dan hasil tersebut tidak berbeda nyata dengan benih tanpa perlakuan. Perlakuan perendaman benih aren dalam KN03 0.2 % selama 24 jam untuk mematahkan dormansi benih aren justru menurunkan Viabilitas Potensial, Vigor Kekuatan Tumbuh dan Vigor Kekuatan Tumbuh Bibit. Benih aren yang ditanam sedalam 4 cm di bawah permukaan media tanam memberikan nilai-nilai tertinggi untuk beberapa tolok ukur dari Vigor Kekuatan Tumbuh Bibit me skip un tidak berbeda nyata dengan benih yang ditanam sedalam 2 em di bawah permukaan media tanam, sedangkan benih yang ditanam di permukaan memberikan nilai terkeeil. Interaksi perlakuan pematahan dormansi dan kedalaman tanam benih aren berpengaruh nyata pada tolok ukur potensi tumbuh maximum. Pematahan dormansi benih aren menggunakan GA3 500 ppm, KN03 0.2 % maupun benih tanpa perlakuan tidak berbeda nyata bila ditanam sedalam 2 em. Tidak berbeda pula dengan benih tanpa perlakuan yang ditanam di permukaan serta pematahan dormansi benih menggunakan KN03 0.2 % kemudian ditanam sedalam 4 em. Interaksi perlakuan pematahan dormansi dan kedalaman tanam tersebut berbeda nyata dengan pematahan dormansi benih menggunakan GA3 500 ppm dan KN03 0.2 % bila ditanam di permukaan serta perlakuan pematahan dormansi benih menggunakan KN03 0.2 % maupun benih tanpa perlakuan yang ditanam sedalam 4 cm.
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