Judul: Kajian Sumberdaya Terumbu Karang untuk Pengembangan Ekowisata Bahari di Perairan Kecamatan Semau, Kabupaten Kupang, Provinsi Nusa Tenggara Timur.
Abstrak: The waters of Semau Subdistrict have the potential of coral reef resources but not managed optimally for tourism activities because to lack of scientific information. This study aimed to: analyze the suitability, estimate the value of the visual seascape and images of biota, knowing the public perception and development patterns of coral reefs resources for the development of sustainable marine ecotourism in the waters of Semau Subdistrict. The data collection method is to use transect quadrant method for coral reefs, underwater visual census for reef fishes and interview for visual value. The conditions of social, economic, cultural and perception community knew through direct interviews with local residents. Formulas used for the management plan are suitability index tourism, scenic beauty estimation, zoning and SWOT analysis. The results show that coral reef resources in the waters of Semau Subdistrict feasible to be developed for two types of marine ecotourism. Diving tourism is located in the waters of Kambing Island and the Tanjung Uikalui, snorkeling tourism is located in Uiasa and Otan with appropriate category. Value of the visual landscape and images of biota coral reefs are high enough to be used as an object for development of marine ecotourism. Must local communities and government are very supportive to the development of the existing coral reef resources as a location for marine ecotourism. The strategy which is priority is the implementation of marine ecotourism activities, particularly diving and snorkeling tours in sustainable way and economic improvement of society through alternative livelihoods.
Keyword: 

Judul: Pengelolaan Sumberdaya Terumbu Karang Dalam Kawasan Pengembangan Wisata Bahari KKLD Selat Dampier Kabupaten Raja Ampat.
Abstrak: The area of Gam island, Mansuar and Kri of island in the north MPAs of Dampier Strait Raja Ampat regency has potential of coral reef resources for development of marine tourism. The focus management of coral reef to economic rise with management non extractive. The objectives of this research was (a) to analyze the suitability and carrying capacity of coral reef ecosystem for tourism development and (b) to analyze partsipation of stakeholder in management of coral reef resources. The coral reef ecosystem can be used to study its suitability for marine tourism objects of diving. Collected data were life form of coral reef, coral fish, current speed, water transparency and coral reef depth. The formula used to determine tourism suitability is suitability matrix of diving, and Scenic Beauty Estimation (SBE) to judge the quality of landscape. Line intercept transect method showed that islands of Gam, Mansuar and Kri area had a condition of coral reef in the category of “good” with the average coral coverage is 63.75%. However, public participation in the management of coral reefs for the development of marine tourism to has not been done its full potential according to the analysis of community participation.
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