Common Contracts
2 similar null contracts
PDF hosted at the Radboud Repository of the Radboud University NijmegenJuly 4th, 2017
Note that ′ is key-dependent and the distinguisher from Assumption 1 does not know ′. This is not a problem, though, as in (12) we are maximizing over all distinguishers: the maximum over all distinguishers equals the maximum over all distinguishers that only take tweaks from T ′, maximized over all possible sets T ′.
PDF hosted at the Radboud Repository of the Radboud University NijmegenJuly 4th, 2017
Note that ′ is key-dependent and the distinguisher from Assumption 1 does not know ′. This is not a problem, though, as in (12) we are maximizing over all distinguishers: the maximum over all distinguishers equals the maximum over all distinguishers that only take tweaks from T ′, maximized over all possible sets T ′.
