Cryptography and Network Security Principles
Study online at https://quizlet.com/_4kpqz3
1. 1. Is the most common method used to conceal small Asymmetric enblocks of data, such as encryption keys and hash
cryption
function values, which are used in digital signatures
2. 2. A common technique for masking contents of mes- encryption
sages or other information traffic so that opponents
cannot extract the information from the message is.
3. 3. Involves the passive capture of a data unit and its Replay
subsequent retransmission to produce an unauthorized effect.
4. 4. Refers to the use of multiple, overlapping protection Layering
approaches addressing the people, technology, and
operational aspects of information systems.
5. 5. A loss of __________ is the unauthorized disclosure Confidentiality
of information
6. 6. Verifying that users are who they say they are and Authenticity
that each input arriving at the system came from a
trusted source is
7. 7. A _________ level breach of security could cause Moderate
a significant degradation in mission capability to an
extent and duration that the organization is able to
perform its primary functions, but the effectiveness of
the functions is significantly reduced.
8. 8. A __________ is any action that compromises the Security Attack
security of information owned by an organization
9. 9. A __________ takes place when one entity pretends masquerade
to be a different entity.
10. A(n) __________ service is one that protects a system Availability
to ensure its availability and addresses the security
concerns raised by denial- of- service attacks.
11.
Substitution
1/8
Cryptography and Network Security Principles
Study online at https://quizlet.com/_4kpqz3
1. Techniques map plaintext elements (characters,
bits) into ciphertext elements.
12. 2. Joseph Mauborgne proposed an improvement to One Time Pad
the Vernam cipher that uses a random key that is as
long as the message so that the key does not need to
be repeated. The key is used to encrypt and decrypt
a single message and then is discarded. Each new
message requires a new key of the same length as the
new message. This scheme is known as a(n)
13. 3. An original intelligible message fed into the algo- plaintext, cipherrithm as input is known as _________ , while the coded text
message produced as output is called the
14. 4. Restoring the plaintext from the ciphertext is
Deciphering
15. 5. A __________ attack involves trying every possible Brute force
key until an intelligible translation of the ciphertext is
obtained
16. 6. Techniques used for deciphering a message with- Cryptanalyses
out any knowledge of the enciphering details is.
17. 7. The ___________ takes the ciphertext and the se- Decryption Algocret key and produces the original plaintext. It is es- rithm
sentially the encryption algorithm run in reverse
18. 8. If both sender and receiver use the same key, the
system is referred to as
conventional encryption
19. 9. attacks exploit the characteristics of the algorithm Cryptanalytic
to attempt to deduce a specific plaintext or to deduce
the key being used
20. 10. The __________ was used as the standard field
Playfair Cipher
system by the British Army in World War I and was
used by the U.S. Army and other Allied forces during
World War II.
2/8
Cryptography and Network Security Principles
Study online at https://quizlet.com/_4kpqz3
21. 1. DES exhibits the classic __block cipher structure, Feistel
which consists of a number of identical rounds of
processing.
22. 2. A sequence of plaintext elements is replaced by a permutation
__________ of that sequence which means that no elements are added, deleted or replaced in the sequence,
but rather the order in which the elements appear in
the sequence is changed
23. 3. A ____cipher is one that encrypts a digital data
stream one bit or one byte at a time?
Stream
24. 4. The vast majority of network-based symmetric cryp- Block
tographic applications make use of ____ ciphers.
25. 5. A _______cipher is one in which a block of plaintext Block
is treated as a whole and used to produce a ciphertext
block of equal length
26. 6. is when each plaintext element or group of elements Substitution
is uniquely replaced by a corresponding ciphertext
element or group of elements.
27. 7. Key sizes of __________ or less are now considered 32 bits
to be inadequate
28. 8. Feistel proposed that we can approximate the ideal Product
block cipher by utilizing the concept of a ___ cipher,
which is the execution of two or more simple ciphers
in sequence in such a way that the final result or
product is cryptographically stronger than any of the
component ciphers
29. 9. The criteria used in the design of the ----- focused DES
on the design of the S-boxes and on the P function
that takes the output of the S-boxes.
30. 10. The greater the number of rounds, the ___ it is to Harder
perform cryptanalysis.
3/8
Cryptography and Network Security Principles
Study online at https://quizlet.com/_4kpqz3
31. 1. The __________ is when a small change in plaintext Avalanche Effect
or key produces a large change
in the ciphertext
32. 2. In Advanced Encryption Standard all operations are 8 bits
performed on __________
bytes.
33. Division requires that each nonzero element have a(n) Multiplicative
__________ inverse.
34. 4. The Advanced Encryption Standard was published NIST
by the __________ in 2001
35. A __________ is a set in which you can do addition,
subtraction, multiplication and
division without leaving the set
Field
36. 6. The AES cipher begins and ends with a(n)
AddRoundKedy
_________ stage because any other stage,
applied at the beginning or end, is reversible without
knowledge of the key and
would add no security.
37. 8. The final round of both encryption and decryption three
of the AES structure consists of ____stages?
38. 9. The first row of State is not altered; for the second ShiftRows
row a 1-byte circular left shift is performed; for the
third row a 2-byte circular left shift is performed; and
for the fourth row a 3-byte circular left shift is performed. This transformation is called _____
39. 10. In the AddRoundKey transformation the 128 bits of 128 bits
State are bitwise XORed with the ___ of the round key.
40. 1. The simplest form of multiple encryption has
__________ encryption stages and _____keys.
4/8
2, 2
Cryptography and Network Security Principles
Study online at https://quizlet.com/_4kpqz3
41. 2. _________ mode is similar to Cipher Feedback, ex- Output Feedback
cept that the input to the encryption algorithm is the
preceding DES output
42. 3. The __________ method is ideal for a short amount Electronic codeof data and is the appropriate mode to use if you want book mode
to transmit a DES or AES key securely.
43. 4. The output of the encryption function is fed back to Cipher Feedback
the shift register in Output Feedback mode, whereas Mode
in __the ciphertext unit is fed back to the shift register.
44. 5. The __________ algorithm will work against any
Meet- In- The Midblock encryption cipher and does not depend on any dle Attack
particular property of DES.
45. 6. ___ modes of operation have been standardized by 5
NIST for use with
symmetric block ciphers such as DES and AES.
46. 7. The ___ and __block cipher modes of operation are CBC, CFB
used for authentication.
47. 8. In the first instance of multiple encryption plaintext Ciphertext
is converted to __________
using the encryption algorithm.
48. 9. Triple DES makes use of __________ stages of the 3
DES algorithm, using a total of two or three distinct
keys
49. 10. Another important mode, XTS-AES, has been stan- IEEE
dardized by the __________ Security in Storage Working Group.
50. 1. A secret key for symmetric encryption that is gen- session key
erated for use for a short
period of time is called a ________
51.
Seed
5/8
Cryptography and Network Security Principles
Study online at https://quizlet.com/_4kpqz3
2. A pseudorandom number generator takes as input
a fixed value called the
__________ and produces a sequence of output bits
using a deterministic algorithm.
52. 3. The __________ test is the most basic test of ran- Frequency
domness and must be included in any test suite.
53. 4. A source that is effectively random is referred to as Entropy Source
__________ .
54. 5. Two approaches that use a block cipher to build a CTR mode and
PNRG and have gained widespread acceptance are OFB mod
55. 6. A __________ is used to produce a pseudorandom PRF
string of bits of some fixed length.
56. 7. The best that can be done to determine if a PRNG Consistency
generates numbers that have the characteristic of randomness is on the basis of multiple tests. These tests
should seek to establish uniformity, scalability, and
__________ .
57. 8. The Blum, Blum, Shub generator is referred to as a CSPRBG
____________ .
58. 9. A __________ takes as input a source that is effec- TRNG
tively random
59. 10. A __________ uses a nondeterministic source to TRNG
produce randomness.
60. 1. Asymmetric encryption is also known as
___________ .
Public key encryption
61. 2. are two related keys, a public key and a private key Asymmetric Keys
that are used to perform complementary operations,
such as encryption and decryption or signature generation and signature verification.
6/8
Cryptography and Network Security Principles
Study online at https://quizlet.com/_4kpqz3
62. 3. Plaintext is recovered from the ciphertext using the decryption algopaired key and _______
rithm
63. 4. Public-key algorithms are based on __________ .
Mathematical
Functions
64. 5. The most widely used public-key cryptosystem is RSA
__________
65. 6. The __________ indicates that the subscriber iden- Public Key Certifitified in the certificate has sole control and access to cate
the private key.
66. 7. Asymmetric encryption can be used for __________ both confidentiality
.
and authentication
67. 8. Public-key encryption is also known as
___________ .
Asymmetric encryption
68. 9. A public-key encryption scheme has __________
ingredients
Six
69. A__________ is a cryptographic algorithm that uses Public Key (Asymtwo related keys, a public key and a private key. The metric) Cryptotwo keys have the property that deriving the private graphic Algorithm
key from the public key is computationally infeasible.
70. 1. For a ___________ defined over GF(2m), the vari- binary curve
ables and coefficients all take on values in GF(2m) and
in calculations are performed over GF(2m).
71. 2. The __________ cryptosystem is used in some form ElGamal
in a number of standards including DSS and S/MIME.
72. 3. _________ are best for software applications
Prime curves
73. 4. A(n) __________ is defined by an equation in two
variables with coefficients
elliptic curve
74.
man-in-the-middle
7/8
Cryptography and Network Security Principles
Study online at https://quizlet.com/_4kpqz3
5. The key exchange protocol is vulnerable to an
__________ attack because it does not authenticate
the participants.
75. 6. __ makes use of elliptic curves in which the vari- Elliptic curve crypables and coefficients are all restricted to elements of tography(ECC)
a finite field.
76. 7. For cryptography the variables and coefficients are Finite
restricted to elements in a __________ field
77. 8. An encryption/decryption system requires a point Eq(a,b)
G and an elliptic group _________ as parameters.
78. 9. The ____________ protocol enables two users to es- Diffie-Hellman
tablish a secret key using a public-key scheme based
on discrete logarithms.
79. 10. ---------- can be used to develop a variety of elliptic Elliptic curve arithcurve cryptography schemes.
metic
8/8