Judul: Studi potensi pengembangan bumi perkemahan di taman nasional Gunung Gede Pangrango dan sekitarnya
Abstrak: Penelitian yang dilakukan bertujuan untuk mengetahui potensi pengembangan bumi perkemahan di Taman Nasional Gede Pangrango (TNGP) dan sekitarnya dengan pendekatan analisis ketersediaan (supply) sumberdaya bio-fisik dan pengelolaan, serta permintaan/kebutuhan (demand) pengunjung. Empat bumi perkemahan yang dijadikan obyek penelitian adalah Bumi Per- kemahan Mandalawangi dan Situgunung (di bawah pengelolaan Perum Perhutani), serta Bumi Perkemahan Gunung Putri dan Se- labintana (di bawah pengelolaan Taman Nasional Gede Pangra- ngo). Adapun tahapan penelitiannya adalah dimulai dari inventarisasi, analisis data, sintesis, dan pengembangan.
Keyword: Camping, Perkemahan

Judul: Pengembangan wisata alam di taman nasional Gunung Halimun Jawa Barat
Abstrak: Penelitian yang dilakukan bertujuan untuk mengetahui potensi wisata yang dimiliki Taman Nasional Gunung Halimun (TNGH) dan merencanakan pengembangannya dengan pendekatan analisis sediaan sumberdaya (supply) dan permintaan kebutuhan wisata (demand). Penelitian meliputi kegiatan pengumpulan data, analisis data, sintesis dan penyusunan rencana pengembangan. Prosedur penelitian detail digunakan prosedur penelitian evaluasi kesesuaian tapak untuk penggunaan rekreasi. Obyek wisata yang tersedia di kawasan TNGH terdiri dari obyek wisata alam (lansekap, air terjun, danau, tebing, flora dan fauna) dan obyek wisata budaya ( situs budaya dan upacara tradisional "Seren Tahun" masyarakat Kasepuhan). Potensi sumberdaya yang tersedia kurang didukung oleh sarana perhubungan sehingga umumnya obyek tersebut belum dapat difungsikan sebagai tempat tujuan wisata. Jumlah dan frekuensi kunjungan wisata ke TNGH relatif rendah, yaitu 333 kunjungan selariia tahun 1993 (Januari-September). Potensi permintaan cukup besar, terutama masyarakat kota Sukabumi, Bogor, Rangkasbitung, Pandeglang dan Jakarta. Sebagai pembanding permintaan Taman Nasional Gunung Gede-Pangrango (TNGP) rata-rata per tahun lebih kurang 60 000 kunjungan yang terdiri dari 97 , 4 3 persen wisatawan nusantara (wisnu) dan 2,57 persen wisatawan mancanegara (wisman). ...
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