Construction of Subliminal Channel Based on Factoring Difficulty
Dong Qing-kuan · Microcomputer Information · 2009
Based on the factoring difficulty and discrete logarithm problem, a way to construct subliminal channel in the Schnorr signature scheme is proposed. In this scheme, the security of the subliminal message covered by the Schnorr signature depends on the factoring difficulty, and the security of the signature against forgery depends on the security of Schnorr signature. At the same time, it is hard for the subliminal receiver to forge a valid signature of the signer.