PENINGKATAN KECEPATAN ENKRIPSI PAILLIER HOMOMORPHIC CRYPTOSYSTEM DENGAN CHINESE REMAINDER THEOREM PADA SISTEM E-VOTING

YULIO, BILLY DIPTA and Mulya, Megah and Arsalan, Osvari (2019) PENINGKATAN KECEPATAN ENKRIPSI PAILLIER HOMOMORPHIC CRYPTOSYSTEM DENGAN CHINESE REMAINDER THEOREM PADA SISTEM E-VOTING. Undergraduate thesis, Sriwijaya University.

	Text RAMA_55201_09021281520097.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (4MB) | Request a copy
	Text RAMA_55201_09021281520097_0020026609_0028068806_TURNITIN.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (14MB) | Request a copy
Preview	Text RAMA_55201_09021281520097_0020026609_0028068806_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (1MB) | Preview
	Text RAMA_55201_09021281520097_0020026609_0028068806_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (389kB) | Request a copy
	Text RAMA_55201_09021281520097_0020026609_0028068806_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (704kB) | Request a copy
	Text RAMA_55201_09021281520097_0020026609_0028068806_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy
	Text RAMA_55201_09021281520097_0020026609_0028068806_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (470kB) | Request a copy
	Text RAMA_55201_09021281520097_0020026609_0028068806_06.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (89kB) | Request a copy
	Text RAMA_55201_09021281520097_0020026609_0028068806_07_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (97kB) | Request a copy
	Text RAMA_55201_09021281520097_0020026609_0028068806_08_lamp.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (152kB) | Request a copy

Abstract

Encryption becomes the last shield to secure a message. Research on encryption has become a developing field. In general, the encryption stage is divided into three: key generation, encryption, and decryption. Many kinds of encryption methods. One of them is encryption which has homomorphic properties. Homomorphic nature is a trait that can perform operations on messages that are still encrypted. There are two types of homomorphic properties. Namely additive and multiplicative homomorphisms. Paillier Encryption is encryption with additive homomorphism properties. Paillier encryption also has semantic security properties. With these two characteristics, Paillier encryption has the potential to secure messages on e-voting systems. However, the speed at the encryption stage is slow for Paillier's method. Chinese remainder theorem can simplify the calculation of the encryption stage of the Paillier algorithm.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Enkripsi, homomorfik, e-voting, Paillier, Chinese remainder theorem
Subjects:	Q Science > Q Science (General) > Q334-342 Computer science. Artificial intelligence. Algorithms. Robotics. Automation.
Divisions:	09-Faculty of Computer Science > 55201-Informatics (S1)
Depositing User:	Users 3827 not found.
Date Deposited:	27 Dec 2019 07:16
Last Modified:	27 Dec 2019 07:16
URI:	http://repository.unsri.ac.id/id/eprint/22449

Actions (login required)

View Item