0% found this document useful (0 votes)
188 views46 pages

07 - Basic Cryptography

The document defines basic cryptography concepts and algorithms. It discusses hashing algorithms like MD5 and SHA that secure data integrity without transmitting the original value. It then covers symmetric encryption algorithms like DES, AES, and RC4 that use a single key to encrypt and decrypt, requiring the key to be kept secret. Finally, it discusses asymmetric or public-key encryption algorithms that harden security by using two keys: a private key to encrypt and a public key to decrypt, eliminating the need to share secrets.

Uploaded by

Hưng Vdn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
188 views46 pages

07 - Basic Cryptography

The document defines basic cryptography concepts and algorithms. It discusses hashing algorithms like MD5 and SHA that secure data integrity without transmitting the original value. It then covers symmetric encryption algorithms like DES, AES, and RC4 that use a single key to encrypt and decrypt, requiring the key to be kept secret. Finally, it discusses asymmetric or public-key encryption algorithms that harden security by using two keys: a private key to encrypt and a public key to decrypt, eliminating the need to share secrets.

Uploaded by

Hưng Vdn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 46

 Basic cryptography

Objectives

• Define cryptography
• Secure with cryptography hashing algorithms
• Protect with symmetric encryption algorithms
• Harden with asymmetric encryption algorithms
• Explain how to use cryptography

Security+ Guide to Network Security 2


Fundamentals, 2e
Cryptography Terminology

• Cryptography: science of transforming information so


it is secure while being transmitted or stored
• Steganography: attempts to hide existence of data
• Encryption: changing the original text to a secret
message using cryptography

Security+ Guide to Network Security 3


Fundamentals, 2e
Cryptography Terminology
(continued)
• Decryption: reverse process of encryption
• Algorithm: process of encrypting and decrypting
information based on a mathematical procedure
• Key: value used by an algorithm to encrypt or decrypt
a message

Security+ Guide to Network Security 4


Fundamentals, 2e
Cryptography Terminology
(continued)
• Weak key: mathematical key that creates a
detectable pattern or structure
• Plaintext: original unencrypted information (also
known as clear text)
• Cipher: encryption or decryption algorithm tool used
to create encrypted or decrypted text
• Ciphertext: data that has been encrypted by an
encryption algorithm

Security+ Guide to Network Security 5


Fundamentals, 2e
Cryptography Terminology
(continued)

Security+ Guide to Network Security 6


Fundamentals, 2e
How Cryptography Protects

• Intended to protect the confidentiality of information


• Second function of cryptography is authentication
• Should ensure the integrity of the information as well
• Should also be able to enforce nonrepudiation, the
inability to deny that actions were performed
• Can be used for access control

Security+ Guide to Network Security 7


Fundamentals, 2e
Securing with Cryptography Hashing
Algorithms
• One of the three categories of cryptographic
algorithms is known as hashing

Security+ Guide to Network Security 8


Fundamentals, 2e
Defining Hashing

• Hashing, also called a one-way hash, creates a


ciphertext from plaintext
• Cryptographic hashing follows this same basic
approach
• Hash algorithms verify the accuracy of a value
without transmitting the value itself and subjecting it
to attacks
• A practical use of a hash algorithm is with automatic
teller machine (ATM) cards

Security+ Guide to Network Security 9


Fundamentals, 2e
Defining Hashing (continued)

Security+ Guide to Network Security 10


Fundamentals, 2e
Defining Hashing (continued)

• Hashing is typically used in two ways:


– To determine whether a password a user enters is
correct without transmitting the password itself
– To determine the integrity of a message or contents of
a file
• Hash algorithms are considered very secure if the
hash that is produced has the characteristics listed
on pages 276 and 277 of the text

Security+ Guide to Network Security 11


Fundamentals, 2e
Defining Hashing (continued)

Security+ Guide to Network Security 12


Fundamentals, 2e
Message Digest (MD)

• Message digest 2 (MD2) takes plaintext of any length


and creates a hash 128 bits long
– MD2 divides the message into 128-bit sections
– If the message is less than 128 bits, data known as
padding is added
• Message digest 4 (MD4) was developed in 1990 for
computers that processed 32 bits at a time
– Takes plaintext and creates a hash of 128 bits
– The plaintext message itself is padded to a length of
512 bits

Security+ Guide to Network Security 13


Fundamentals, 2e
Message Digest (MD)
(continued)
• Message digest 5 (MD5) is a revision of MD4
designed to address its weaknesses
– The length of a message is padded to 512 bits
– The hash algorithm then uses four variables of 32 bits
each in a round-robin fashion to create a value that is
compressed to generate the hash

Security+ Guide to Network Security 14


Fundamentals, 2e
Secure Hash Algorithm (SHA)

• Patterned after MD4 but creates a hash that is


160 bits in length instead of 128 bits
• The longer hash makes it more resistant to attacks
• SHA pads messages less than 512 bits with zeros
and an integer that describes the original length of
the message

