I've seen that there is several kind of PRFs. Sometimes people speak about strong PRFs. When proofs of a protocol or algorithm are given based on the assumption of the use of a PRF, they speak ...
Are the proofs based on a PRF assumption still valid when using a variable-length input PRF ? The answer is maybe obvious but I have a doubt.
I would like to insert a key deriving function into EAX mode, in order to hamper brute-force attacks for a key-size restricted cipher (56 bits). The modification inserts an identical multi-block ...
Are there hash functions that make use of pseudorandom functions. Precisely, I'm looking for a specification of a hash function based on PRF (and based on the security of such a primitive).