Judul: Analisis Kebutuhan dan Ketersediaan Air Bersih Kota Bogor Melalui PDAM Tirta Pakuan
Abstrak: Salah satu kebutuhan hidup utama adalah kebutuhan akan air bersih. Tujuan dari penelitian ini adalah menganalisis kebutuhan air bersih dan ketersediaan air di setiap zona PDAM Tirta Pakuan dan menganalisis kesesuaian antara kebutuhan dan ketersediaan air bersih. Perkiraan total kebutuhan air bersih pada Zona 1 hingga 6 PDAM Tirta Pakuan untuk 10 tahun ke depan berdasarkan standar kebutuhan air bersih berturut-turut 18.695.419,25 m3/tahun, 4.351.946,16 m3/tahun, 12.694.875,85 m3/tahun, 68.467.951,29 m3/tahun, 3.522.397,21 m3/tahun dan 8.800.548,68 m3/tahun. PDAM Tirta Pakuan memperoleh air dari beberapa sumber yaitu Kota Batu, Bantar Kambing, Tangkil, Palasari dan dari beberapa WTP yaitu WTP Cipaku, WTP Dekeng 1, WTP Dekeng 2, WTP Dekasari 2, WTP Palasari dan WTP Cikereteg. Ketersediaan air di Zona 1, Zona 4, Zona 5 dan Zona 6 pada 10 tahun mendatang tidak dapat terpenuhi, sedangkan untuk Zona 2 dan Zona 3 masih dapat terpenuhi. Oleh karena itu, dibutuhkan peningkatan kapasitas produksi PDAM Tirta Pakuan dengan sistem distribusi yang baik sehingga PDAM Tirta Pakuan dapat mencukupi seluruh kebutuhan air penduduk Kota Bogor.
Keyword: air bersih, kebutuhan air, ketersediaan air

Judul: Analisis kebutuhan dan ketersediaan air bersih di daerah pelayanan zona 1 PDAM Tirta Pakuan Bogor, Jawa Barat
Abstrak: Bogor merupakan kota dengan kepadatan penduduk cukup tinggi. Pada tahun 2014 pertumbuhan penduduk kota Bogor mencapai 1.89% per tahun. Perubahan peningkatan jumlah penduduk akan mengakibatkan kebutuhan air bersih juga meningkat, sehingga diperlukan adanya perencanaan kebutuhan dan ketersediaan air bersih. Penelitian ini bertujuan untuk, menghitung jumlah kebutuhan air bersih, menghitung debit ketersediaan air bersih, dan menentukan alternatif untuk penambahan sumber air dalam pemenuhan kebutuhan air bersih sampai tahun 2035. Penelitian dilaksanakan di daerah pelayanan zona 1 Perusahaan Daerah Air Minum Tirta Pakuan kota Bogor. Pengambilan data dilaksanakan pada bulan April – Mei 2016. Dari hasil penelitian didapatkan bahwa kebutuhan air domestik di daerah pelayanan zona 1 sebesar 231.55 liter/detik dan kebutuhan air non domestik sebesar 18.58 liter/detik, sehingga total kebutuhan air bersih di daerah pelayanan zona 1 sebesar 300.16 liter/detik. Debit ketersediaan air bersih daerah pelayanan zona 1 diprediksi mengalami penurunan menjadi 173.332 liter/detik pada tahun 2035. Dengan demikian, terjadi defisit air sebesar 124.82 liter/detik, dan diperlukan penambahan air baku yang bersumber dari air permukaan yaitu dari Sungai Cikreteg sebesar 200 liter/detik.
Keyword: water availability, discharge, water demand, projection

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