Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with mac
Search options not deleted
user 84391
(or message authentication code), a short piece of information used to authenticate a message, and the algorithm to create and check such information, using a secret key.
1
vote
0
answers
337
views
CBC-MAC variable-length weakness with MAC size greater than the encryption block size
The title mostly explains it;
CBC-MAC variable-length weakness with MAC size greater than the encryption block size
I've seen that by having the pairs $(M,T_m)$ and $(N,T_n)$, we can generate a third … message $M'$ whose CBC-MAC will also be $T_n$ by simply doing $M'=M \mathbin\| ((n_1 \oplus T_m) \mathbin\| n_2 \ldots n_x)$
My question is how does this work when the MAC is of greater size than the …
- 11