Judul: Asupan Serat Pangan dan Pengetahuan tentang Serat pada Remaja di Dua SMA Kota Bogor
Abstrak: Penelitian bertujuan mempelajari asupan serat pangan dan pengetahuan tentang serat pada remaja di Dua SMA Kota Bogor. Desain penelitian cross sectional study dengan subjek berjumlah 220 siswa. Asupan serat pangan diperoleh dari food recall 1 x 24 jam. Hasil penelitian menunjukkan asupan serat pangan subjek 9.4+5.8 g per hari. Sejumlah 56.1% total asupan serat harian subjek diperoleh dari makanan pokok seperti nasi dan mie. Lauk nabati seperti tahu dan tempe menyumbang 21.7% dari total asupan serat harian. Sementara itu, sayuran seperti wortel dan bayam menyumbang 12.3% total asupan serat harian dan hanya sejumlah 9.9% total asupan serat harian subjek berasal dari buah-buahan seperti pisang dan jeruk. Sejumlah 74.1% subjek berpengetahuan gizi sedang. Asupan serat berhubungan dengan nilai IMT/U, uang saku, dan tingkat pendidikan ibu (p<0.05). Asupan serat berhubungan dengan asupan energi, protein, lemak, dan karbohidrat (p<0.05). Asupan serat tidak berhubungan dengan skor pengetahuan tentang serat (p>0.05).
Keyword: asupan serat pangan, pengetahuan tentang serat, remaja

Judul: Kebiasaan Makan Dan Konsumsi Serat Makanan Pada Remaja Smu  Di Bogor
Abstrak: Tujuan umum dari penelitian ini adalah untuk mengetahui konsumsi serat makanan pada remaja SMU di kota maupun desa. Secara khusus tujuan dari penelitian adalah : I) mempelajari kebiasaan makan remaja SMU: 2) mengetahui besamya konsumsi serat makanan remaja SMU; 3) mengetahui hubu'lgan konsumsi serat makanan dengan karakteristik sosial ekonomi keluarga dan pengetahuan gizi remqja SMU. Desain penelitian ini adrurul Cross-Secliol1al.yang dilaksanakan di dua sekolah yang mempunyai karakteristik yang berbeda, yaitu SMU Negeri I BOgOL yang mewakili daerah perkotaan dengan status sosial ekonomi tinggi dan SMU Negeri 1 Leuwiliang, Kabupaten Bog0r yang me\\'akili daerrul perdesaan dengan status sosial ekonomi relatif lebih rendrul. 'Pengumpulan data dilakukan bulan Mei-Juli 2002.
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