Maulana, Fariz (2021) IDEAL PRIMA DAN IDEAL HAMPIR PRIMA PADA RING BILANGAN BULAT GAUSS. S1 thesis, Universitas Mataram.
|
Text
Skripsi Fariz Maulana (G1D015011).pdf Download (948kB) | Preview |
Abstract
Cryptography is one branch of mathematics that is widely used in digital security systems. Cryptography is related to integers and their properties, especially prime numbers. More specifically, some important algorithms for cryptography such as RSA, are very dependent on prime factorization of integers. Prime number abstraction was introduced by Dedekind in 1871, known as the prime ideal. Prime ideal has another generalization, known as almost prime ideal. Not all almost prime ideals are prime ideals, for example ideal generated by 4 is an almost prime ideal but it’s not a prime ideal in integers modulo 12. This research will prove that the ideal generated by Gaussian prime is almost prime ideal and also prime ideal on Gaussian integer ring.
| Item Type: | Thesis (S1) |
|---|---|
| Keywords (Kata Kunci): | prime ideal; almost prime ideal; Gaussian prime; Gaussian integer |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Fakultas Matematika dan ilmu Pengetahuan Alam |
| Depositing User: | Dr. I Gede Adhitya Wisnu Wardhana |
| Date Deposited: | 12 Feb 2022 12:13 |
| Last Modified: | 12 Feb 2022 12:13 |
| URI: | http://eprints.unram.ac.id/id/eprint/27779 |
Actions (login required)
 |
View Item |
