Abstract. We prove a general domain extension theorem for pseudo-random functions (PRFs). Given a PRF F from n bits to n bits, it is well known that employing F ...
We prove a general domain extension theorem for pseudo- random functions (PRFs). Given a PRF F from n bits to n bits, it is well known that employing F in a ...
Mar 25, 2005 · Abstract. We prove a general domain extension theorem for pseudo-random functions (PRFs). Given a PRF F from n bits to n bits, it is well known ...
It is shown that the underlying graph can be an arbitrary directed acyclic graph (DAG), and the resulting function on the larger domain is still a PRF, ...
We prove a general domain extension theorem for pseudo-random functions (PRFs). Given a PRF F from n bits to n bits, it is well known that employing F in a ...
We prove a general domain extension theorem for pseudo-random functions (PRFs). Given a PRF F from n bits to n bits, it is well known that employing F in a ...
Bibliographic details on PRF Domain Extension Using DAGs.
First page of “PRF Domain Extension Using DAGs” PDF Icon. download. Download Free PDF. Download Free PDF. PRF Domain Extension Using DAGs. Profile image of ...
In this paper we are mainly interested in the following domain extensions: C = {CBC-MAC [5], OMAC [9], GCBC * [18] 1 , PMAC [6]} and (directed acyclic graph) ...
Today we introduce another basic primitive in cryptography – hash functions. Roughly they are functions that map long inputs to short digests.
Missing: DAGs. | Show results with:DAGs.