Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
207 views

A candidate for one-way functions

For every $n \geq 3$ consider a bipartite random $3$-regular graph $G_n$ with two parts $X=\{x_1, \dotsc, x_n\}$ and $Y=\{y_1, \dotsc, y_n\}$. For any $i \leq n$ assign either 0 or 1 to each vertex $...
Arash Ahadi's user avatar