Stream Encryption Overview

Stream encryption is a cryptographic technique that encrypts data one bit

or byte at a time in a continuous stream. This method is especially suited
for securing data in transit over networks where data flows continuously,
such as during online communications.

One common stream encryption algorithm is RC4 (Rivest Cipher 4), which
generates a pseudorandom stream of bytes combined with plaintext to
produce ciphertext. RC4 is known for its efficiency and speed, making it
ideal for protecting data in applications like HTTPS web traffic.

How Stream Encryption Works in Practice

 When a user accesses a secure website via HTTPS, the Transport Layer
Security (TLS) protocol uses stream encryption to secure the data between
the browser and server.
 Data is encrypted and decrypted on the fly, with encryption keys updated
regularly to maintain security.
 This ensures the confidentiality of data transmitted in real time.

Advantages and Use Cases

 Stream encryption offers high speed and low latency, making it ideal for
real-time communication applications such as video conferencing, online
gaming, and voice calls.
 While excellent for data in transit, stream encryption typically provides less
robust security for data at rest compared to block encryption methods.

This makes stream encryption a practical choice for securing continuous

data streams while balancing performance and security.

Block Encryption Overview

 Block encryption divides plaintext into fixed-size blocks, typically 128 bits,
and encrypts each separately using the same key. This approach resists
attacks like brute force by employing robust algorithms designed for high
security.

The Advanced Encryption Standard (AES) is the most widely used block
cipher, supporting 128-bit, 192-bit, or 256-bit keys for 128-bit blocks, where
longer keys enhance security against key-guessing attempts.

Practical Example
When encrypting a file with AES, the content splits into 128-bit blocks, each
encrypted individually with the shared key. Decryption reverses this by
reassembling decrypted blocks into the original file.

Key Advantages and Use Cases

 Provides strong protection for data at rest, such as files on hard drives or
database entries.
 Excels in security for static data but processes slower than stream
methods, especially with large datasets.
 Common in secure storage and compliance scenarios requiring high
confidentiality.

Block encryption suits scenarios prioritizing security over speed, contrasting

with stream encryption's real-time efficiency.

Block vs Stream Encryption

Block and stream encryption serve distinct roles: block secures data at rest,
while stream protects data in transit. Both techniques effectively prevent
unauthorized access but suit different application needs.

Key Differences
Aspect Block Encryption Stream Encryption

Data Handling Fixed-size blocks (e.g., 128 bits) Bit-by-bit continuous stream

Best For Storage (files, databases) Real-time transit (networks)

Speed Slower on large data Faster, low latency

Selection Criteria
Choose based on use case: prioritize block for high-security static data or
stream for efficient live communications. Both remain widely adopted
standards in modern systems

Advanced Encryption Standard (AES)

 AES is a highly secure symmetric block encryption algorithm widely used
for protecting sensitive data.
 Developed by Belgian cryptographers Joan Daemen and Vincent Rijmen, it
was adopted by NIST in 2001 as the replacement for the outdated DES.

Key Features
 AES uses a substitution-permutation network with mathematical operations
to transform 128-bit blocks of plaintext into ciphertext.
 Supports key sizes of 128, 192, or 256 bits; larger keys offer stronger
security.
 Encryption involves multiple rounds: 10 rounds for 128-bit keys, 12 rounds
for 192-bit keys, and 14 rounds for 256-bit keys.

Security Strengths
 Resistant to brute force, differential, and linear cryptanalysis attacks.
 Designed to protect highly sensitive information, including government
classified data.

Applications and Advantages

 Used extensively to secure data at rest (e.g., storage devices) and data in
transit (e.g., HTTPS websites).
 Provides fast and efficient encryption and decryption, even for large data
volumes.
 Ideal for applications requiring a strong balance of security, speed, and
efficiency such as large-scale data processing, web browsers, and
messaging apps.

Key Distribution & Random Number

Generation
Key Distribution
 Key distribution is securely delivering encryption keys to authorized users
without exposure to unauthorized parties.
 The security of encryption hinges on key secrecy; attackers with key access
can decrypt sensitive data.
 Common methods include:
 Public Key Infrastructure (PKI): Users have public/private key pairs.
Messages encrypted with the recipient’s public key can only be decrypted
with their private key.
 Key exchange protocols like Diffie-Hellman, where parties exchange public
