No abstract

The Constitution guarantees every child to live, grow and develop and has the right to protection from violence and discrimination. Therefore, Indonesia as a rule of law has the obligation and responsibility to provide protection, one of which is for children who conflict with the law. A child in conflict with the law is a child who is 12 (twelve) years old, but not yet 18 (eighteen) years old, who is suspected of having committed a criminal act. One of the causes of conflict with the law is child delinquency. Many can factor cause delinquency in children. According to Law Number 11 of 2012 concerning the Criminal Justice System for Children, cases of children in conflict with the law must be adjudicated in juvenile criminal courts located within the general court. However, before entering the judicial process, law enforcers, families, and the community are obliged to seek a settlement process outside the court, namely through Diversion based on the Restorative Justice approach. The objective of juvenile justice is not merely to prioritize the crime as the main element, but protection for the future of the child is a goal that juvenile justice aims to achieve. Therefore, the imposition of punishment must have attempted as a last option after all means are considered inadequate (ultimum remidium).

This research deals with the structure of cyclically pure injective modules over a commutative ring R. If I be an ideal of R, proved that any CP-injective R/Imodul is also CP-injective as an R-module. The main result of research is the existance of CP-injective R-module if there is an R-module. More over, we deal characterization of CP-injective module which is related to proper essential ctclically pure extension. It is shown that R-modul D is cyclically pure injective if and only if D has no proper essential cyclically pure extension.

Penelitian ini mengkaji konsep koset grup apabila diterapkan pada kriptografi dalam mengkodekan karakter yang ada pada plaintext ke beberapa kemungkinan ciphertext yang berada di koset yang sama. Kelebihan menggunakan koset untuk partisi yaitu dapat mengetahui apakah dua anggota dalam suatu grup terletak pada suatu bagian partisi yang sama atau tidak. Penelitian ini menggunakan metode kuantitatif dengan dua pendekatan, yaitu studi literatur dan menyajikan contoh enkripsi deskripsi dilengkapi dengan simulasi program bahasa C++. Perbandingan karakter plaintext dan ciphertext pada pengujian recovery menggunakan percobaan satu sampel dengan plaintext dari teks dalam bahasa Inggris berukuran 48156 huruf dengan kunci k=3 diperoleh kesamaan 100 persen atau identik. Dengan demikian algoritma enkripsi dan dekripsi dapat dikatakan berhasil memenuhi syarat recovery plaintext. Berdasarkan penelitian dan pengujian yang telah dilakukan, dapat disimpulkan bahwa hasil pengujian analisis frekuensi pada enkripsi kriptografi klasik dengan penerapan konsep koset grup tidak terlihat hubungan antara sebaran kemunculan huruf di plaintext dengan kemunculan huruf di ciphertext, sehingga kriptanalis tidak dapat menerka aturan enkripsi yang digunakan.