Judul: Perbaikan tanah podsolik merah kuning lapisan bawah sebagai media pembibitan kopi robusta dengan pupuk hijau dan pupuk N
Abstrak: Tujuan percobaan ini adalah untuk mempelajari tentang pengaruh pemberian pupuk hijau dan pupuk N dalam media pembibitan yang menggunakan tanah Podsolik Merah Kuning lapisan bawah. Percobaan dilaksanakan di laboratorium lapang, Jurusan Budi Daya Pertanian, Fakultas Pertanian, Institut Pertanian Bogor, Darmaga IV, Bogor. Percobaan dimulai bulan Oktober 1987 dan berakhir pada bulan April 1988. Percobaan ini merupakan percobaan faktorial dua faktor yang disusun dalam Rancangan Acak Lengkap. Faktor media tumbuh terdiri atas empat macam, yaitu media tanah lapisan bawah saja., media campuran perbandingan tanah lapisan bawah dan pasir antara 2 1, media campuran antara dengan tanah lapisan bawah, pupuk hijau dan pasir dengan perbandingan 2: 0.5: 1 serta media campuran tanah lapisan bawah, pupuk hijau dan pasir dengan perbandingan 2: 1: 1. Faktor pemupukan N terdiri atas empat macam, yaitu tanpa pemupukan N, pupuk N dengan dosis satu kali, dua kali dan empat kali dosis paket. Peubah pertumbuhan yang diamati meliputi tinggi tanaman, diameter batang, jumlah daun, luas daun, jumlah akar primer, bobot basah akar dan tajuk serta bobot kering akar dan tajuk...
Keyword: 

Judul: Pengaruh media tumbuh dan pupuk NPK terhadap pertumbuhan bibit kopi robusta (Coffea canephora Pierre ex Froehner)
Abstrak: Percobaan ini bertujuan untuk mengetahui pengaruh beberapa komposisi media terhadap pertumbuhan bibit kopi robusta, serta untuk mengetahui dosis optimum pupuk N- P-K pada berbagai macam media tumbuh yang digunakan. Percobaan dilaksanakan di Laboratorium Lapang Jurus- an Budi Daya Pertanian, Fakultas Pertanian, Institut Per- tanian Bogor, Darmaga IV, Bogor. Berlangsung mulai bu- lan Oktober 1987 sampai bulan April 1988. Bahan tanaman yang digunakan berupa bibit kopi ro- busta varietas BP 358 x BP 42 yang terlebih dahulu dise- maikan selama 3 bulan. Bibit ditanam dalam kantung plastik berukuran 40 cm x 30 cm. Tanah yang digunakan adalah lapisan bawah Podsolik Merah Kuning (PMK) Jasinga. Percobaan ini merupakan percobaan Faktorial dua faktor yang disusun dalam Rancangan Acak Lengkap dengan tiga ulangan. Faktor media tumbuh terdiri atas tiga ta- raf yaitu campuran tanah lapisan bawah PMK, pasir dan pupuk kandang dengan perbandingan volume 2:1:1, 2:1:, 2:1:0. Faktor Demberian pupuk N-P-K terdiri atas empat taraf yaitu Ox dosis paket, 1 x dosis paket, 2 x dosis paket, 4 x dosis paket. Dosis paket adalah 6 a Urea, ...
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