Is there any proof of correct work of RSA algorithm, if p is not a prime number? For example: n = p*q, p = p1*p2, where p1 and p2 are primes.
Edit: I found that it's called Multiprime RSA, but i didnt find proof of Correctness for it.
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.
Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top
