SISTEM KRIPTOGRAFI MCELIECE BERDASARKAN KODE REED-MULLER ORDER PERTAMA

PURNAMA SARI 17106010045, NIM. 17106010045 (2021) SISTEM KRIPTOGRAFI MCELIECE BERDASARKAN KODE REED-MULLER ORDER PERTAMA. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

Preview	Text (SISTEM KRIPTOGRAFI MCELIECE BERDASARKAN KODE REED-MULLER ORDER PERTAMA) 17106010045_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version Download (3MB) | Preview
	Text (SISTEM KRIPTOGRAFI MCELIECE BERDASARKAN KODE REED-MULLER ORDER PERTAMA) 17106010045_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf - Published Version Restricted to Registered users only Download (5MB)

Abstract

Internet is a communication channel that is prone to security attacks, one of security attacks is attack on secrecy. Observing the development of quantum computers, Peter Shor in 1997 assumed that the cryptosystem in use today is insecure against quantum computer crime. McEliece cryptosystem is considered safe against the threat of quantum computers because randomization in the encryption process. This system is built based on linear code, one of the well-known linear codes is the Reed-Muller code. This code has an efficient decoding algorithm and has more correction capability than the minimum distance of the Reed-Muller code. The study discusses the McEliece cryptosystem using first order Reed-Muller code. The security of the McEliece cryptosystem is determined by a linear code decoding algorithm. McEliece cryptosystem uses the first order Reed-Muller code resulting in a secure and fast system. The McEliece cryptosystem using the Reed-Muller code first order is also equipped with an application to the message text.

Share this knowledge with your friends :

Actions (login required)

View Item