Security+ Guide to Network Security 15


Fundamentals, 2e
Protecting with Symmetric Encryption
Algorithms
• Most common type of cryptographic algorithm (also
called private key cryptography)
• Use a single key to encrypt and decrypt a message
• With symmetric encryption, algorithms are designed
to decrypt the ciphertext
– It is essential that the key be kept confidential: if an
attacker secured the key, she could decrypt any
messages

Security+ Guide to Network Security 16


Fundamentals, 2e
Protecting with Symmetric Encryption
Algorithms (continued)
• Can be classified into two distinct categories based
on amount of data processed at a time:
– Stream cipher (such as a substitution cipher)
– Block cipher
• Substitution ciphers substitute one letter or character
for another
– Also known as a monoalphabetic substitution cipher
– Can be easy to break

Security+ Guide to Network Security 17


Fundamentals, 2e
Protecting with Symmetric Encryption
Algorithms (continued)

Security+ Guide to Network Security 18


Fundamentals, 2e
Protecting with Symmetric Encryption
Algorithms (continued)
• A homoalphabetic substitution cipher maps a single
plaintext character to multiple ciphertext characters
• A transposition cipher rearranges letters without
changing them
• With most symmetric ciphers, the final step is to
combine the cipher stream with the plaintext to create
the ciphertext

Security+ Guide to Network Security 19


Fundamentals, 2e
Protecting with Symmetric Encryption
Algorithms (continued)

Security+ Guide to Network Security 20


Fundamentals, 2e
Protecting with Symmetric Encryption
Algorithms (continued)
• A block cipher manipulates an entire block of
plaintext at one time
• The plaintext message is divided into separate blocks
of 8 to 16 bytes and then each block is encrypted
independently
• The blocks can be randomized for additional security

Security+ Guide to Network Security 21


Fundamentals, 2e
Data Encryption Standard (DES)
• One of the most popular symmetric cryptography
algorithms
• DES is a block cipher and encrypts data in 64-bit
blocks
• The 8-bit parity bit is ignored so the effective key
length is only 56 bits
• DES encrypts 64-bit plaintext by executing the
algorithm 16 times
• The four modes of DES encryption are summarized
on pages 282 and 283

Security+ Guide to Network Security 22


Fundamentals, 2e
Triple Data Encryption
Standard (3DES)
• Uses three rounds of encryption instead of just one
• The ciphertext of one round becomes the entire input
for the second iteration
• Employs a total of 48 iterations in its encryption
(3 iterations times 16 rounds)
• The most secure versions of 3DES use different keys
for each round

Security+ Guide to Network Security 23


Fundamentals, 2e
Advanced Encryption
Standard (AES)
• Approved by the NIST in late 2000 as a replacement
for DES
• Process began with the NIST publishing
requirements for a new symmetric algorithm and
requesting proposals
• Requirements stated that the new algorithm had to
be fast and function on older computers with 8-bit,
32-bit, and 64-bit processors

Security+ Guide to Network Security 24


Fundamentals, 2e
Advanced Encryption Standard
(AES) (continued)
• Performs three steps on every block (128 bits) of
plaintext
• Within step 2, multiple rounds are performed
depending upon the key size:
– 128-bit key performs 9 rounds
– 192-bit key performs 11 rounds
– 256-bit key uses 13 rounds

Security+ Guide to Network Security 25


Fundamentals, 2e
Rivest Cipher (RC)

• Family of cipher algorithms designed by Ron Rivest


• He developed six ciphers, ranging from RC1 to RC6,
but did not release RC1 and RC3
• RC2 is a block cipher that processes blocks of 64 bits
• RC4 is a stream cipher that accepts keys up to
128 bits in length

Security+ Guide to Network Security 26


Fundamentals, 2e
International Data Encryption
Algorithm (IDEA)
• IDEA algorithm dates back to the early 1990s and is
used in European nations
• Block cipher that processes 64 bits with a 128-bit key
with 8 rounds

Security+ Guide to Network Security 27


Fundamentals, 2e
Blowfish

• Block cipher that operates on 64-bit blocks


• Can have a key length from 32 to 448 bits

Security+ Guide to Network Security 28


Fundamentals, 2e
Hardening with Asymmetric
Encryption Algorithms
• The primary weakness of symmetric encryption
algorithm is keeping the single key secure
• This weakness, known as key management, poses a
number of significant challenges
• Asymmetric encryption (or public key cryptography)
uses two keys instead of one
– The private key typically is used to encrypt the
message
– The public key decrypts the message

Security+ Guide to Network Security 29


Fundamentals, 2e
Hardening with Asymmetric
Encryption Algorithms (continued)

Security+ Guide to Network Security 30


Fundamentals, 2e
Rivest Shamir Adleman (RSA)

• Asymmetric algorithm published in 1977 and


