Condense to Conduct and Conduct to Condense

Computer Science > Cryptography and Security [Submitted on 29 Aug 2025 (v1), last revised 10 Apr 2026 (this version, v3)] Condense to Conduct and Conduct to Condense Tomasz Kazana In this paper, we present the first explicit examples of low-conductance permutations. The notion of conductance of permutations was introduced by Dodis et al. in "Indifferentiability of Confusion-Diffusion Networks", where the search for low-conductance permutations was first initiated and motivated. As part of our contribution, we not only provide these examples, but also offer a general characterization of the problem: we show that low-conductance permutations are equivalent to permutations possessing the information-theoretic properties of Multi-Source-Somewhere-Condensers, a specific variant of somewhere condensers. Subjects: Cryptography and Security (cs.CR); Information Theory (cs.IT) Cite as: arXiv:2508.21602 [cs.CR]   (or arXiv:2508.21602v3 [cs.CR] for this version)   https://doi.org/10.48550/arXiv.2508.21602 Focus to learn more Submission history From: Tomasz Kazana [view email] [v1] Fri, 29 Aug 2025 13:01:02 UTC (14 KB) [v2] Wed, 8 Oct 2025 19:47:18 UTC (16 KB) [v3] Fri, 10 Apr 2026 07:18:30 UTC (222 KB) Access Paper: HTML (experimental) view license Current browse context: cs.CR < prev   |   next > new | recent | 2025-08 Change to browse by: cs cs.IT math math.IT References & Citations NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)