2 papers
cs.CR2026
Non-Adaptive Cryptanalytic Time-Space Lower Bounds via a Shearer-like Inequality for Permutations
Itai Dinur, Nathan Keller, Avichai Marmor
The power of adaptivity in algorithms has been intensively studied in diverse areas of theoretical computer science. In this paper, we obtain a number of sharp lower bound results…
math.CO2025
The Forbidden Cross Intersection Problem for Permutations
Nathan Keller, Noam Lifshitz, Ohad Sheinfeld
We prove the following, for a universal constant . Let and . Let be families of permutations such that no $Ï\…