Question : Let n = pq for two different primes p and q. This exercise shows that we can use the RSA even if gcd(a, n) 6=

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899604
Joined: Mon Aug 02, 2021 8:13 am

Question : Let n = pq for two different primes p and q. This exercise shows that we can use the RSA even if gcd(a, n) 6=

Post by answerhappygod »

Question : Let n = pq for two different primes p and q. This
exercise shows that we can use the RSA even if gcd(a, n) 6= 1 mod
n.
2. Let e and d be the be the encryption and decryption for RSA
modulo n. Show that a e·d = a mod n for any a.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Top
Post Reply

Return to “Archived Questions & Answers”