# Tag Info

4

Would it be easier to find collisions, preimages, etc? First note that if you can find preimages for a compressing function (like a hash) you can also find collisions. This means if we can't find collisions, then we also can't find preimages and thelike. Now, the scenario you are describing is called a "freestart collision attack". Freestart collisions are ...

3

How is asymmetric cryptography safe under these conditions? Well, you sort of outlined (but see kelalaka's corrections) how you would use asymmetric crypto to do authentication; that is, to make sure that the message was actually sent from $A$. You ask "how does that provide privacy?". The answer, of course, is "if that's all you do, it doesn't". If we ...

3

In modern cryptography it is generally assumed that algorithms are public and only the key is kept private. Thus, the adversary can compute $\operatorname{Mac}(k', m)$ for any key $k'$ and message $m$. The oracle $\operatorname{Mac}_k(\cdot)$ in the experiment allows $A$ to additionally receive valid macs under the challenge-key $k$ for which it is supposed ...

2

If someone has a large set of values: $$B + \epsilon_0, B+\epsilon_1, B+\epsilon_2, …, B+\epsilon_n$$ One can average all these values together. If the values of $\epsilon_0, \epsilon_1, \epsilon_2, …, \epsilon_n$ are independently distributed with a mean of 0, the average of these values will be closer to $B$ (essentially reducing the size of the error ...

1

Firstly, you misunderstood what is a signature and encryption with the public key. A signature requires a hash then sign paradigm with the senders private key so that any receiver can verify the signature. The RSA paper gave the first idea to digital signatures that were insecure and the Rabin Signature released in 1979 is the fist secure signature that ...

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