Explore how AES uses a substitution-permutation network with sub bytes, shift rows, mix columns, and round keys produced by a key expansion module; encryption and decryption mirror each other.

Explore how aes modes adapt to security requirements, comparing ecb, cbc, cfb, ofb, and ctr, and define key terms like plaintext, ciphertext, key, and initialization vector.

Explain how CBC mode uses an initialization vector and ciphertext chaining to encrypt and decrypt, with XOR via the IV and prior ciphertext, and warn about a dynamic IV risk.

Explore cipher feedback mode (cfb): encrypt the initialization vector with the key, xor with plaintext to form ciphertext, and note how decryption reverses this process and the replay attack risk.

Learn aes gcm mode by encrypting plaintext with a key and associated data to generate a tag for integrity, then decrypt by validating the tag to prevent modification.

Explore RSA features: how asymmetric key cryptography uses two keys for encryption and decryption, with public key n and e, private key n and d, and secure key distribution.

Understand rsa: generate n as product of primes p and q; encrypt with public key (n, e) and decrypt with private key (d, n); security relies on key size.

RSA key generation selects two primes p and q, computes n and φ(n), then derives e and d for the public and private keys and ensures secure key exchange.

Explore sha hashing features, including fixed-size hash outputs, a one-way function, collision resistance, and the avalanche effect, with applications in certificates and document signing.

Explore hmac, a hash-based message authentication code that uses a shared secret key with a hash function like sha-2/3 to verify data integrity and support secure key exchange.

Utilize rngs to generate unpredictable numbers from entropy sources such as thermal noise for key generation in symmetric, asymmetric, or HMAC algorithms used in SSL, TLS, SSH, Wi-Fi, and LTE.

Explore true random number generator sources for cryptography, including thermal noise and phase noise, and learn how non-deterministic electron motion and oscillator jitter produce true randomness.

Discover how digital signatures ensure authenticity, integrity, and non-repudiation by signing with a private key and verifying with a public key using hashing and RSA.

This lecture explains generating a digital signature by hashing the message and encrypting the hash with the sender's private key, then verifying with the sender's public key via PKI.

Identify a root of trust as the secure starting point for a system, ensuring integrity, confidentiality, and authenticity before the operating system boots.

Enable a secure processing environment through root of trust modules, enabling secure boot, crypto modules (AES, RSA, SHA), key management, and a chain of trust for hardware, firmware, and apps.

Explore how secure boot enforces a root of trust to verify OS and firmware from the trusted OEM, establishing a chain of trust and protecting confidentiality.

Compare symmetric and asymmetric cryptography, hashing, and digital signatures, and explain how key sizes, such as 128, 2048, and 256 bits, support secure storage, TLS, SSH, and secure boot.

Explore cryptology, cryptography, and cryptanalysis, and review AES, RSA, and SHA; learn key generation with a true random number generator, signing, verification, and root of trust for secure processing environment.