I coded a small example of RSA in Python. When filling p and q, I mistakenly put in two numbers that were not prime numbers. And it worked fine anyway.
My question is, why is it so important for RSA to take prime number as inputs?
2026-03-29 14:00:29.1774792829
Why do we use prime numbers with RSA?
95 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
"Working" and "easy to break" are different. RSA works as a cryptographic system because it's hard to factor the product of two large primes. A large number that has many prime divisors is easier to factor.