FINDING · EVALUATION

Discop with Huffman-tree recursion achieves entropy utilization of 0.92–0.94 (bits embedded ÷ entropy available) and an embedding capacity of 3.48–5.29 bits/token across nucleus-sampling parameters p=0.80–0.98 with GPT-2, matching or exceeding ADG (0.78–0.84 utilization, 3.07–4.89 bits/token) while maintaining exactly zero KL divergence. Per-bit embedding time is 2.17E-03 to 5.52E-03 seconds, comparable to ADG.

From 2023-ding-discopDiscop: Provably secure steganography in practice based on ``distribution copies'' · §V, Table II · 2023 · Symposium on Security \& Privacy

Implications

Tags

censors
generic
defenses
steganography

Extracted by claude-sonnet-4-6 — review before relying.