ch5 Flashcards

(33 cards)

1
Q

Cryptography

A

is the science of encrypting, or hiding, information—
* something people have sought to do since they began using language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Cryptographic algorithms (Ciphers)

A

are complicated methods of concealing
information by shifting letters around to make the text unreadable.
- is made up of mathematical steps for encrypting and decrypting information

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Cryptanalysis

A

is the process of analyzing available information in an attempt
to return the encrypted message to its original form.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Plaintext

A

data to be protected

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Ciphertext

A

Encrypted plaintext data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Key

A

secret data needed to encrypt/decrypt ciphertext

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Encrypt/encode/encipher

A

plaintext → ciphertext

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Decrypt/decode/decipher

A

ciphertext → plaintext

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Cryptography is much more than encryption. Cryptographic methods
enable:

A
  • Data protection
  • Data hiding
  • Integrity checks
  • Nonrepudiation services
  • Policy enforcement
  • Key management and exchange
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

When you’re examining the strength of a cryptosystem, it is worth examining the following types of levels of protection / point must be consider when examining:

A
  1. The mechanism is no longer useful for any purpose.
  2. The cost of recovering the clear text without benefit of the key has fallen to a low
    level.
  3. The cost has fallen to equal to or less than the value of the data or the next leastcost attack.
  4. The cost has fallen to within several orders of magnitudes of the cost of encryption
    or the value of the data.
  5. The elapsed time of attack has fallen to within magnitudes of the life of the data,
    regardless of the cost thereof.
  6. The cost has fallen to less than the cost of a brute force attack against the key.
  7. Someone has recovered one key or one message
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Cryptographic Operation include:

A
  • Encryption (for the protection of confidentiality - protection against unauthorized
    disclosure, i.e., only someone with the key can read the data)
  • Hashing (for the protection of integrity - protection against unauthorized modification,
    i.e., only someone with the key can create or modify the data)
  • Digital signatures (to manage nonrepudiation)
  • Key exchanges and other operations.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

The methods used to encrypt information are based on two separate
operations:

A
  • Substitution: is the replacement of one item with another item.
  • Transposition: is the changing of the order of items.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

The strength of a cryptographic algorithm depends on Several factors:

A

1- The Key size and the resulting keyspace (a set of possible key
values)
2- The work factor (a subjective measurement of the time and effort
needed to perform operations)
- If the work factor is low, then the rate at which keys can be tested
is high, meaning that larger keyspaces are needed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Cryptographic methods exist for a purpose to protect the integrity and
confidentiality of data. There are many elements support this protection:

A
  • Diffusion: is the principle that the statistical analysis of plaintext and
    ciphertext results in a form of dispersion rendering one structurally
    independent of the other.
  • Confusion: is a principle that affects the randomness of an output.
  • Obfuscation: is the masking of an item to render it unreadable, yet still
    usable.
  • Perfect Forward Secrecy: is a property of a public key system in which a key
    derived from another key is not compromised even if the originating key is
    compromised in the future.
  • Security Through Obscurity: is an approach to security using the mechanism
    of hiding information to protect it.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Common Types of Encryption Algorithms:

A
  1. Hashing: takes an input and mathematically reduces it to a unique
    number known as a hash, which is not reversible.
  2. Symmetric: the same key is used for encryption and decryption.
  3. Asymmetric: uses two keys, a public key and a private key.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

hash function

A

is a special mathematical
function that performs a one-way function to generate a message
summary for data integrity.

17
Q

One-way function

A

means that once the algorithm is processed, there
is no feasible way to use the ciphertext to retrieve the plaintext that
was used to generate it

18
Q

Hash value

A

is the output of the hashing algorithm for a specific input.
- A hash algorithm can be compromised with what is called a (collision attack), in which an attacker finds two different messages that hash to the same
value.

19
Q

The Popular hash algorithms are in common use are:

A
  • Message Digest (MD): hash of varying versions (MD2, MD4, MD5)
  • Secure Hash Algorithm: series (SHA-1, SHA-2, SHA-3)
20
Q

Symmetric Encryption

A

** check p13
- older and simpler method of encrypting information.
- both the sender and the
receiver of the message have previously obtained the same key.
- based on this shared secret principle,
including the unbreakable one-time pad method.

21
Q

Two requirements for secure use of symmetric encryption:

A
  • a strong encryption algorithm
  • a secret key known only to sender / receiver
    Y = E^K(X)
    X = D^K(Y)
22
Q

Asymmetric encryption / Asymmetric object

A

is a public/private keypair encryption used for authentication, nonrepudiation, and confidentiality.

23
Q

Asymmetric cryptography uses pair of keys:

A
  • a private key that is kept secret
  • a public key that can be sent to anyone.
24
Q

Public key applications can be classified into 3 categories:

A
  • encryption/decryption (provide secrecy)
  • digital signatures (provide authentication)
  • key exchange (of session keys)
25
Asymmetric algorithms include:
RSA, Diffie-Hellman, ElGamal, and ECC
26
Examples of the more popular symmetric encryption algorithms
used today are: DES, 3DES, AES, ChaCha20, CAST, Twofish, and IDEA
27
Symmetric vs. Asymmetric
* Symmetric encryption tends to be faster, is less computationally involved, and is better for bulk transfers. But it suffers from a key management problem in that keys must be protected from unauthorized parties. * Asymmetric methods resolve the key secrecy issue with public keys, but add significant computational complexity that makes them less suited for bulk encryption. - Bulk encryption can be done using the best of both systems, by using asymmetric encryption to pass a symmetric key.
28
substitution ciphers
one letter of the alphabet is shifted a set number of places in the alphabet for another letter.
29
Caesar’s cipher is a substitution cipher that uses:
** check p 18 1. Algorithm: specifies that you offset the alphabet either to the right (forward) or to the left (backward) 2. key: specifies how many letters the offset should be. - For example, if the algorithm specifies forward offsetting, and the key is 3, the cipher substitutes an alphabetic letter three to the right for the real letter, so d is used to represent a, f represents c, and so on.
30
Polyalphabetic substitution cipher
** check p 20 depends on a password.
31
Atbash cipher
** check p 21 is a specific form of a monoalphabetic substitution cipher. * The cipher is formed by taking the characters of the alphabet and mapping to them in reverse order. * The first letter becomes the last letter, the second letter becomes the second-to-last letter, and so on.
32
one-time pads
p22
33
RSA Algorithm
p24