Judul: Tingkatan mutu ikan banyar (Rastrelliger kanagurta) pasca penangkapan di pelabuhan perikanan nusantara (PPN) Pekalongan, Jawa Tengah
Abstrak: Penelitian ini terbagi dua tahap yaitu penelitian pendahuluan dan penelitian utama. Penelitian pendahuluan bertujuan untuk melihat keadaan umum PPN Pekalongan, kapal/unit penangkapan yang ada serta ikan yang dominan ditangkap. Penelitian utama dilakukan untuk melihat upaya penanganan, mutu serta komposisi gizi ikan banyar yang didaratkan di PPN Pekalongan. Pengujian yang dilakukan adalah pengujian organoleptik, TPC, proksimat dan TVB.
Keyword: 

Judul: Upaya Mempertahankan Kesegaran Ikan Selar Bentong (selar boorps) dengan Penambahan Khitosan Pasca-Penangkapan di PPN Pekalongan Jawa Tengah
Abstrak: Penelitian ini bertujuan untuk megetahui karakteristik perubahan mutu ikan selar bentong (selar boops) yang mendapat beberapa perlakuan selama di atas kapal dan sampai pada proses pembongkaran serta penyimpanan. Penelitian ini terdiri adri penelitian pendahuluan berupa observasi dan wawancara secara langsung kepada nelayan untuk mengetahui keadaan PPN Pekalongan dan menetukan titik pengamatan dari penanganan pasca-penangkapan selama di atas kapal. Penelitian utama meliputi uji organoleptik (B1 sampai B3), TPC (B1 samapi B4), proksimat (pada saat B4), TVB (pada saat B4), ph (pada saat B4), penentuan panjang dan berat serta rendemen ikan. Adapun perlakuan penanganan antara lain pengesan (A1) es ditambah larutan khitosan 0.25% (A2) dan larutan kitosan 0.25% tanpa diberi es (A3). titik pengamatan pada proses penanganan adalah (B), yaitu (B1) titik awal perlakuan/ikan baru ditangkap, (B2) ikan yang telah diberlakukan penyimpanan selama 1 hari, (B3) ikan yang telah diberi perlakuan selama 3 hari (F4) ikan mengalami proses penyimpanan selama 2 minggu dalam freezer
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