Chapter 1 (1-5): Introduction to MLSA Flashcards

1
Q

the science of encryption

A

Cryptography

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

the science of breaking encryption

A

Cryptanalysis

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

combination of cryptography and cryptanalysis.

A

Cryptology

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

has been used in human communication for millennia as a way to preserve confidential information.

A

Cryptography

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

[7] Some Example of Cryptography

A
  • Egyptian Nonstandard Hieroglyphs
  • Spartans Scytale
  • Caesar Cipher
  • Vigenere Table
  • Zimmerman Telegram
  • Code Talker
  • Enigma Machine
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

is a type of cryptography where every letter is replaced by a non-standard character.

A

Egyptian Nonstandard Hieroglyphs

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

is one of the simplest and most widely known encryptions. Each letter in the plaintext is replaces by a letter some fixed number of positions down the alphabet.

A

Caesar Cipher

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

a substitution type cypher that uses a table and a keywork in generating ciphertext.

A

Vigenere Table

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

was a secret diplomatic communication issued from the Germany Foreign Office.

A

Zimmerman Telegram

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

was a person employed by the military to use a little-known language as a mean o secret communication.

A

Code Talker

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

is a cipher device developed and user by Nazi Germany during World War II.

A

Enigma Machine

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

a mathematical algorithm that takes plain text and changes it into ciphertext for security purposes.

A

Modern Cryptography

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

is any cryptographic algorithm that is based on a shared key that is used to encrypt and decrypt.

A

Symmetric Cryptosystem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q
  • The same method is used for encrypting and decrypting.
A

Symmetric Cryptosystem

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

this method uses two different methods in cryptographic process.

A

Asymmetric Cryptosystem

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

each plaintext digit is encrypted one at a time with corresponding digit of the keystream, to give a digit of the ciphertext stream.

A

Stream Cipher

17
Q

The encryption is done character by character in a form of a stream.

A

Stream Cipher

18
Q

is a deterministic algorithm operating on fixed-length groups of bits called blocks.

A

Block Cipher

19
Q

The plaintext is divided into several block. Encryption is done block by block.

A

Block Cipher

20
Q

is a method in cryptography by which cryptographic keys are exchanged between two parties, allowing use of cryptographic algorithm.

A

Key Exchange Protocol

21
Q

[2] Cryptography Goals

A
  1. Encryption
  2. Authentication
22
Q

prevent other from intercepting message.

A

Encryption

23
Q

prevent someone from impersonating the receiver of the message.

A

Authentication

24
Q

[4] Cryptographic Attacks

A
  1. Ciphertext Only
  2. Known Plaintext
  3. Chosen Plaintext
  4. Distinguishing Attack
25
Q

attacker has only ciphertext.

A

Ciphertext Only

26
Q

attacker has plaintext and corresponding ciphertext.

A

Known Plaintext

27
Q

attacker can encrypt messages of his choosing.

A

Chosen Plaintext

28
Q

an attacker can distinguish your cipher from an ideal cipher.

A

Distinguishing Attack

29
Q

the security of an encryption system must depend only on the key, not on the secrecy of the algorithm.

A

Kerckhoffs’ Principle

30
Q

is the computational task of finding representative of a residue class. It goes with the principle, easy to compute but hard to reverse.

A

Discrete Logarithm Problem

31
Q

is an asymmetric key encryption algorithm got public-key cryptography which is based on Diffie-Hellman Key Exchange Protocol.

A

El Gamal Cryptosystem

32
Q

described the El Gamal Cryptosystem.

A

Taher Elgamal (1985)

33
Q

is a variant of El Gamal signature scheme, which should not be confused WITH Elg Gamal Encryption.

A

Digital Signature Algorithm (DSA)

34
Q

was first published in Scientific American, August 1977. It is currently the “work horse” of internet security.

A

RSA Cryptosystem