Yes, on GitHub (search “stinson-cryptography-solutions”) and university archives. For example, the University of Waterloo’s CS 458 course once hosted solutions, and some remain via the Wayback Machine.
For example, a problem on computing discrete logarithms modulo a prime should show each application of the baby-step giant-step algorithm. Cryptography Theory And Practice 3rd Edition Solutions
Formula: [ IC = \frac\sum_i=0^25 n_i (n_i - 1)N(N-1) ] where (n_i) = frequency of letter i. Formula: [ IC = \frac\sum_i=0^25 n_i (n_i -
| Topic | Problem Type | Strategy | |-------|--------------|----------| | | Prove a cipher is/not perfectly secret | Use Pr[plain = x | cipher = y] = Pr[plain = x] | | RSA | Compute d given p,q,e | Extended Euclidean algorithm | | Hash functions | Find collision in simple hash | Birthday attack calculation | | MACs | Show forgery possible | Construct valid (message, tag) without key | | ElGamal | Recover plaintext from faulty randomness | Use decryption formula: ( m = c_2 \cdot (c_1^a)^-1 ) | | Shannon’s theorem | Prove entropy bounds | Use H(K) ≥ H(P) for perfect secrecy | including differential and linear cryptanalysis.
In-depth analysis of DES and AES, including differential and linear cryptanalysis.