内逆P-信息迭代智能伪装与还原  

Iterative Intelligent Camouflage and Reduction of Internal Inverse P-information

作　　者：黄伟婷[1] 魏葆雅[1] 

机构地区：[1]闽南师范大学计算机学院,福建漳州363000

出　　处：《淮海工学院学报（自然科学版）》2016年第3期26-29,共4页Journal of Huaihai Institute of Technology:Natural Sciences Edition

基　　金：福建省教育厅项目(JAT160287;JA13197);漳州市自然科学基金项目(ZZ2016J35)

摘　　要：逆P-集合是改进P-集合得到的一个新的数学结构,由内逆P-集合和外逆P-集合构成,具有动态特性.利用内逆P-集合和逆P-推理,给出内逆P-信息迭代智能伪装的概念,内逆P-信息迭代智能伪装生成,得到内逆P-信息迭代智能伪装的还原—辨识.同时,利用这些结果,给出内逆P-信息迭代智能伪装与还原在信息安全传递中的应用.Inverse packet sets are a new mathematical structure, which are improved from packet sets. Inverse P-sets are composed of internal inverse P-sets and outer inverse P-sets, which have dynamic characteristics. By using internal inverse P-sets and inverse P-reasoning, the concept of iterative intelligent camouflage of internal inverse P-information and the generation of iterative in- telligent camouflage of internal inverse P-information, as well as reduction and identification of it- erative intelligent camouflage of internal inverse P-information are proposed. Using these results, the application of iterative intelligent camouflage and reduction of internal inverse P-information is given in the security of information transmission.

关 键 词：内逆P-集合 逆P-推理 智能伪装 迭代 还原—辨识 

分 类 号：O144[理学—数学]