all InfoSec news
More Efficient $k$-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities
June 14, 2024, 4:19 a.m. | Lucas Gretta, William He, Angelos Pelecanos
cs.CR updates on arXiv.org arxiv.org
Abstract: We prove that the permutation computed by a reversible circuit with $\tilde{O}(nk\cdot \log(1/\varepsilon))$ random $3$-bit gates is $\varepsilon$-approximately $k$-wise independent. Our bound improves on currently known bounds in the regime when the approximation error $\varepsilon$ is not too small. We obtain our results by analyzing the log-Sobolev constants of appropriate Markov chains rather than their spectral gaps.
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Information Technology Specialist I: Windows Engineer
@ Los Angeles County Employees Retirement Association (LACERA) | Pasadena, California
Information Technology Specialist I, LACERA: Information Security Engineer
@ Los Angeles County Employees Retirement Association (LACERA) | Pasadena, CA
Solutions Expert
@ General Dynamics Information Technology | USA MD Home Office (MDHOME)
Physical Security Specialist
@ The Aerospace Corporation | Chantilly
System Administrator
@ General Dynamics Information Technology | USA VA Newington - Customer Proprietary (VAC395)
Microsoft Exchange & 365 Systems Engineer - TS/SCI with Polygraph
@ General Dynamics Information Technology | USA VA Chantilly - 14700 Lee Rd (VAS100)