Judul: Bentuk-bentuk dan Intensitas Gangguan Manusia Pada Daerah Tepi Kawasan Taman Nasional Gunung Gede Pangrango, Jawa Barat
Abstrak: Penggunaan lahan dan status daerah penyangga Tarnan Nasional Gunung Gede Pangrango (TNGGP), adalah berupa lahan pernukiman, pertanian, perkebunan teh, kawasan hutan Perhutani. Dalam daerah penyangga ini juga terdapat kegiatan perindustrianlkerajinan rakyat (Mukhtar dan Pratiwi, 1986). Dalarn upaya pengernbangan daerah penyangga tersebut perlu adanya informasi tentang kondisi sekitar batas kawasan yang dapat digunakan sebagai informasi dasar dalam penentuan kebijaksanaan pengernbangan dan pengelolaannya. Perrnasalahan yang ada di sekitar tepi kawasan adalah terjadinya gangguan oleh rnanusia berupa pencurian kayu, perburuan satwaliar, perambahan hutan, perladangan dan pernungutan hasil hutan lainnya secara tidak terkendali. Akibat gangguan tersebut adalah hilangnya pohon, hilangnya atau rusaknya lahan yang tertutup oleh hutan sehingga fungsi hutan terganggu atau hilangnya plasma nutfah baik yang berbentuk flora ataupun fauna (Hadi, 1993).
Keyword: 

Judul: Pola Umum Gangguan Hutan di Taman Nasional Gunung Gede Pangrango
Abstrak: Taman nasional dapat berfungsi sebagaimana peruntukkannya apabila dikelola dengan baik. Salah satu tolok ukur keberhasilan pengelolaan suatu taman nasional adalah keutuhan dan integritas ekologi kawasan. Pengelolaan tan~an nasional pada dasamya adalah untuk mencapai sasaran pokok utama "Tiga P", yaitu perlindungan, pengawetan dan pelestarian pemanfaatan untuk kesejahtemn masyarakat (Departemen Kehutanan, 1988). Srunpai saat ini kegiatan pengelolaan TNGP masili menghadapi berbagai masalah yang disebabkan oleh tiga kelompok penyebab, yaitu tingkat pengelolaan, keadaan sosial ekono~ni dan kesadaran masyarakat. Salah satu indikator pennasalahan adalah tingkat gangguan terhadap kawasan. Masalah umum dalam upaya perlindungan dan pengamanan kawasan adalah sangat terbatasnya data serta infonnasi mengenai gangguan hutan.
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