Why we use prime numbers in rsa algorithm?
Answers
Answered by
4
hii dearA!
here ur answer!!
¤Simple? Yup.
#If you multiply two large prime numbers, you get a huge non-prime number with only two (large) prime factors.
#Factoring that number is a non-trivial operation, and that fact is the source of a lot of Cryptographic algorithms. See one-way functions for more information.
#Addendum:
Just a bit more explanation. The product of the two prime numbers can be used as a public key, while the primes themselves as a private key. Any operation done to data that can only be undone by knowing one of the two factors will be non-trivial to unencrypt.
♡hope help u plz mark brainlist dear!!
_____________________________
here ur answer!!
¤Simple? Yup.
#If you multiply two large prime numbers, you get a huge non-prime number with only two (large) prime factors.
#Factoring that number is a non-trivial operation, and that fact is the source of a lot of Cryptographic algorithms. See one-way functions for more information.
#Addendum:
Just a bit more explanation. The product of the two prime numbers can be used as a public key, while the primes themselves as a private key. Any operation done to data that can only be undone by knowing one of the two factors will be non-trivial to unencrypt.
♡hope help u plz mark brainlist dear!!
_____________________________
Similar questions
Science,
8 months ago
History,
1 year ago
English,
1 year ago
Math,
1 year ago
CBSE BOARD X,
1 year ago