When Simple Permutations Mix Poorly - Limited Independence does not Imply Pseudorandomness.

Angelos Pelecanos https://orcid.org/0009-0005-6329-1786 Jesko Dujmovic Angelos Pelecanos Stefano Tessaro When Simple Permutations Mix Poorly - Limited Independence does not Imply Pseudorandomness. EUROCRYPT 2026 424-450 conf/eurocrypt/2026-6 https://doi.org/10.1007/978-3-032-25333-0_15 db/conf/eurocrypt/eurocrypt2026-6.html#DujmovicPT26 streams/conf/eurocrypt Angelos Pelecanos Xinyu Tan Ewin Tang John Wright 0004 Beating full state tomography for unentangled spectrum estimation. 3313-3363 2026 SODA https://doi.org/10.1137/1.9781611978971.120 conf/soda/2026 db/conf/soda/soda2026.html#PelecanosTT026 Angelos Pelecanos Jack Spilecki John Wright 0004 The Debiased Keyl's Algorithm: A New Unbiased Estimator for Full State Tomography. 1266-1277 2026 STOC https://doi.org/10.1145/3798129.3800837 conf/stoc/2026 db/conf/stoc/stoc2026.html#PelecanosSW26

Angelos Pelecanos Jack Spilecki Ewin Tang John Wright 0004 The Keyl-Werner algorithm is not optimal for spectrum estimation. 2026 July abs/2607.27117 CoRR https://doi.org/10.48550/arXiv.2607.27117 db/journals/corr/corr2607.html#abs-2607-27117 streams/journals/corr

Sitan Chen Ryan O'Donnell Angelos Pelecanos John Wright 0004 Online Shadow Tomography Matching the Classical Bounds. 2026 July abs/2607.29686 CoRR https://doi.org/10.48550/arXiv.2607.29686 db/journals/corr/corr2607.html#abs-2607-29686 streams/journals/corr

Bruno Cavalar Eli Goldin Matthew Gray Peter Hall Yanyi Liu Angelos Pelecanos On the Computational Hardness of Quantum One-Wayness. 1679 2025 9 Quantum https://doi.org/10.22331/q-2025-03-27-1679 db/journals/quantum/quantum9.html#CavalarGGHLP25

Lucas Gretta William He Angelos Pelecanos More Efficient Approximate <i>k</i>-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities. 5582-5598 2025 SODA https://doi.org/10.1137/1.9781611978322.191 conf/soda/2025 db/conf/soda/soda2025.html#GrettaHP25

Angelos Pelecanos Xinyu Tan Ewin Tang John Wright 0004 Beating full state tomography for unentangled spectrum estimation. 2025 April abs/2504.02785 CoRR https://doi.org/10.48550/arXiv.2504.02785 db/journals/corr/corr2504.html#abs-2504-02785 streams/journals/corr

Jesko Dujmovic Angelos Pelecanos Stefano Tessaro When Simple Permutations Mix Poorly: Limited Independence Does Not Imply Pseudorandomness. 2282 2025 2025 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2025/2282 db/journals/iacr/iacr2025.html#DujmovicPT25 streams/journals/iacr

Xingjian Li 0006 Qipeng Liu 0001 Angelos Pelecanos Takashi Yamakawa Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle. 72:1-72:19 2024 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2024.72 conf/innovations/2024 db/conf/innovations/innovations2024.html#00060PY24

Lucas Gretta William He Angelos Pelecanos More Efficient <i>k</i>-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities. 2024 abs/2406.08499 CoRR https://doi.org/10.48550/arXiv.2406.08499 db/journals/corr/corr2406.html#abs-2406-08499

Tianren Liu Angelos Pelecanos Stefano Tessaro Vinod Vaikuntanathan Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers. 83 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/083 db/journals/iacr/iacr2024.html#LiuPTV24

Lucas Gretta William He Angelos Pelecanos More Efficient Approximate k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities. 847 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/847 db/journals/iacr/iacr2024.html#GrettaHP24

Tianren Liu Angelos Pelecanos Stefano Tessaro Vinod Vaikuntanathan How Fast Does the Inverse Walk Approximate a Random Permutation? 1795 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/1795 db/journals/iacr/iacr2024.html#LiuPTV24a streams/journals/iacr

Tianren Liu Angelos Pelecanos Stefano Tessaro Vinod Vaikuntanathan Layout Graphs, Random Walks and the t-Wise Independence of SPN Block Ciphers. 694-726 2023 CRYPTO (3) https://doi.org/10.1007/978-3-031-38548-3_23 conf/crypto/2023-3 db/conf/crypto/crypto2023-3.html#LiuPTV23

Xingjian Li 0006 Qipeng Liu 0001 Angelos Pelecanos Takashi Yamakawa Classical vs Quantum Advice under Classically-Accessible Oracle. 2023 abs/2303.04298 CoRR https://doi.org/10.48550/arXiv.2303.04298 db/journals/corr/corr2303.html#abs-2303-04298

Bruno Cavalar Eli Goldin Matthew Gray Peter Hall Yanyi Liu Angelos Pelecanos On the Computational Hardness of Quantum One-Wayness. 2023 abs/2312.08363 CoRR https://doi.org/10.48550/arXiv.2312.08363 db/journals/corr/corr2312.html#abs-2312-08363

Bruno Pasqualotto CavalarBruno Cavalar Sitan Chen Jesko Dujmovic Eli Goldin Matthew Gray Lucas Gretta Peter Hall William He Xingjian Li 0006 Qipeng Liu 0001 Tianren Liu Yanyi Liu Ryan O'Donnell Jack Spilecki Xinyu Tan Ewin Tang Stefano Tessaro Vinod Vaikuntanathan John Wright 0004 Takashi Yamakawa