Judul: Pengaruh Konsentrasi NH4NO3 dan KNO3 terhadap Pertumbuhan dan Perkembangan Tunas Mikro Kentang (Solanum tuberosum L.)
Abstrak: Tujuan penelitian ini untuk melihat pengaruh konsentrasi NH4N03 dan KN03 terhadap pertumbuhan dan perkembangan tunas mikro ken tang PAS 4050. Percobaan dilakukan di Laboratorium kultur jaringan, Jurusan Budi Daya Pertanian, Institut Pertanian Bogor. Konsentrasi NH4N03 dan KN03 nyata mempengaruhi pertumbuhan tunas mikro kentang. Pada dasarnya untuk respon pertumbuhan yang Iebih baik, dibutuhkan sumber N berupa NH4+ dan N03- dalam jumlah dan perbandingan tertentu.
Keyword: 

Judul: Pengaruh Jenis dan Konsentrasi Retardan Ancymidol, B-9, dan Paclubutrazol Terhadap Pertumbuhan Tunas Mikro Kentang In Vitro
Abstrak: Kentang merupakan tanaman pangan penunjang program diversifikasi yang mengandung keseimbangan gizi yang baik antara jumlah kalori dan protein. Rendahnya produksi kentang di Indonesia dan negara-negara berkembang lainnya dipengaruhi oleh beberapa faktor kendala yaitu, iklim, teknik budidaya dan masalah pembibitan. Masalah bibit yang ada di Indonesia bertitik tolak dari biaya bibit yang mahal. Hal ini disebabkan karena sulitnya memproduksi umbi bibit yang berkualitas tinggi, sehingga mendorong dilakukannya impor bibit. Teknik Kultur jaringan merupakan alternatif pemecahan masalah yang paling potensial dalam penyediaan bibit Kentang yang bermutu. Salah satu penerapan teknik kultur Jaringan dalam produksi bibit kentang adalah penggunaan stek mikro sebagai bahan perbanyakan. Penelitian ini bertujuan untuk mempelajari pengaruh jenis dan konsentrasi retardan ancymidol, B-9 dan paclobutrazol terhadap pertumbuhan tunas in vitro kentang. Rancangan percobaaan yang digunakan adalah Rancangan Acak Lengkap dengan faktor konsentrasi retardan tersarang dalam faktor jenis retardan. Faktor terdiri dari 3 taraf B-9 dan paclobutrazol...
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