Cryptographic Hardware and Embedded Systems -- CHES 2015 by Tim Güneysu & Helena Handschuh

Author:Tim Güneysu & Helena Handschuh
Language: eng
Format: epub
Publisher: Springer Berlin Heidelberg, Berlin, Heidelberg

Thus, by using the entropy of and , we get the bound.

Case 3: Except the case , this case is same as before as all variable keys z are distinct and are not leaked through the ciphertext . When we have three variable keys and which are masked to define the tags. So the forging probability is equivalently written as

The independence of the z values implies,

Now the effect of the state keys is not present in but they influence . By using -balancedness of the pseudo-dot-product hash, we conclude that and so .

Case 4: In this case, the variable keys are different for both computations. Since one set of variable keys are leaked through the ciphertext and the other has full entropy we use the fact that EHC is -balanced. Using this one can show that .

Case 5: Again, all four variable keys are distinct and one of them is leaked. So we can apply the argument (using balancedness of one 64-bit equation) to show that .

Case 6: Again, by simplifying the forging event with the notation described in case 3 we have

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.