Cryptography Reference
In-Depth Information
RESEARCH PROBLEMS
Problem 6.1 Does there exist any other distinguisher of complexity O(N)
involving the initial keystream bytes than the event (z 2 = 0)?
Problem 6.2 Investigate the existence of a long-term keystream bias of order
1
1
N .
Problem 6.3 Can the existing biases be combined to create a bias greater
than the maximum of the biases?
N , where the random association is also of order
Search WWH ::




Custom Search