Judul: Kajian Tentang Revitalisasi Pemerintahan Nagari ke Arah Peningkatan Mutu Pelayanan Kepada Masyarakat di Provinsi Sumatera Barat
Abstrak: Pemerintahan nagari merupakan bagian dari kehidupan masyarakat nagari. Fungsi pemerintahan nagari adalah menjaga dan melestarikan nilai- nilai dan adat istiadat yang sudah ada di nagari serta membantu masyarakat nagari dalam mencapai pelbagai kebutuhannya. Penelitian ini berutujuan; (1) mendeskripsikan kronologis pemerintahan nagari sebelum dikeluarkannya Perda No.9 Tahun 2000 tentang Ketentuan-Ketentuan Pokok Pemerintahan nagari serta faktor- faktor yang mempengaruhi kinerja pemerintahan nagari pada waktu itu, (2) mengungkapkan mutu kinerja pelayanan pemerintahan nagari yang ada dewasa ini serta faktorfaktor yang berhubungan dengan kinerja pelayanan tersebut, dan (3) menyusun model serta merumuskan strategi revitalisasi guna peningkatan mutu pelayanan pemerintahan nagari.
Keyword: 

Judul: Transformasi Dari Desa Kembali Ke Nagari (Studi Kasus  Di Kenagarian IV Koto Palembayan, Sumatera Barat)
Abstrak: Secara tradisional masyarakat Minang hidup berkelompok dalam suatu ikatan genealogis dan teritorial yang otonom dengan pemerintahan kolektif berdasarkan hukum adat dalam sebuah sistem pemerintahan yang disebut nagari. Keberadaan pemerintahan nagari praktis hilang secara de jure dari Sumatera Barat sejak diberlakukannya UU No. 5 tahun 1979 mengenai bentuk pemerintahan terendah yaitu desa, kebijakan ini membuat nagari terpecah ke dalam bentuk desa. Jatuhnya rezim pemerintahan orde baru telah membawa perubahan dari sistem pemerintah sentralistik menjadi desentralistik. Pemerintah kemudian mengeluarkan UU No. 22 tahun 1999 yang memberikan peluang untuk menghidupkan kembali bentuk pemerintahan asli jika masyarakat setempat menginginkannya. UU No. 22/1999 ini selanjutnya disempurnakan oleh UU No. 32/2004.
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