The construction and destruction of subliminal channel are important problems in the information hiding. The subliminal channel can send secret information without notice. Two subliminal-free methods named weak (strong) subliminal-free on public-key cryptosystem (PKC) are proposed in this paper using the combinatorial method. The first method can only free the subliminal information with any minor probability and the second can free all. Moreover, the “traitor problem” which is same as the model of the subliminal channel in PKC is given. Two subliminal channels are embedded inN-th degree truncated polynomial ring (NTRU) cryptosystem, and their subliminal-free methods are also be obtained by the action of surveillant.