Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion.

Subhash Khot Dor Minzer Muli Safra

Published in: FOCS (2018)

Keyphrases

pseudorandom
random number
secret key
uniformly distributed
graph structure
graph representation
graph theory
random numbers
random walk
encryption algorithm
stream cipher
graph embedding
spanning tree
graph model
graph matching
directed graph
graph theoretic
low cost
real time