Introduction To Cryptography
Mo 13:40 - 15:30, SAZ 19
We 15:40 - 17:30, SAZ 19
- Complexity of basic algorithms
- Primality Tests
- Factorization Methods
- Other Cryptographic Protocols
(key exchange, authorization, . . . )
- Elliptic Curves
- Algebraic Tori
When Rivest, Shamir and Adleman published their public key scheme,
they challenged the readers to decrypt the following message.
It was encoded with the public key (N,e), where
N = 114381625757888867669235779976146612010218296721242362562561842935706935245733897830597123563958705058989075147599290026879543541
was later called RSA-129 because it has 129 digits, and where e = 9007.
The factorization of N was achieved in 1994.
Given the prime factor
p = 3490529510847650949147849619903898133417764638493387843990820577
(and cut & paste; right-click the blue frame at the top of the pari
window) to find q, compute d, and decrypt the message
c = 96869613754622061477140922254355882905759991124574319874695120930816298225145708356931476622883989628013391990551829945157815154
Homework is always due one week after hand-out except when stated
otherwise. Solutions will be posted after all students have
turned their homework in.
What I did in class
Here are the updated