Judul: Pengaruh Jerami padi dan Seng Terhadap Seng Tanah, Pertumbuhan dan Serapan Seng Jagung (Zea mays L.), Pada Planosol Serang
Abstrak: Tujuan penelitian ini adalah untuk mengetahui pengaruh pemberian jerami padi dan seng pada Planosol Serang, dengan jagung sebagai tanaman indikator. Penelitian dilakukan di Rumah Kaca, Laboratorium Jurusan Tanah dan Laboratorium Agronomi BPTP Cimanggu. Tanah yang digunakan adalah Planosol Serang, yang ditumbuk dan disaring dengan ayakan berdiameter 5 mm. Takaran jerami padi yang digunakan adalah 0, 20, 40 dan 60 ton/ha, sedang takaran seng yang diberikan sebesar 0, 10, 20 dan 30 ppm. Rancangan penelitian yang digunakan adalah Rancangan Acak Lengkap, dengan uji kontras dan uji regresi.
Keyword: 

Judul: Pengaruh CaCo3 + Silikagen Dan Jerami Padi Terhadap Ketersediaan Dan Serapan N, P, K Tanaman Jagung (Zea mays L.) Pada Tanah Sulfat Masam Delta Telang Sumatera Selatan
Abstrak: Tujuan percobaan ini untuk mengetahui pengaruh kapur CaCO3, CaCO3 + Silikagel dan jerami padi terhadap tanaman jagung pada Tanah Sulfat Masam. Percobaan ini dilakukan di rumah kaca dengan menggunakan rancangan acak lengkap. Pengapuran diberikan setara dengan 0 ton, 10.6 ton CaCO3/ha 21.2 ton CaCO3/ha; 12.296 ton CaCO3+ Silikagel/ha dan 24.592 ton CaCO3+ Silikagel/ha. Sedangkan jerami padi di- berikan dalam dua taraf, yaitu setara nol dan 15 ton jerami padi tiap hektar. Hasil percobaan menunjukkan bahwa pengapuran cenderung meningkatkan N-total dan P-tersedia, sedangkan terhadap K-tersedia, kapur cenderung berpengaruh sebaliknya yaitu dapat menurunkan K-tersedia. Pemberian kapur juga dapat meningkatkan secara sangat nyata bobot kering tanaman. serapan N, serapan P dan serapan K, yang kesemuanya berpola kuadratik. Penambahan jerami padi dengan takaran 15 ton/ha ternyata cenderung menurunkan bobot kering tanaman, serapan N, dan serapan P, sedangkan terhadap N-total P-tersedia, K- tersedia dan serapan K, jerami padi cenderung meningkatkan.
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