12045159
Description
Mind Map by Niels de Jonge, updated more than 1 year ago
|
Created by Niels de Jonge
almost 7 years ago
|
|
Chapter 6 - CISSP Domain 3 - Cryptographic and Symmetric Algorithms
- Historical
- Ceaser Cipher
- ROT3
- 'Rotate 3' = A becomes D, Z Becomes C etc.
- Simple crack by Frequency Analysis
- 'Rotate 3' = A becomes D, Z Becomes C etc.
- ROT3
- American Civil War
- Flag signs
- Cipherdisks
- Codebooks
- Flag signs
- WW II
- Enigma
- Ultra
- Purple
Machine
- Enigma
- Ceaser Cipher
- Crypto Bascis
- Goals of Cryptography
- Confidentiality
- Symmetric
- Shared
Secret
- Public key
- Public key
- Shared
Secret
- A-Symmetric
- consists of a combination of
Private & Public Keys
- consists of a combination of
Private & Public Keys
- Symmetric
- Integrity
- Safeguard
through Digital
Signatures
- Protection from
unauthorized
modification; technique
used in MitM
- Safeguard
through Digital
Signatures
- Authentication
- Enforce challenge
Response on shared
secret
- Enforce challenge
Response on shared
secret
- Nonrepudiation
- Provide
evidence of
sending
- Protection from
masquerading;
technique used in MitM
- Provide
evidence of
sending
- Data in Motion
- Data at Rest
- Confidentiality
- Cryptographic
Concepts
- Plaintext + Encryption =
Ciphertext
- Cryptographic Algorithm
- knows a
Key
- is a Key
Space
- consist of a
Bit Size
- consist of a Binary
code string ( 0 & 1)
- consist of a Binary
code string ( 0 & 1)
- is a Range between 0000... and 1111... or
0 to 2^n, where n is the bit size, is a
range inside the algorithm a.k.a. the key
- consist of a
Bit Size
- is a Key
Space
- knows a
Key
- Cryptographic Algorithm
- Cryptology
- Cryptanalysis
- Cryptography
- Cryptanalysis
- Plaintext + Encryption =
Ciphertext
- Cryptographic Mathematics
- Boolean
- True or False ( 1
or 0 ) On or Off
- True or False ( 1
or 0 ) On or Off
- Logical
- AND
- X^Y
- X=1 Y=1 X^Y=1
Annotations:
- X 110011010 Y 010100011 X^Y . 010000010
- X=1 Y=1 X^Y=1
- Two values
both true
- X^Y
- OR
- X∨Y
- X=0 Y=1
X∨Y=1
Annotations:
- Y 100111100 X . 100110001 X∨Y . 100111101
- X=0 Y=1
X∨Y=1
- One of the
values is
true
- X∨Y
- NOT
- ~ or !
- X=0
~X=1
Annotations:
- X . 11001101010 ~X . 00110010101
- X=0
~X=1
- Opposites
- ~ or !
- Exclusive OR /
XOR
- ⊕
- X=1 Y=1
X⊕Y=0
Annotations:
- X . 101001110001 Y . 110011100101 X⊕Y . 011010010100
- X=1 Y=1
X⊕Y=0
- Only one of the
values is true
- ⊕
- AND
- Modulo Function
(mod)
- mod
- Remainder value left
after a possible and ideal
division operation
Annotations:
- 4 mod 1 = 0 5 mod 2 = 1 65 mod 92 = 65 6 mod 6 = 0 82 mod 10 = 2 14 mod 5 = 4 64 mod 7 = 1
- Remainder value left
after a possible and ideal
division operation
- mod
- One-Way
Functions
- Math operation producing values
for each possible input
combination without possibility of
retrieval of input value
- basis for Public key
cryptosystems
- basis for Public key
cryptosystems
- Work Function =/= Work Factor
- Time needed to break
encryption
- Time needed to break
encryption
- Math operation producing values
for each possible input
combination without possibility of
retrieval of input value
- Nonce
- Added randomness to
the encryption process
- Added randomness to
the encryption process
- Zero Proof Knowledge
- Magicdoor principle
- Magicdoor principle
- Split knowledge
- Key escrow
- Segragation of duty by having
multiple agents nessecary in
order to decrypt
- Key escrow
- Ciphers
- Hide true meaning /
works on charaters
and bits
- Transposition cipher
- Rearrange the
sequence of the
characters
- Rearrange the
sequence of the
characters
- Substitution cipher
- Replacement of
character by
another
- Replacement of
character by
another
- Hide true meaning /
works on charaters
and bits
- Codes
- Codes represent words or
phrases / are sometimes
public knowledge
- Codes represent words or
phrases / are sometimes
public knowledge
- Boolean
- Goals of Cryptography
- Modern Cryptography
- Symmetric
Cryptography
- Cryptographic
Lifecycle
Want to create your own Mind Maps for free with GoConqr? Learn more.