Judul: Analysis of Sugarcane Farmer's Satisfaction to the Partnership with Krebet Baru Sugar Factory
Abstrak: Persaingan PG Krebet Baru untuk mendapatkan bahan baku Tebu Rakyat semakin ketat. Kemitraan dengan Petani Tebu Rakyat menjadi strategi utama PG Krebet Baru untuk memenuhi kebutuhan produksi setiap tahunnya. Tujuan penelitian ini adalah untuk mengetahui pola kemitraan PG Krebet Baru dan menganalisis tingkat kepuasan Petani Tebu Rakyat mitra terhadap kemitraan dengan PG Krebet Baru. Responden penelitian berjumlah 40 orang Petani Tebu Rakyat mitra. Pengambilan data menggunakan metode purposive sampling. Pola kemitraan PG Krebet Baru adalah semi-inti-plasma. Secara keseluruhan, analisis kepuasan dengan indikator skor Customer Satisfaction Score (CSAT) menunjukkan bahwa kepuasan Petani Tebu Rakyat terhadap kemitraan PG Krebet Baru termasuk ke dalam kategori tingkat kepuasan tinggi. Tingkat kepuasan tertinggi terdapat pada aspek kemampuan komunikasi interpersonal dan kedekatan emosional pendamping dan aspek kemudahan dalam menghubungi dan menemui pendamping. Sebaliknya, terdapat 2 aspek yang masuk ke dalam CSAT kategori kepuasan tingkat rendah, yaitu aspek transparansi informasi terkait harga dan rendemen, dan aspek kesesuaian harga jual hasil panen tebu., The competition for obtaining raw materials for sugarcane is intensifying for PG Krebet Baru. Partnering with sugarcane farmers is the main strategy of PG Krebet Baru to meet its annual production needs. This study aimed to determine the partnership pattern of PG Krebet Baru and to analyze the level of satisfaction among sugarcane farmer partners on this partnership. The research respondents consisted of 40 purposively choose sugarcane farmer partners reveals that the partnership pattern of PG Krebet Baru is semi-plasma core. Overall, a CSAT score indicates that the satisfaction of sugarcane farmers to the partnership with PG Krebet Baru falls into the high satisfaction category. The highest satisfaction was observed in the aspects of interpersonal communication skills and emotional closeness with the companion, as well as the ease of contacting and meeting the companion. In contrast, there are two aspects fall into the low-level satisfaction category: transparency of price and yields information and the suitability of the selling price of the sugarcane harvest.
Keyword: partnership, sugarcane, CSAT, partnership satisfaction

Judul: Analisis Kepuasan Petani Tebu Mitra Terhadap kemitraan Dengan PG Pakis Baru
Abstrak: The raw material is a crucial need for survival. PG Pakis Baru is one of the companies that use sugar cane as raw material. Limitations in the fulfillment of the PG Pakis Baru cane encourage PG to establish cooperation with farmers. The cooperation form a partnership with the pattern of the plasma core. The reason farmers cooperative partnership is to assist in the capitalization of farming, cultivation, and it produces sugarcane marketing collateral. Partner satisfaction levels sugarcane farmers against partnership with the PG Pakis Baru measured using analysis Customer Satisfaction Index (CSI) shows the results of 94.5 percent. Results of these calculations indicate that sugarcane farmers are very satisfied partners over partnerships with PG DI leaders Pakis Baru.
Keyword: 

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: