Abstract: Internal P-set, a new mathematic method of studying dynamic information, is a part of P-set theory. Based on the internal P-set theory, such conceptions have been put forward as principles of [F]-information camouflage granulation degree, [F]-information camouflage relationship, [F]-information camouflage generation, light camouflage and camouflaged information recovery and definitions of internal-distance definition and camouflage granulation degree. On the base of mathematic theory, a new camouflage algorithm is given in the paper, which is better than the same kind of algorithm. Their applications have been illustrated through the simple examples in application.

Key words: internal P-set, [F]-information?camouflage, internal-distance, information recovery

摘要： 内P-集合是P-集合理论的部分，它是一种研究动态信息的新的数学方法。在内P-集合理论基础上，提出[F]-信息伪装粒度定理、[n]阶[F]-伪装信息关系定理、[F]-伪装信息生成定理、信息轻伪装定理、伪装信息恢复定理、内-距离定义、伪装粒度定义等基本概念，在此数学理论基础上构建的新的伪装算法，相比同类算法在时效和空间方面更显优势。通过简单的应用实例，进一步直观地诠释提出理论的应用方法。

关键词: 内P-集合, [F]-信息伪装, 内-距离, 信息恢复