Skip to main content
Get your Wikispaces Classroom now:
the easiest way to manage your class.
guest
Join

Help

Sign In
Small Margins
Home
guest

Join

Help

Sign In
Small Margins
Wiki Home
Recent Changes
Pages and Files
Members
Favorites
20
All Pages
20
home
Course information
February 14
February 16
February 2
February 7
February 9
January 10
January 12
January 17
January 19
January 26
January 31
March 1
March 13
March 20
March 27
March 3
Past exams
Questions
see more
Add
Add "All Pages"
Done
February 2
Edit
0
5
…
0
Tags
No tags
edit
Save
Cancel
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Q1
How many solutions does the congruence
have? What about the congruence
?
Q2 (18.2 from the textbook)
It may appear that RSA decryption does not work if the message a is not relatively prime to the modulus n=pq (p,q are distinct primes).
Show that in fact RSA works for all messages.
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
How many solutions does the congruence
have? What about the congruence
?
Q2 (18.2 from the textbook)
It may appear that RSA decryption does not work if the message a is not relatively prime to the modulus n=pq (p,q are distinct primes).
Show that in fact RSA works for all messages.