Then we will use the perfect numbers that we have created in RSA and Rabin encryptions.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:Prime numbers are also used to send encrypted messages in the eld Cryptography in the past and today.
📊
Key Findings & Data:In cryptography, each user has two dierent keys, one open and one secret for encryption and decryption.
💡
Conclusion & Impact:Then we will use the perfect numbers that we have created in RSA and Rabin encryptions.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Prime Numbers · Distribution of Primes · Applications of Prime Numbers
Abstract
Prime numbers are also used to send encrypted messages in the eld Cryptography in the past and today. In cryptography, each user has two dierent keys, one open and one secret for encryption and decryption. The public key is public and anyone can see it. The secret key is kept condential and should not be known to anyone other than its owner. Encryption is done with a public key, while the decryption is done with a private key. we will start with the denition of perfectly safe prime numbers that we will use in encryption with prime numbers. Then we will use the perfect numbers that we have created in RSA and Rabin encryptions.
Halıcı, S., Koca, N. (2020). On Excellent Safe Primary Numbers and Encryption. Conference Proceedings of Science and Technology, Cilt: 3 Sayı: 2, 247–251. https://ajindex.com/articles/984327
3 Beskirli, A., Ozdemir, D., Beskirli, M., Sifreleme Yontemleri ve RSA Algoritması Uzerine Bir Inceleme, Avrupa Bilim ve Teknoloji Derg., Ozel sayi, 2019, 284-291.
4 Zuckerman, H.S., Niven, I. And Monygomery H.L., An Introduction To The Theory Of Numbers, New York: John Wiley Sons, 1991, 25-26.