No Way, JOSE!
summary
Explains JOSE with concrete, verifiable details: a small RSA implementation that encrypts and decrypts numeric examples, a CLI demo on GitHub that reproduces the math, and clear breakdowns of formats — compact JWS = three parts and JWE = five parts — including the content‑encryption‑key workflow. Compares algorithms (RSA vs elliptic curves vs Ed‑25519), shows when signatures vs keyed hashes vs encryption are appropriate, and stresses using proven libraries rather than hand‑rolling crypto.
AI-written summary · about
chapters (12)
- 0:00Start
- 6:11KEYED HASHING ALGORITHMS
- 10:44ELLIPTIC CURVE KEYS
- 12:38EXAMPLE USECASES file system encryption, Wi-Fi protected access WPA, database
- 14:13ASYMMETRIC ENCRYPTION
- 14:39A DETAILED EXAMPLE: RSA
- 14:49GENERATING KEYS
- 16:22USING A PUBLIC KEY TO ENCRYPT
- 16:59USING A PRIVATE KEY TO DECRYPT
- 23:26DECRYPT THE CONTENT ENCRYPTION KEY (CEK)
- 23:58DECRYPT THE CIPHER
- 27:20SUMMARY
