Judul: Pengaruh kombinasi auksin dan sitokinin terhadap organogenesis eksplan melinjo (Gnetum gnemon Linn.)
Abstrak: Perbanyakan melinjo dengan menggunakan teknik in vitro sangat memungkinkan. Sebagai bahan eksplan tunas terminal jauh le bih baik daripada tunas buku tunggal pertama. Pertumbuhan tunas sangat dipengaruhi oleh kinetin. Kinetin 1.5-2.0 mg/1 paling baik untuk pertumbuhan tunas. Persentase tumbuh eksplan dipengaruhi oleh interaksi antara IAA dan kinetin Kombinasi IAA rendah (0.1 mg/1) dengan kinetin tinggi (2. 3.0 mg/l), IAA agak tinggi (0.3 mg/1) dengan kinetin agak rendah samapai tinggi (1.5-2.5 mg/1), dan IAA tinggi (0.5 mg/1) dengan kinetin rendah sampai tinggi (0.5-2.5 mg/1).
Keyword: Gnetum gnemon, Biotechnology sitokin, Auksin

Judul: Pengaruh Kombinasi Pemangkasan Akar dan Waktu Inokulasi Fungi Ektomikoriza terhadap Pertumbuhan Bibit Melinjo (Gnetum gnemon L)
Abstrak: Inokulasi fungi ektomikoriza yang dilakukan setelah kegiatan pangkas akar dapat meningkatkan kolonisasi fungi ektomikoriza dan pertumbuhan bibit melinjo. Penelitian bertujuan mengetahui pengaruh kombinasi pemangkasan akar dan waktu inokulasi fungi ektomikoriza terhadap pertumbuhan bibit melinjo (Gnetum gnemon L). Penelitian ini menggunakan rancangan acak lengkap (RAL) faktorial, dengan 2 faktor yaitu tingkat pangkas akar (0% dan 30%) dan waktu inokulasi fungi ektomikoriza yaitu pada minggu ke-1, 2, 3, 4 dan 5 setelah kegiatan pangkas akar/penyapihan. Hasil penelitian menunjukkan bahwa perlakuan pangkas akar berpengaruh nyata terhadap jumlah akar yang bercabang, banyaknya cabang baru, tinggi, dan diameter batang bibit melinjo. Waktu inokulasi fungi ektomikoriza berpengaruh nyata terhadap peubah diameter batang bibit melinjo. Kombinasi perlakuan pangkas akar dan waktu inokulasi fungi ektomikoriza berpengaruh terhadap pertumbuhan bibit melinjo. Pertumbuhan bibit melinjo terbaik diperoleh pada kombinasi perlakuan (1) bibit melinjo yang tidak dipangkas akarnya dan diinokulasi pada saat penyapihan (minggu ke-1), dan (2) bibit melinjo yang dipangkas akarnya 30% dan dinokulasi pada minggu ke-3 setelah kegiatan pangkas akar/penyapihan.
Keyword: ectomycorrhiza, Gnetum gnemon, root pruning, inoculation period

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