Judul: Perbanyakan Tunas In Vitro Pisang Rajabulu (Musa AAB Group) dengan Eksplan yang Berasal dari Sucker (Anakan) dan Jantung
Abstrak: Penelitian ini bertujuan untuk mempelajari pengaruh beberapa konsentrasi BAP dan kinetin pada konsentrasi NAA 0.5 mg/l dan beberapa konsentrasi BAP dan auksin (3.0 mg/l IAA dan 0.5 mg/l NAA) terhadap perbanyakan tunas in vitro pinang Rajabulu yang berasal dari sucker (anakan) dan jantung, serta pengaruh beberapa konsentrasi IAA dan BAP dengan eksplan tunas in vitro dari jantung.
Keyword: 

Judul: Pengaruh iaa dan bap terhdap perbanyakan tunas mikro pisang mas (Musa acuminata L. AA Group), Ambon dan Barangan (Musa acuminata L. AAAGroup), dan Rajabulu (Musa paradisiaca L.) secara in vitro
Abstrak: Percobaan dilakukan di Laboratorium Kultur Jaringan Tanaman Jurusan Budidaya Pertanian IPB. Bahan tanaman yang digunakan berupa tunas mikro pisang mas, ambon, barangan dan rajabulu yang telah tumbuh di media aseptik. Penelitian terdiri dari dua percobaan. Percobaan 1 merupakan percobaan satu faktor yaitu kultivar meliputi kultivar pisang mas, ambon, barangan dan rajabulu yang ditanam dalam media Murashige-Skoog (MS) tanpa perlakuan zat pengatur tumbuh. Percobaan 2 terdiri dari tiga faktor yaitu kultivar, IAA dan BAP. Kultivar yang digunakan sama dengan Percobaan 1. Perlakuan IAA terdiri dari tiga taraf yaitu 1.5 mg/1, 3.0 mg/1 dan 4.5 mg/l. Sedangkan perlakuan BAP juga terdiri dari tiga taraf yaitu 3.5 mg/1, 7.0 mg/1, dan 10.5 mg/1. Baik Percobaan 1 maupun Percobaan 2 disusun dalam Rancangan Acak Lengkap. Setiap perlakuan diulang delapan kali sehingga terdapat 32 satuan percobaan pada Percobaan 1 dan 288 satuan percobaan pada Percobaan 2.
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