Judul: Patogenesitas Botryodiplodia theobromae Pat. Terhadap Daun Kayu Afrika (Maesopsis eminii Engl.)
Abstrak: Kayu afrika (Maesopsis eminii Engl.) merupakan kayu perdagangan yang tergolong kayu cepat tumbuh yang memiliki banyak manfaat. Gangguan penyakit menjadi hambatan pertumbuhan dan menurunkan kualitas kayu. Botryodiplodia theobromae merupakan patogen penyebab penyakit yang merugikan dan memiliki banyak inang. Penelitian bertujuan menguji patogenisitas Botryodiplodia theobromae terhadap daun kayu afrika, menguji secara makroskopis dan mikroskopis patogen yang menyerang daun kayu afrika adalah Botryodiplodia theobromae. Rancangan percobaan yang digunakan adalah rancangan acak lengkap. Perlakuan yang digunakan terdiri dari tanpa pelukaan inokulasi, pelukaan, inokulasi dan pelukaan ditambah inokulasi. Hasil pengamatan menunjukkan gejala bercak daun dengan warna kecoklatan pada daun kayu afrika. Berdasarkan uji jarak berganda (Duncan) pelukaan ditambah inokulasi memberikan rataan terbesar terhadap keparahan penyakit sebesar 27.56% dan kejadian penyakit sebesar 82.67%. Hasil pengamatan makroskopis pada media PDA menunjukkan koloni isolat ini memiliki warna putih kapas hingga berumur 7 hari dan berwarna abu-abu hingga hitam pekat pada miselium yang tua. Koloni miselium memiliki tekstur seperti benang halus dengan miselium udara yang tebal dan koloni menyebar dari bagian tengah dengan alur tidak beraturan. Pengamatan mikroskopis daun yang bergejala penyakit hasilnya memperlihatkan karakter patogen Botryodiplodia theobromae, dengan ditemukan hifa bersekat hialin dan konidia yang berbentuk ellipsoid hialin.
Keyword: Botryodiplodia theobromae, disease incidency, disease severity, leaf spots, Maesopsis eminii Engl.

Judul: Uji Patogenisitas Patogen Hawar Daun pada Tanaman Kayu Afrika (Maesopsis Eminii Engl.) di Persemaian Permanen BPDAS Bogor
Abstrak: African wood (Maesopsis eminii Engl.) is a fast-growing tree species which are now begin to be exploited. This research is aimed to identify the types of pathogens, disease incidence and severity of leaf blight disease in African wood seedlings. Methods include field observations, isolation of symptomatic leaf blight and subsequent testing of Koch's postulates. Results of field observations indicating that the incidence of the disease is at 99.44%, while the severity of the disease by 8.85%. When isolation of symptomatic leaf blight was found 8 kinds of isolates that have different colors. The isolates were found in plants are then inoculated on African wood, and almost all isolates can causing the symptoms of leaf blight. The result of Koch's postulates inoculated leaf, found two types of isolates were identical to the initial isolation. Pathogenicity test results showing isolates with 1.1 code has the highest percentage value of disease incidence and severity than the other isolates. The identification results show the isolates with 1.1 code is a type of fungus characterized by having sectional hyphae and contained conidia, this fungus belongs to a class of Deuteromycetes
Keyword: Bogor Agricultural University (IPB), severity of disease, Maesopsis eminii Engl, leaf blight, Koch's postulates, Fungus

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