keys and derive a shared secret key for secure communication.

Random Number Generation

 Essential for cryptography to generate unpredictable keys, salts, and
nonces.
 Two main types:
 Pseudo-Random Number Generators (PRNGs): Use deterministic algorithms
based on a seed value; fast and efficient but less secure because the seed
can be guessed.
 True Random Number Generators (TRNGs): Use physical entropy sources
like radioactive decay or atmospheric noise for true randomness; more
secure but slower and costlier.
 Quantum Random Number Generation (QRNG) leverages quantum
mechanics principles for secure, truly random numbers, offering improved
security over classical methods.

Importance
 Strong key distribution and high-quality randomness prevent attackers from
guessing encryption parameters.
 Continuous advancements in random number generation strengthen the
security and reliability of cryptographic systems.

Key Distribution & Random Number

Generation
Key Distribution
 Key distribution securely delivers encryption keys to authorized users,
preventing unauthorized access.
 Security depends on keeping the encryption key secret; attackers with the
key can decrypt data.
 Common methods:
 Public Key Infrastructure (PKI): Users have a public key (shared openly)
and a private key (kept secret). Messages encrypted with the recipient’s
public key can only be decrypted with their private key.
 Diffie-Hellman Key Exchange: Two parties generate and exchange
public keys, then compute a shared secret key used to encrypt
communications.
 Hybrid systems: Asymmetric cryptography securely exchanges symmetric
keys, which encrypt bulk data efficiently.

Random Number Generation

 Essential for cryptography to create unpredictable encryption parameters
(keys, salts, nonces).
 Two main types:
 Pseudo-Random Number Generators (PRNGs): Algorithm-generated,
deterministic sequences based on a seed; fast but less secure if the seed is
compromised.
 True Random Number Generators (TRNGs): Use physical processes
(radioactive decay, atmospheric noise) for true randomness; more secure
but slower and costlier.
 Quantum Random Number Generation (QRNG): Uses quantum
mechanics principles to generate secure, truly random numbers, advancing
cryptographic security.

Importance
 Robust key distribution and high-quality random number generation are
critical to cryptographic security.
 Advances in random number generation technologies continue to enhance
the reliability of encryption systems.

HISTORY

Public Key Cryptography History

Public key cryptography revolutionized encryption by using two keys (public
for encrypting, private for decrypting) instead of one shared secret key.

Timeline
 Year Milestone Key Figures

1976 Concept introduced: "New Directions in Cryptography" paper Diffie & Hellman

1977 RSA cryptosystem invented using large primes Rivest, Shamir, Adleman

1985 First elliptic curve cryptosystem proposed Victor Miller

1988 Elliptic Curve Cryptography (ECC) formalized for efficiency Neal Koblitz & Miller

Impact
 Enables secure internet transactions, e-commerce, digital signatures
without physical key exchange.
 Foundation for HTTPS, email security, modern cybersecurity.

HOW PUBLIC KEY CRYPTOGRAPHY WORKS

How Public Key Cryptography Works

 Two Keys Used:
 Public key: Used to encrypt data, shared openly.
 Private key: Used to decrypt data, kept secret by owner.
Data encrypted with one key can only be decrypted with the other, enabling
secure communication over insecure networks.
 Secure Internet Example (HTTPS):
 Browser verifies web server’s public key authenticity.
 Browser encrypts data with server's public key.
 Server decrypts data with its private key.
 Server can encrypt data with browser’s public key, decrypted by browser’s
private key.
This process ensures privacy without sharing secret keys beforehand.

Advantages over Symmetric Cryptography

 Symmetric uses one shared secret key for encrypting and decrypting,
which is difficult to securely distribute.
 Public key cryptography removes this need, allowing secure communication
without sharing secret keys.

Key and Encryption Example

 A cryptographic key is a long string of data used to scramble plaintext into
unreadable ciphertext.
 Example: Message "hello" encrypted with key "2jd8932kd8" becomes
"X5x)CSycg14=*", which can only be decrypted back with the same key.
 Symmetric uses one key for both steps; public key cryptography uses
a pair of keys: public for encryption, private for decryption.

Usage
 Public key cryptography is essential for secure email, digital signatures,
online banking, and underpins TLS/SSL protocols enabling HTTPS for secure
web browsing.

RSA & Hash Functions History

