FINDING · DEFENSE

The vanilla range-coding baseline suffers from two provable security failures that RRC corrects: (1) distortion of the token probability distribution because interval boundaries do not align with token probabilities, and (2) randomness reuse across sampling steps, which exposes detectable statistical bias. The rotation mechanism specifically addresses both by introducing fresh PRNG-seeded randomness o~U(0,1) at each step and applying a modulo rotation to the decimal state.

From 2026-yan-efficient-provably-secureEfficient Provably Secure Linguistic Steganography via Range Coding · §3.2, §4 · 2026 · arXiv preprint

Implications

Tags

techniques
ml-classifier
defenses
steganography

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