Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.21602 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918437154979840 |
|---|---|
| author | Kazana, Tomasz |
| author_facet | Kazana, Tomasz |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_21602 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Condense to Conduct and Conduct to Condense Kazana, Tomasz Cryptography and Security Information Theory 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. |
| title | Condense to Conduct and Conduct to Condense |
| topic | Cryptography and Security Information Theory |
| url | https://arxiv.org/abs/2508.21602 |