Answer:
c. your friend can hash all possible options and discover your secret.
Explanation:
SHA-256 is a set of hash functions that was designed by the NSA. SHA-2 is considered an upgrade on the set that was its predecessor, SHA-1. A hash is a mathematical function that condenses data in a process of one-way encryption. SHA-256 creates hash algoritms that are considered irreversible and unique. However, one of the properties of hashing algorithms is determinism, which means that any computer in the world would be able to compute a particular hash and get the same answer.
Answer:
True is the correct answer for the above question.
Explanation:
- When any document file is opened then every point has some particular address. so there is a pointer which states that where the read operation and the write operation is going on.
- When any person writes any program to read a file or write a file then there is a need for some variable that is pointed for the reading and the write operation.
- The document which is used for the write data or read data is also designed and maintained by some software.
- Hence we can say that there are needs of some variable that point the operation of the file and it is also stated from the above question. Hence the above question statement is a true statement.
Answer:
D. 256
Explanation:
Given

Required
Determine the maximum number of output
To get the required value, we make use of the following:

Where n is the bits of the opcode.
i.e.

Substitute 8 for n in 


<em>Hence, option D answers the question</em>
Answer:
b. Acceptance
Explanation:
<em>"Acceptance </em><em>of risk is the choice to do nothing to protect an information asset and to accept the outcome of its potential exploitation. </em><em>"</em>
<em>Acceptance Control </em>is important as a strategy when an organization has accomplished a determined level of risk, or it has estimated potential damages that might happen due to attacks, or the organization has developed a thorough analysis related to cost benefits, or it has also evaluated the probabilities of attacks.
Answer and Explanation:
Given that total number of records in a file = 100000
Each record consists of= 240 bytes
Given that B= 2400 bytes.
Then total blocks in file = 100000 records * 240 / 2400
= 10000 blocks.
Time that will take for exhaustive read
= s + r + b.btt
= 16 + 8.3 + (10000) * 0.8
= 8024.3 msec
Now as per given X be the number of records that are searched randomly and it takes more than exhaustive read time.
Hence, X (s + r + btt) > 8024.3
X (16+8.3+0.8) > 8024.3
X > 8024.3/25.1
So that, X > 319.69
Hence, atleast 320 random reads should be made to search the file