Intro to Computer Security — quick reference for exam traces
Lₙ=Rₙ₋₁, Rₙ=Lₙ₋₁⊕f(Rₙ₋₁,Kₙ)b₁b₆, col=b₂b₃b₄b₅j=(j+S[i]+T[i]) mod n, swapi=(i+1) mod n, j=(j+S[i]) mod n, swapt=(S[i]+S[j]) mod n, k=S[t]C = P ⊕ kq, generator αX → Public: Y = α^X mod qK = Y_other^X mod qn=pq, φ=(p−1)(q−1)gcd(e,φ)=1, d=e⁻¹ mod φC=M^e mod nM=C^d mod n1 + k zeros + 64-bit length(L+1+k) ≡ 448 (mod 512)| Algorithm | Canonical example |
|---|---|
| DES | M=0123456789ABCDEF → C=85E813540F0AB405 |
| RC4 (3-bit) | P=[6,1,4] → C=[4,2,3] |
| RC4 (4-bit) | K=[3,5,2,7], P=[9,4,12,7,1] → C=[13,3,1,3,6] |
| DES K₁ | Key 133457799BBCDFF1 → see DES Key Schedule |
| DH | q=353, α=3, X_A=97, X_B=233 → K=160 |
| RSA | p=11,q=17,e=19,d=59, M=21→C=98 |
| SHA-1 pad | 96-bit msg → 351 zeros after "1" |
| SHA-1 W expand | Wₜ = ROTL¹(Wₜ₋₃⊕Wₜ₋₈⊕Wₜ₋₁₄⊕Wₜ₋₁₆) for t≥16 |