Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

CISSP > PKI and Cryptographic Applications > Flashcards

PKI and Cryptographic Applications Flashcards

(64 cards)

Start Studying
1
Q

What are the THREE most common Public-Key Cryptosystems?

A

RSA, EL GAMAL and Elliptic Curve

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

In a Public-Key system how many keys does a user have ?

A

Two

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

What are the names of these TWO keys

A

Public Key - Known to everyone

Private Key - ONLY known and for the USER.

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

What does RSA stand for ?

A

Rivset, Shamir,Adleman ( These are the founders)

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

What are some facts about RSA

A
  1. Developed in 1977
  2. Worldwide standard
  3. Uses large PRIME NUMBERS to create key pairs
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What letters represent what in the RSA formula?

A

C = Cipher text

P = Plain Text

e= Public Key

d = Private Key

n = p+q

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

Out of all the expressions/letters in the RSA formula which one is the largest number?

A

ā€˜nā€™ as n = p+q

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

Why is Mark Hellman Knapsack different to RSA ?

A

Uses FACTORING SETS(Super increasing sets) instead of LARGE PRIME NUMBERS

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

What year was Mark Hellman Knapsack broken?

A

1984

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

What is Key length BEST PRACTICE ?

A
  1. Understand the encryption algorithm and Key length
  2. Time lines of the data ( eg. will it be sensitive for only a month then use a smaller key etc)
    • MORE IMPORTANT THE DATA , STRONGER the KEY to use
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

If the Key length for RSA and DSA is 1024 , what is the key length for Elliptic Curve ?

A

160 bit

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

What are some facts about EL GAMAL ?

