Paper TR22-086 | Extremely Efficient Constructions of Hash Functions, with...
In a recent work, Fan, Li, and Yang (STOC 2022) constructed a family of almost-universal hash functions such that each function in the family is computable by $(2n + o(n))$-gate circuits of fan-in $2$...
View ArticleRevision 1 | Extremely Efficient Constructions of Hash Functions, with...
In a recent work, Fan, Li, and Yang (STOC 2022) constructed a family of almost-universal hash functions such that each function in the family is computable by $(2n + o(n))$-gate circuits of fan-in $2$...
View Article
More Pages to Explore .....
