Contains fulltext : 207814.pdf (preprint version ) (Open Access) Contains fulltext : 207814.pdf (Publisher’s version ) (Open Access)Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 201
Pseudorandomness is the subfield of theoretical computer science which studies explicit construction...
Abstract. We present a pseudo-random bit generator expanding a uniformly random bit-string r of leng...
In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudorandom function f...
• PRG: short random seed s 7 → G(s) long “random looking ” output. • PRF: short random key K 7 → FK(...
are one of the fundamental primitives for cryptographic protocol design. Most importantly, they prov...
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from a pseudo-ran...
International audienceXoring the output of k permutations, k ≥ 2 is a very simple way to construct p...
The ability to produce random numbers is an important aspect of many cryptographic applications. Thi...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from a pseudo-ran...
Abstract. We describe efficient constructions for various cryptographic primitives in private-key as...
Pseudorandom functions (PRFs) are the building blocks of symmetric-key cryptography. Almost all cent...
Abstract. In the last years, much research work has been invested into the security analysis of key ...
AbstractA pseudo-random function is a fundamental cryptographic primitive that is essential for encr...
Pseudorandom Functions (PRFs), introduced by Goldreich, Goldwasser and Micali [9], allow one to e#c...
Pseudorandomness is the subfield of theoretical computer science which studies explicit construction...
Abstract. We present a pseudo-random bit generator expanding a uniformly random bit-string r of leng...
In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudorandom function f...
• PRG: short random seed s 7 → G(s) long “random looking ” output. • PRF: short random key K 7 → FK(...
are one of the fundamental primitives for cryptographic protocol design. Most importantly, they prov...
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from a pseudo-ran...
International audienceXoring the output of k permutations, k ≥ 2 is a very simple way to construct p...
The ability to produce random numbers is an important aspect of many cryptographic applications. Thi...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from a pseudo-ran...
Abstract. We describe efficient constructions for various cryptographic primitives in private-key as...
Pseudorandom functions (PRFs) are the building blocks of symmetric-key cryptography. Almost all cent...
Abstract. In the last years, much research work has been invested into the security analysis of key ...
AbstractA pseudo-random function is a fundamental cryptographic primitive that is essential for encr...
Pseudorandom Functions (PRFs), introduced by Goldreich, Goldwasser and Micali [9], allow one to e#c...
Pseudorandomness is the subfield of theoretical computer science which studies explicit construction...
Abstract. We present a pseudo-random bit generator expanding a uniformly random bit-string r of leng...
In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudorandom function f...
DOI
Add to ORKG