Judul: Pembiakan Saninten (Castanopsis Argentea (Blume) A.Dc.) Melalui Stek Pucuk Dengan Zat Pengatur Tumbuh Komersial
Abstrak: Saninten (Castanopsis argentea (Blume) A.DC.) merupakan salah satu jenis pohon asli Indonesia yang bernilai tinggi dan memiliki buah yang bisa dikonsumsi sehingga kegiatan perbanyakan tanaman secara vegetatif perlu dilakukan. Tujuan penelitian ini adalah menguji pengaruh zat pengatur tumbuh (ZPT) komersial dan media tanam yang berbeda, serta interaksi keduanya terhadap pertumbuhan stek pucuk saninten. Penelitian ini menggunakan rancangan acak lengkap (RAL) dua faktor. Faktor pertama yaitu ZPT komersial dari Rootone-F, Rapid root, dan air kelapa. Faktor kedua yaitu media tanam berupa tanah, tanah arang sekam (1:1), dan pasir kompos (1:1). Pada penelitian ini persentase hidup stek sebesar 92.78% dan persentase berakar sebesar 40.56%. Hasil penelitian menunjukkan bahwa saninten dapat distek tanpa menggunakan ZPT komersial. Namun, interaksi ZPT dari air kelapa dengan media tanam pasir kompos memiliki respon jumlah akar primer dan sekunder tertinggi dan berbeda nyata dengan interaksi perlakuan lainnya.
Keyword: Castanopsis argentea, stek pucuk, zat pengatur tumbuh

Judul: Pengaruh Dosis Pupuk Akar dan Pupuk Daun terhadap Pertumbuhan Bibit Saninten (Castanopsis argentea Blume A.DC)
Abstrak: Saninten (Castanopsis argentea) is one species of the tree producing wood, fruit, and also dye from the skin of fruit and bark that has economic value. Good quality of seed is necessary to get an optimal production. So we need to stimulate the growth, one of them by root and leaves fertilizing. This research was conducted in SEAMEO BIOTROP greenhouses bye use a complete randomized factorial design (CRD factorial). Treatment that is given is root fertilizing with consentrate of fertilizer 0 g, 2.5 g, and 5 g, which combine with leaves fertilizing with consentrate of fertilizer 0 g/L, 1g/L, 2 g/L, and 3 g/L. Root fertilizer was given one time on each, and leaves fertilizer given per 2 weeks for during 8 weeks observation. The parameters measured in this research were height of seedlings, diameter of seedlings, dry weight of seedlings, top root ratio, and seedlings quality index. The results showed that height of seedlings, diameter of seedlings, dry weight of seedlings, and seedlings quality index was significantly affected bye the treatment. The best treatment is combination of root fertilizer 2.5 g and leaves fertilizer 3g/L. This treatment could increas heigth of seedlings up to 56.47% compared with control. The diameter seedlings up 88.68% towards control. The increas of root and shoot dry weight were 54.40% and 73.43%, respectively. Seedlings quality index increased by 64.65%.
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