Judul: The Exploration of Discrete Logarithm over Finite Field GF(3m)
Abstrak: The security of many public~key algorithms is based on the problem of finding discrete logarithms. The generalized discrete logarithm problem is the following: given a finite cyclic group G of order n, a generator a of G, and an element fl E G, find the integer x, 0 ~ x ~ n - 1, such that 0: = fl. Algorithm for discrete logarithm problem focused on Menezes et al. (1997) that consist of exhaustive search algorithm, the baby-step giant-step algorithm, Pollard's rho algorithm, Pohlig-Hellman algorithm, and index-calculus algorithm. These algorithms are explorated to be used in discrete logarithm problem over finite field GF(3m ). The exploration also produces some algorithms, i.e. naif negative algorithm, baby-step mother-step algorithm, baby-step mother free-step algorithm, and baby-step free-step algorithm. All algorithms implemented using Maple 11. The Pohlig-Hellman and baby-step giant-step algorithms are efficient enough to be used in discrete logarithm problem over finite field GF(3m ) for m < 20.
Keyword: 

Judul: Eksplorasi Masalah Logaritma Diskret pada Finite Field G P(2m)
Abstrak: Discrete logarithm problem represents a problem which is defined as modular arithmetic. It is often used to generate a key pair on public key cryptography as security object. Given cyclic group G of order n, αgenerator of G, and β∈􀜩, then, in general, discrete logarithm problem is determined as the integer 􀝔, 0≤􀝔≤􀝊−1, such that α􀯫≡β(mod 􀝊). In Menezes et al. (1997) the algorithm to solve the discrete logarithm problem in common cyclic group G are Exhaustive Search algorithm, Baby-Step Giant-Step, Pollard's rho, Pohlig Hellman and Index Calculus. Furthermore, these algorithms are explored to determine the solution of discrete logarithm problem on 􀜩􀜨(2􀯠). The reconstructed algorithms are implemented using Maple 11 software. These implementation can be used to measure security level of cryptography algorithm, which is based on security aspects of discrete logarithm problem
Keyword: 

Judul: Karakteristik Suara Song Burung Kenari (Serinus canaria) Postur Besar dan Kecil.
Abstrak: Burung kenari (Serinus canaria) memiliki nyanyian yang sangat bervariasi dengan durasi yang panjang dan merupakan tipe burung bernyanyi open learners. Penelitian ini bertujuan menganalisis karakteristik suara song burung kenari (Serinus canaria). Penelitian dilakukan pada bulan April sampai Juni 2017 di Bogor, Jawa Barat. Perekaman suara song terhadap 12 ekor burung kenari jantan dilakukan dengan menggunakan mikrofon Sennheiser ME66 dan alat perekam Sony PCM-D50. Burung kenari yang digunakan merupakan burung yang pernah mengikuti kontes burung kicau dan memiliki predikat juara kontes burung. Amplitudo, durasi suara, frekuensi, dan volume suara burung dianalisis dengan menggunakan software Raven Pro 1.4. Data tersebut selanjutnya dianalisis deskriptif. Hasil analisis suara menunjukkan bahwa burung kenari memiliki banyak syllable, suara song rapat dan tidak terputus-putus, tempo yang cepat, dan adanya pengulangan suku kata pada setiap suara song. Burung kenari postur kecil memiliki rataan durasi lebih panjang dibandingkan dengan kenari postur besar, tetapi burung kenari besar memiliki rataan max amplitudo, average power, max power, min amplitudo, peak amplitudo, dan peak frekuensi.
Keyword: karakteristik suara (song), kenari, syllable