Professional Documents
Culture Documents
Tugas Kripto Algoritma Rsa
Tugas Kripto Algoritma Rsa
A11.4602
KELOMPOK :
Jawab:
𝑝 = 47, 𝑞 = 71
𝑛 = 𝑝 × 𝑞 = 47 × 71 = 3337
𝜙(𝑛) = (𝑝 − 1) × (𝑞 − 1) = 46 × 70 = 3220
Menentukan e, yang mana bilangan relative prima antara 2000-3000 dan GCD(e, 3220) = 1
𝑒 = 2003
Karena :
355 𝑚𝑜𝑑 76 = 51
76 𝑚𝑜𝑑 51 = 25
51 𝑚𝑜𝑑 25 = 1
Proses ENKRIPSI
Plaintext:
E R A T R I W AH Y U N I D W I B U D I U T O M O J A Z A C H A I R U N N I S A A N I S
SAEFUDDINDIDIKSETIYATRIHANDIKA
698 265 848 273 876 572 898 578 736 887 736 685 687 385 847 977 797 465 906 567 726 569
828 578 787 383 656 578 738 383 836 569 708 568 687 378 687 368 737 583 698 473 896 584
827 372 657 868 737 565
Ciphertext:
197215449911542108199149276026246267766165981082282615001388133514191287298394
576060816947957602741694212129836672272616662616176917815661972151330171997191
22428314880178894
Proses DEKRIPSI
Plaintext:
698265848273876572898578736887736685687385847977797465906567726569828578787383
656578738383836569708568687378687368737583698473896584827372657868737565