RSA (1977) by Rivest, Shamir, Adleman is a public key system enhanced by
hash functions for digital signatures and authentication.

Hash Evolution Timeline

Year Hash Function Key Facts Status

 Original RSA hash function developed

by Rivest
 128-bit hash function
1989 MD2 (Message Digest 2)  for RSA signatures Insecure

 Developed by Rivest
 Improved MD2 Vulnerable to certain types of
1990 MD4 (Message Digest 4)  128-bit hash function attacks

 Developed by Rivest
 128-bit hash function Vulnerable to in the area of
1992 MD5 (Message Digest 5)  widely used Collision attacks

Secure Hash Algorithm  first iteration of the SHA Family

2000 (SHA) - 1  MD5-based Deprecated

 Includes SHA-224, 256,384 and 512

SHA-2  secure standard Current use

Impact
Rivest's MD series paved way for NIST SHA family; used in signatures,
verifying data integrity. RSA + SHA-2 remains cybersecurity cornerstone.
 How RSA Hash Functions Work
RSA combines hashing with asymmetric encryption to ensure secure data
transmission and authentication. The process starts with a hash function
that takes a message of any length and produces a fixed-size hash value—a
unique fingerprint of the data. This hash value is then encrypted using RSA
algorithms that use two distinct keys: a public key and a private key. RSA
leverages one's private key to encrypt data (like a digital signature) that
can be decrypted only with the corresponding public key, confirming
authenticity and data integrity.

Asymmetric Encryption Key Pair Usage

 Asymmetric encryption uses two different keys owned by the receiver: a
public key for encryption and a private key for decryption.
 The sender encrypts the message using the receiver’s public key.
 Only the receiver can decrypt the message using their private key.
 This eliminates the need for exchanging a shared secret key, which
enhances security by reducing opportunities for interception.

Example of Message Encryption

 Step 1: Alice obtains Bob’s public key and uses it to encrypt her message.
 Step 2: The encrypted message is sent over to Bob securely.
 Step 3: Bob uses his private key to decrypt the message and read it.
 This process ensures that only Bob can read messages sent to him by Alice
without any secret key exchange.

Digital Signature Setup with RSA

 The sender produces a hash of the original message.
 This hash is encrypted with the sender’s private key, creating a digital
signature.
 The recipient decrypts the signature using the sender’s public key.
 The recipient also hashes the received message and compares the two
hashes.
 If the hashes match, data integrity and sender authenticity are verified.
 Benefits of RSA and Asymmetric Encryption
 No need for key exchange, reducing the risk of interception.
 Provides confidentiality of the message with receiver's public-private key
pair.
 Provides authentication and integrity with digital signatures.
 Widely used in secure communications, online transactions, and digital
certificates.

This content clearly explains the workings of RSA hash functions and
asymmetric encryption with practical steps and benefits, suitable for a
PowerPoint presentation.

How RSA Hash Functions Work

 RSA hash functions combine cryptographic hashing with asymmetric
encryption.
 A hash function takes a message and produces a fixed-length unique
digest.
 RSA uses a pair of keys—public and private—to encrypt and decrypt the
hash or message digitally.
 This ensures the integrity and authenticity of the message.

Asymmetric Encryption Key Pair

 Asymmetric encryption uses two distinct keys owned by the receiver:
 Public key: used to encrypt the message.
 Private key: used to decrypt the message.
 The public key can be shared openly, while the private key remains secret.
 This method removes the need for key exchange required in symmetric
encryption.

Message Encryption Process Example

 Step 1: Alice encrypts her message using Bob's public key.
 Step 2: The encrypted message is sent securely to Bob.
 Step 3: Bob decrypts the message using his private key.
 Only Bob can decrypt Alice’s message, ensuring secure communication
without shared secret keys.

Security Advantage of Asymmetric

Encryption
 No secret key needs to be exchanged, reducing exposure to interception.
 The encrypted message can only be decrypted by the intended receiver
owning the private key.
 This reduces the security risks compared to symmetric key exchange.

Next Step: Digital Signature Architecture

 Digital signatures use the sender’s private key to encrypt the message
hash.
 The receiver uses the sender’s public key to verify the signature.
 This confirms sender authenticity and message integrity.

This content clearly explains how RSA hash functions work alongside
asymmetric encryption key usage and the message encrypt/decrypt
workflow, matching your description perfectly.