A
  1. Extension of Diffie Hellman ( Symmetric Key exchange algorithm
  2. Provides encryption/ decryption of messages (NOT JUST KEY)
  3. Developed by Dr.T.EL GAMAL
  4. Doubles the length of ANY message it encrypts
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What are some facts about Elliptic Curve ?

A
  1. Developed by Mathematicians Neal Kobilitz and Victor Miller
  2. Proposed in 1985
  3. Harder to solve than PRIME FACTORISATION (Used by RSA)
  4. Only a small key is needed
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What does a hash function do ?

A

Creates a UNIQUE MESSAGE DIGEST

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

What TWO things can the Message digest be used for ?

A
  1. Non-Repudiation

2. Digital Signature

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

What is the bit size of Message digests?

A

128 bits or LARGER

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

What functions do single digit message digests provide ?

A
  1. Parity

2. Low level/Single digit checksum

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

RSA requirements for HASH FUNCTIONS

A
  1. INPUT can be ANY length.
  2. OUTPUT has a FIXED length
  3. HASH FUNCTION relatively easy to COMPUTE for any input.
  4. HASH FUNCTION are ONE-WAY.
  5. COLLISION FREE ( No two messages produce the SAME hash value)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

What does HAVAL stand for ?

A

Hash of Variable Length

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

What are some facts about HAVAL?

A
  1. Modification of MD5
  2. Uses 1024bit blocks
  3. Hash values 128,160,192,224,256
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

What hash function is a modification of MD5 ?

A

HAVAL

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

What are the FIVE hash values for HAVAL ?

A

128,160,192,224,256

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

What size block does HAVAL use ?

A

1024 bit

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

What does SHA stand for

A

Secure Hashing Algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
How many versions of SHA is there ?
3 ( SHA-1,SHA-2,SHA-3)
26
Out of all THREE SHA's what one is considered SECURE?
SHA-2
27
Who developed SHA-1 ?
NIST
28
Where is SHA-1 specified as a SECURE HASH STANDARD?
FIPS-180
29
What length size message can SHA-1 handle ?
Any size
30
What is the message digest size for SHA-1?
160bit | Message length needs to be a multiple of 512, IF not then SHA will parse the message until it is a multiple of 512
31
What are the FOUR variants of SHA-2?
1. SHA-256 2. SHA-224 3. SHA-512 4. SHA-384
32
What TWO of the variants are truncated versions of SHA ?
SHA-224 & SHA-384
33
What is the message digest size for all FOUR of the SHA-2 variants?
SHA-256 = 256 MD SHA-224 = 224 MD SHA-512 = 512 MD SHA-384 = 384 MD
34
What is the BLOCK SIZE for all FOUR of the SHA-2 variants?
SHA-256 = 512 bit block SHA-224 = 1024 bit block SHA-512 = 1024 bit block SHA-384 = 1024 bit block
35
What algorithm is confirmed as the SHA-3 standard ?
KEECAK
36
Is SHA-3 in use ?
no, it is still in DRAFT phase.
37
What does MD2 stand for ?
Message Digest 2
38
Who developed MD2,MD4 & MD5 ?
Ronald Rivset ( One of the RSA founders)
39
When was MD2 developed ?
1989
40
What is the MD2 message digest size ?
128 bit ( Original message + CHECKSUM)
41
What function does MD2 NOT have ?
One way function
42
What size bit processor does MD2 support?
8 bit
43
Is MD2 still in use ?
NO
44
MD2 Facts ?
- Developed by Ronald Rivset in 1989 ( One of the RSA founder) - Provide a SECURE hash function for 8 bit processors - Pads the message so that the length is a multiple of 16 bytes. - Computes a 16 byte CHECKSUM and ADDS it to the END of the message - 128bit Message digest ( Original message and the added CHECKSUM) ** If CHECKSUM computed after MESSAGE DIGEST -- COLLISIONS may OCCUR ( Nathanlie Rogier, Pascal Chavad) - NO One-Way function !!! ** !! ** THIS IS NO LONGER USED ** !! **
45
What does MD4 stand for ?
Message Digest 4
46
What size bit processor does MD4 support?
32
47
Has the security increased in MD4 compared to MD2
YES
48
What size does a message length need to be for MD4 ?
Message length needs to be 64 bits less than multiple of 512 ( If not then it will pad until it reaches that)
49
EXAMPLE ; No answer required
EXAMPLE: 16 bit message 16 bit Message - - > Padded with 432 additional bits to make it 448 bits 16 + 432 = 448 512 - 448 = 64 ** 64 bits SMALLER than 512 **
50
What is the MD4 message digest size ?
128bit
51
What size block does MD4 process ?
512 bit block
52
Is MD4 still in use ?
NO
53
What does MD5 stand for ?
Message Digest 5
54
What is the MD5 message digest size ?
128bit
55
What size block does MD5 process ?
512bit
56
What size does a message length need to be for MD5 ?
Message length needs to be 64 bits less than multiple of 512 ( If not then it will pad until it reaches that)
57
Why was extra security added to MD5 ?
to REDUCE the speed of MESSAGE DIGEST production.
58
Are MD2,MD4,MD5 recommended and in use ?
MD2, MD4, MD5 - NO LONGER ACCEPTED OR RECOMMENDED
59
HASH Algorithms and Message Digest sizes ?
Hashing Variable Length - HAVAL ( MD5 variant ) 128, 160, 192, 224, 256 Hashing Message Authentication Code ( HMAC ) Variable Message Digest 2 ( MD2 ) 128 Message Digest 4 ( MD4 ) 128 Message Digest 5 ( MD5 ) 128 Secure Hashing Algorithm (SHA/SHA-1) 160 SHA - 224 224 SHA - 256 256 SHA - 384 384 SHA - 512 512
60
What is used to implement digital signatures?
HASHING
61
TWO goals for DIGITAL SIGNATURES?
Non Repudiation ( Assure the receiver that the message truly came from claimed sender.) Integrity (Assure the receiver that the message WAS NOT altered while in transit between sender & receiver)
62
What does digital signatures require ?
1. PUBLIC KEY cryptosystem (Asymmetric) | 2. HASHING function.
63
EXAMPLE ; No answer required
Example: Alice wants to digitally sign a message sing a hashing algorithm 1. Alice generates a MESSAGE DIGEST of the message using a HASHING ALGORITHM ( SHA-1, SHA-256, SHA-512 etc) 2. Alice ENCRYPTS only the MESSAGE DIGEST using her PRIVATE KEY (This is the DIGITAL SIGNATURE). 3. Alice attaches the signed MESSAGE DIGEST to the PLAIN-TEXT message 4. Alice sends the appended message to Bob
64
EXAMPLE ; No answer required
Example: Bob receives the DIGITALLY SIGNED message and does the following: 1. Bob DECRYPTS the DIGITAL SIGNATURE, using Alice's PUBLIC KEY. 2. Bob uses the same HASH FUNCTION to create the MESSAGE DIGEST (MD) of the full PLAIN-TEXT message. 3. Bob compares the DECRYPTED MESSAGE DIGEST (MD) received from Alice with the MESSAGE DIGEST(MD) he computed himself. Outcomes: IF THEY MATCH = Assured the message was sent by Alice IF THEY DO NOT MATCH = Message not sent by Alice or modified in transit.

CISSP (1 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions