NORMAL COVER
Expected encoder behavior
—
EXHIBIT 11
CONCEPTS FROM GENERAL STEGANOGRAPHY THEORY
If ordinary encoders choose among representations unevenly, mapping secret bits directly to choices can flatten that pattern. A better selection process tries to preserve the frequencies expected from innocent data.
SYNTHETIC CATEGORICAL MODEL / NO CLAIM OF PERFECT SECURITY
STATISTICAL LAB
Eight abstract choices stand in for masks, segment plans, or another legal encoder decision. The model does not produce operational steganography.
NORMAL COVER
—
NAIVE SECRET ENCODING
—
DISTRIBUTION-SHAPED SELECTION
—
WHAT THE OBSERVER EXPECTS
WHAT NAIVE HIDING CHANGES
WHAT SHAPING PRESERVES
WHAT AN ANALYST CAN TEST
THE FOUR QUESTIONS
WHAT THE SCANNER SEES
WHAT CHANGED UNDERNEATH
WHAT A SECOND READER CAN RECOVER
HOW AN ANALYST CAN NOTICE
MODEL LIMIT
The shaped samples are drawn from the same eight-choice probability model, so this particular chi-square test often cannot separate them from normal samples. A real system has dependencies, side channels, imperfect models, and more capable analysts.
Conceptual basis: model-based and distribution-preserving ideas associated in this repository with Sallee, grey-box steganography, Meteor, Discop, minimum-entropy coupling, and set shaping. These references remain [2ND] unless upgraded in the research record. No named algorithm is reproduced here.
Read the research note