Permuted Puzzles and Cryptographic Hardness.

A permuted puzzle problem is defined by a pair of distributions \\(\\mathcal{D}_0,\\mathcal{D}_1\\) over \\(\\varSigma ^n\\). The problem is to distinguish samples from \\(\\mathcal{D}_0,\\mathcal{D}_1\\), where the symbols of each sample are permuted by a single secret permutation \\(\\pi \\) of [n].