Judul: Pengaruh Beberapa Perilaku Pendahuluan Benih Sentro (Centrosema pubencens. Benth) Dan Kedalaman Tanam Daya Kecambah Dan Pertumbuhan Awal
Abstrak: Penelitian dilakukan di rumah kaca dan laboratori- um Ilmu Makanan Ternak Fakultas Peternakan. Institut Pertanian Bogor. Penelitian dimulai 27 November sampai dengan 15 Januari 1984. Rancangan yang dipergunakan adalah faktorial 4 x 6 dengan pola dasar rancangan acak berblok, blok sebagai ulangan untuk rumah kaca. Untuk dalam germinator digunakan rancangan acak lengkap. Perlakuan pendahuluan benih yang dilakukan adalah merendam benih dalam air panas selama 15 menit, meren- dam benih dalam asam sulfat 24 N selama 7 menit, menggo- sokkan benih pada kertas amplas dan sebagai kontrol ada- lah tanpa perlakuan pendahuluan. Pada percobaan ini kedalaman tanam yang dilakukan adalah 0 cm, 1 cm, 2 cm, 3 cm, 4 cm dan 5 cm. Hasil penelitian menunjukkan perlakuan pendahuluan benih dengan menggosokkan benih pada kertas amplas meng- hasilkan persentase perkecambahan tertinggi (P0.05) yakni 42.78 %. Selanjutnya kedalaman tanam sangat ber- pengaruh (P / 0.01) terhadap persentase perkecambahan dan kedalaman tanam 3 centimeter cenderung menghasilkan persentase perkecambahan yang terbaik bagi benih Centro- sema pubescens. Benth yakni 32.50 %.
Keyword: 

Judul: Pengaruh Wadah dan Lama Penyimpanan Terhadap Viabilitas Benih Centro (Centrosema pubescens Benth)
Abstrak: Penelitian ini bertujuan untuk mempelajari pengaruh be- berapa jenis wadah dan lama penyimpanan terhadap kadar air, daya kecambah, persentase benih keras dan persentase benih hidup dari benih Centro (Centrosema pubescens Benth). Penelitian ini dilaksanakan di rumah penulis sendiri (penyimpanan) dan di laboratorium bagian Ilmu Tanaman Makan- an Ternak, Jurusan Ilmu Nutrisi dan Makanan Ternak, Fakultas Peternakan, Institut Pertanian Bogor, selama 20 minggu sejak tanggal 13 November 1982 sampai dengan tanggal 1 April 1983. Dalam penelitian ini benih yang berasal dari Jepara, Jawa Tengah, yang berkadar air 9.49%, daya kecambah 82.46%, dan kemurnian 90%, disimpan dalam empat jenis wadah, yakni wadah kaleng, wadah plastik, wadah goni, dan dihampar, ma- sing-masing 1 kg. Lama penyimpanan untuk masing-masing wadah adalah O minggu, 5 minggu, 10 minggu, 15 minggu dan 20 ming- gu. Pengujian dilakukan terhadap kadar air, daya kecambah, persentase benih busuk, persentase benih keras dan persenta- se benih hidup (dengan larutan 0.1% tetrazolium). Pengecam- bahan dilakukan dengan memakai subtrat kapas pembalut (meto- da diatas kapas) dan subtrat kertas merang (metoda antar ker- tas). Rancangan percobaan yang digunakan adalah rancangan acak lengkap dengan percobaan faktorial berdasarkan jenis wadah dan lama penyimpanan. Hasil penelitian menunjukan bahwa pengaruh wadah dan lama penyimpanan terhadap kadar air, daya kecambah, persen- tase benih busuk, persentase benih keras, dan persentase be- nih hidup sangat nyata (P/ 0.01). Sedangkan interaksinya memberikan pengaruh sangat nyata (P/ 0.01) terhadap kadar a- ir, daya kecambah, dan pengaruh nyata (P/ 0.05) terhadap persentase benih busuk, persentase benih keras, serta tidak berpengaruh terhadap persentase benih hidup....
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