What is Cryptography | Introduction to Cryptography | Cryptography Training | Edureka Rewind

Overview

The video introduces cryptography as a way to protect data and communications from unauthorized access or interference. It uses a simple example: Andy sends a private message to Sam over the internet, while an attacker named Eve may be able to read or alter it. Cryptography transforms the message so that someone who intercepts it cannot readily understand it.

Core Concepts

• Plaintext: The original, readable message.
• Encryption: An algorithm uses a key to transform plaintext into an unreadable form.
• Ciphertext: The encrypted message sent across the communication channel.
• Decryption: An algorithm uses a key to turn ciphertext back into plaintext.
• Keys: Modern cryptographic security depends on protecting the appropriate key or keys—not on keeping the algorithm secret.

The presenter suggests that a decryption error or unexpected result could indicate tampering. This is an illustration rather than a general guarantee: encryption by itself does not necessarily detect every alteration.

Main Types of Cryptography

Symmetric-Key Cryptography

Symmetric-key cryptography uses the same key, or closely related keys, for encryption and decryption. The parties must securely share the secret key beforehand, which the video identifies as a key drawback.

The video describes two broad categories:

• Classical cryptography
  • Transposition ciphers: Rearrange the positions of characters or character groups while retaining the original characters. The example arranges “meet me after the party” in a grid, then reads it back in a different order using a key.
  • Substitution ciphers: Replace plaintext characters with other characters according to a substitution alphabet. The example uses the keyword “ZEBRAS” to form a mixed alphabet and encrypt a message.
• Modern cryptography
  • Stream ciphers: Process data one bit at a time.
  • Block ciphers: Process fixed-size blocks of data. The video gives AES as an example and mentions 128-bit blocks and key lengths of 128, 192, or 256 bits.

Asymmetric-Key Cryptography

Asymmetric-key cryptography, also called public-key cryptography, uses a paired public key and private key.

For confidentiality, a sender can encrypt a message with the receiver’s public key; only the corresponding private key can decrypt it. The public key can be distributed openly, while the private key must remain secret.

The video also describes public-key systems as supporting authentication: a public key can be used to verify a message associated with its paired private key.

RSA Demonstration and Procedure

The presenter introduces RSA, named for its inventors Ron Rivest, Adi Shamir, and Leonard Adleman, and walks through key generation, encryption, and decryption.

Key Generation

1. Choose two prime numbers, (p) and (q).
2. Calculate (n = p \times q).
3. Calculate (\varphi(n) = (p-1)(q-1)).
4. Choose (e), greater than 1 and less than (\varphi(n)), that is relatively prime to (\varphi(n)).
5. Publish ((n,e)) as the public key.
6. Find (d), the modular inverse of (e) modulo (\varphi(n)), such that (e \times d \equiv 1 \pmod{\varphi(n)}). Keep (d) private.

Encryption and Decryption

• Convert the message into a numerical form.
• Encrypt it using the public-key values (e) and (n).
• Decrypt the resulting ciphertext using the private-key values (d) and (n), then convert the numbers back into the message.

The worked example uses (p=5), (q=7), (n=35), and (\varphi(n)=24), with (e=11). The subtitles report (d=5), but this is inconsistent with RSA’s modular-inverse requirement. For these values, (d=11), since (11 \times 11 \equiv 1 \pmod{24}). The example is presented as a small demonstration; the video says practical RSA uses much larger primes.

Practical Examples

• The presenter shows how to inspect a website’s certificate information in a browser and points to YouTube’s use of an RSA-based signature and SHA-256, along with certificate authority details.
• A public-key encryption demo generates a public/private key pair, encrypts a sample message with the public key, and recovers it with the private key.

Speakers and Sources Featured

• Arya (Edureka): Presenter and instructor.
• YouTube’s browser certificate viewer: Demonstrated as a way to inspect certificate and signature details.
• webs.cs.uga.edu public-key encryption demo: Used for the public/private key and RSA examples.
• Ron Rivest, Adi Shamir, and Leonard Adleman: Named as the inventors of RSA; they are mentioned, not heard speaking.