Judul: Prospek pengembangan wisata alam pada kawasan suaka margasatwa nantu Propinsi Gorontalo
Abstrak: Suaka Margasatwa Nantu (SM Nantu) merupakan salah s8tu kawasan konservasi di Provinsi Gorontalo , dengan luas 31 .215 ha. Potensi keanekaragaman hayati yang dimiliki cukup tinggi , terutama dengan keberadaan flora dan fauna yang !angka dan endemik Sulawesi, sehingga sangat potensial dikembangkan sebagai salah satu obyek wisata alam . Pengembangan wisata t=llam ini merupakan alternatif pemanfaatan kawasan agar keberadaannya dapat dirasakan, baik oleh masyarakat sekitarnya, pemerintah dan pengelola itu sendiri.
Keyword: keanekaragaman hayati, wisata alam

Judul: Keanekaragaman Repril di Sekitar Kawasan Suaka Margasatwa Nantu Provinsi Gorontalo
Abstrak: Sulawesi island is known for high endemicity of mammals, birds, amphibians and reptiles. Previous amphibians and reptilians survey showed that amphibians and reptiles diversity in this area are still negleted. This research was conducted on June 13th until 27th of Juni 2013 on the eastern part of Nantu Wildlife Reserveand around Bontula village. The objective of this study is to identify the composition of reptile and comparing reptile diversity based on habitats. This study resulted in 19 species reptiles consisting of 54 individual found on seven sampling sites. Three species were Sulawesi endemics consisting of Chrysopelea paradisi celebensis, Rhabdophis callistus, Cyrtodactylus jellesmae and 12 species were classified as Least Concern (LC) based on IUCN redlist.Undisturbed habitat has the highest index of Shannon Wiener diversity (2.11) whilst the lowest index is found on housing area (0.68). Changes in habitat conditions is predicted affect the microclimate of location which caused the majority of reptile unable adapt.
Keyword: reptile, nantu, gorontalo, diversity

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