Hot answers tagged

3

But for the second, I don´t know how to start. I won't give you the answer (this is homework; you won't learn as much if I just give you the answer); I will give you hints. It’s not given how the MAC is calculated. No, but for this question, we assume that the attacker knows what the MAC is; he just doesn't know the key. We also assume that he knows ...


2

Asymmetric signatures are one of the slowest operations (on relatively small sizes of data) around. RSA signature generation is particularly slow, as it requires modular exponentiation over the private exponent. It's possible to use Chinese Remainder Theorem and/or multi-prime RSA, but that won't get you close to hashing speeds. That I specify the algorithm ...



Only top voted, non community-wiki answers of a minimum length are eligible