patented by MIT in 1983
• Most common asymmetric encryption and
authentication algorithm
• Included as part of the Web browsers from Microsoft
and Netscape as well as other commercial products
• Multiplies two large prime numbers

Security+ Guide to Network Security 31


Fundamentals, 2e
Diffie-Hellman

• Unlike RSA, the Diffie-Hellman algorithm does not


encrypt and decrypt text
• Strength of Diffie-Hellman is that it allows two users
to share a secret key securely over a public network
• Once the key has been shared, both parties can use
it to encrypt and decrypt messages using symmetric
cryptography

Security+ Guide to Network Security 32


Fundamentals, 2e
Elliptic Curve Cryptography

• First proposed in the mid-1980s


• Instead of using prime numbers, uses elliptic curves
• An elliptic curve is a function drawn on an X-Y axis as
a gently curved line
• By adding the values of two points on the curve, you
can arrive at a third point on the curve

Security+ Guide to Network Security 33


Fundamentals, 2e
Understanding How to Use
Cryptography
• Cryptography can provide a major defense against
attackers
• If an e-mail message or data stored on a file server is
encrypted, even a successful attempt to steal that
information will be of no benefit if the attacker cannot
read it

Security+ Guide to Network Security 34


Fundamentals, 2e
Digital Signature

• Encrypted hash of a message that is transmitted


along with the message
• Helps to prove that the person sending the message
with a public key is whom he/she claims to be
• Also proves that the message was not altered and
that it was sent in the first place

Security+ Guide to Network Security 35


Fundamentals, 2e
Benefits of Cryptography

• Five key elements:


– Confidentiality
– Authentication
– Integrity
– Nonrepudiation
– Access control

Security+ Guide to Network Security 36


Fundamentals, 2e
Benefits of Cryptography (continued)

Security+ Guide to Network Security 37


Fundamentals, 2e
Pretty Good Privacy (PGP) and
GNU Privacy Guard (GPG)
• PGP is perhaps most widely used asymmetric
cryptography system for encrypting e-mail messages
on Windows systems
– Commercial product
• GPG is a free product

Security+ Guide to Network Security 38


Fundamentals, 2e
Pretty Good Privacy (PGP) and GNU
Privacy Guard (GPG) (continued)
• GPG versions run on Windows, UNIX, and Linux
operating systems
• PGP and GPG use both asymmetric and symmetric
cryptography
• PGP can use either RSA or the Diffie-Hellman
algorithm for the asymmetric encryption and IDEA for
the symmetric encryption

Security+ Guide to Network Security 39


Fundamentals, 2e
Microsoft Windows Encrypting
File System (EFS)
• Encryption scheme for Windows 2000, Windows XP
Professional, and Windows 2003 Server operating
systems that use the NTFS file system
• Uses asymmetric cryptography and a per-file
encryption key to encrypt and decrypt data
• When a user encrypts a file, EFS generates a file
encryption key (FEK) to encrypt the data

Security+ Guide to Network Security 40


Fundamentals, 2e
Microsoft Windows Encrypting File
System (EFS) (continued)
• The FEK is encrypted with the user’s public key and
the encrypted FEK is then stored with the file
• EFS is enabled by default
• When using Microsoft EFT, the tasks recommended
are listed on page 293 of the text

Security+ Guide to Network Security 41


Fundamentals, 2e
UNIX Pluggable Authentication
Modules (PAM)
• When UNIX was originally developed, authenticating
a user was accomplished by requesting a password
from the user and checking whether the entered
password corresponded to the encrypted password
stored in the user database /etc/passwd
• Each new authentication scheme requires all the
necessary programs, such as login and ftp, to be
rewritten to support it

Security+ Guide to Network Security 42


Fundamentals, 2e
UNIX Pluggable Authentication
Modules (PAM) (continued)
• A solution is to use PAMs
• Provides a way to develop programs that are
independent of the authentication scheme

Security+ Guide to Network Security 43


Fundamentals, 2e
Linux Cryptographic File
System (CFS)
• Linux users can add one of several cryptographic
systems to encrypt files
• One of the most common is the CFS
• Other Linux cryptographic options are listed on pages
294 and 295 of the text

Security+ Guide to Network Security 44


Fundamentals, 2e
Summary

• Cryptography seeks to fulfill five key security


functions: confidentiality, authentication, integrity,
nonrepudiation, and access control
• Hashing, also called a one-way hash, creates a
ciphertext from plaintext
• Symmetric encryption algorithms use a single key to
encrypt and decrypt a message

Security+ Guide to Network Security 45


Fundamentals, 2e
Summary (continued)

• A digital certificate helps to prove that the person


sending the message with a public key is actually
whom they claim to be, that the message was not
altered, and that it cannot be denied that the
message was sent
• The most widely used asymmetric cryptography
system for encrypting e-mail messages on Windows
systems is PGP

Security+ Guide to Network Security 46


Fundamentals, 2e

You might also like