arXiv (All)
open access
Indistinguishability of Sum of Permutations: A Fourier Analytic Route to Classical and Quantum Security
We study classical and quantum indistinguishability of sums of independent random permutations and related transformations from permutations to functions. Let $G$ be a finite abelian group of order $N$, and let $π^k_+(x)=π_1(x)+\cdots+π_k(x)$ for $k\geq2$ independent uniform random permutations of $
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Indistinguishability of Sum of Permutations: A Fourier Analytic Route to Classical and Quantum Security#1108606
- On dissociated infinite permutation groups#173275
- Some new classes of permutation polynomials and their compositional inverses#684174
- Some new classes of permutation polynomials and their compositional inverses#682399
- Permutation polynomials over finite fields from low-degree rational functions#819221
Record · ID 1130009
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive