Best Nonce In Security Protocol And Data Complexity Of Differential Cryptanalysis

Question

1. In a security protocol, which of the following tends to make the best nonce?

a.    A timestamp
b.    A sequence number
c.    A large random number
d.    All of the above about equally

2. The data complexity of differential cryptanalysis refers to:

a.    The difficulty of analyzing weakness in S-boxes
b.    The number of pairs required for predicting differences
c.    The advantage of differential cryptanalysis over brute force
d.    The difficulty of finding the key after a sufficient number of pairs have been gathered


Summary

These multiple choice questions belong to Computer Science. The 1st question is about the best nonce in security protocol. The 2nd question is about data complexity of differential cryptanalysis.

Total Word Count NA