Pseudorandom Codes
Error-correcting codes whose codewords are computationally indistinguishable from random strings, and the assumptions that give them.
| Status | Statement | Tags |
|---|---|---|
|
Permuted Codes Conjecture A new hardness assumption, printed as Conjecture 3.1 of the source and stated in its most general form deliberately, as a target for cryptanalysis rather than as the minimum its applications need. Implied by the older permuted puzzles conjecture; statistically true for O(log n) samples over constant-size alphabets; false if any one of its three randomizations is dropped. 4 open |
Code Based CryptographyDual DistancePseudorandom CodesWatermarkingassumptionbarrier (ai) |
No matching items