# Tag Info

• 12k
Accepted

### Merkle–Damgård construction - the bigger input, the longer time to compute hash?

That's right, and you've just stated the obvious. The processing time of Merkle-Damgaard-based hash functions are proportional to the size of the input (unless the input is too small). That's also ...
• 7,103
Accepted

### Create a control hash string from different sources, is there a difference, advantage or disadvantage in comparison when using this ways?

Assuming that there is no difference in files and strings (we will use $s_1$ and $s_2$), we can look at the hasing speed and pre-images and collision attacks. We assume + as concatenation summation ...
• 44.2k
1 vote

### How easy is it to identifiy the key when knowing a certain number of different AES-256/Fixed Nonce encrypted long-integers

should be used like passwords(known only by few individuals) Yes, that would work. must always be the same for the same integer True for single block encrypt using AES and using the full output. ...
• 86.5k

Top 50 recent answers are included