Judul: Aklimatisasi dan Pertumbuhan Anggrek Dendrobium nindii pada Beberapa Media Tanam dan Konsentrasi Pupuk Daun.
Abstrak: Dendrobium nindii merupakan anggrek asli Indonesia yang berstatus terancam punah sehingga tindakan konservasi secara in vitro maupun in vivo perlu dilakukan untuk menjaga kelestariannya. Penelitian bertujuan mendapatkan kombinasi perlakuan media dan konsentrasi pupuk daun terbaik untuk aklimatisasi dan pertumbuhan vegetatif tanaman Dendrobium nindii. Penelitian dilakukan di Mekar Hurip Nursery yang berlokasi di Jalan Kebun Kelapa, Kecamatan Tamansari, Kabupaten Bogor yang berlangsung selama 5 bulan dari bulan Desember 2022 hingga April 2023. Penelitian ini menggunakan rancangan kelompok lengkap teracak faktorial dengan lima ulangan tiap kombinasi perlakuan. Perlakuan media tanam berupa spaghnum moss dan akar kadaka, sementara untuk perlakuan konsentrasi pupuk daun adalah pemupukan 0,5 g l-¹, 1 g l-¹, 1,5 g l-¹, dan 2 g l-¹. Hasil penelitian menunjukkan bahwa media tanam berpengaruh nyata terhadap panjang akar, konsentrasi pupuk daun berpengaruh sangat nyata terhadap lebar dan panjang daun serta berpengaruh nyata terhadap panjang akar. Interaksi antara media dan konsentrasi pupuk daun menunjukkan pengaruh sangat nyata terhadap jumlah daun dan berpengaruh nyata terhadap panjang daun, lebar daun, dan panjang akar. Kombinasi perlakuan media tanam akar kadaka dan konsentrasi pupuk 0,5 g l-¹ hingga 1 g l-¹ merupakan kombinasi perlakuan terbaik untuk persentase hidup tanaman, pertambahan panjang, lebar, dan serta jumlah daun total, sementara kombinasi media tanam terbaik untuk pertumbuhan akar adalah spaghnum moss dan konsentrasi pupuk 0,5 g l-¹.
Keyword: Pertumbuhan, Konservasi, Foliar, Plantlet

Judul: Effect of Several Planting Media on the Growth and Flowering of Sworch orchid (Dendrobium lancifolium)
Abstrak: Salah satu jenis anggrek yang populer adalah Dendrobium spp. anggrek Dendrobium disukai karena memiliki banyak warna, bentuk dan wangi yang khas, serta lebih mudah perawatannya dibandingkan anggrek lainnya. Anggrek Dendrobium lancifolium merupakan salah satu dari spesies Dendrobium asli Indonesia. Penelitian ini bertujuan untuk mengetahui pengaruh berbagai media tanam terhadap pertumbuhan dan pembungaan tanaman anggrek D. lancifolium. Penelitian dilaksanakan pada bulan April sampai Juni 2023 dilaksanakan di Nursery Gunung Batu, Bogor Barat, Jawa Barat. Rancangan percobaan yang digunakan adalah rancangan acak kelompok lengkap teracak (RKLT) dengan enam perlakuan kontrol dengan media tanam tanah, media tanam arang sekam, media tanam pakis, media tanam tanah + arang sekam (1:1 v/v), media tanam tanah + pakis cacah (1:1 v/v), dan media tanam arang sekam + pakis cacah (1:1 v/v) yang diulang sebanyak tiga kali sehingga terdapat 54 percobaan. Pemberian pupuk daun dengan merk dagang Growmore (20-20-20) diaplikasikan satu kali per minggu dengan konsentrasi 2 g L-1. Media tanam berpengaruh nyata pada pertambahan tinggi tanaman 8-10 minggu setelah tanam (MST), namun tidak memberi pengaruh nyata pada jumlah daun, jumlah pertambahan cabang, jumlah pertambahan pseudobulb, dan jumlah tanaman yang berbunga.
Keyword: Dendrobium, media, pseudobulb, pupuk daun

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