Function S-rough sets and security-authentication of hiding law

查看全文 作　　者：SHI KaiQuan1,2 & ZHAO JianLi3 1 School of Mathematics and Computer Sciences, Longyan University, Longyan 364000, China;2 School of Mathematics and System Sciences, Shandong University, Jinan 250100, China;3 School of Mathematics Science, Liaocheng University, Liaocheng 252059, China

出　　处：《Science in China(Series F)》索引2008年第51卷第7期,共12页

基　　金：the National Natural Science Foundation of China (Grant No.10771073);the Natural Science Foundation of Shandong Province (Grant No.Y2004A04) 摘　　要：Function S-rough sets are defined by R-function equivalence class, which have dynamic characteristic. Function S-rough sets have dynamic characteristic, law characteristic and law-hiding characteristic. Function S-rough sets can generate f-hiding law and - hiding law. By engrafting, crossing, and penetrating between the information security theory and function S-rough sets, the security hiding and the authentication of f- hiding law and - hiding law are given respectively in this paper. The fusion and share between function S-rough sets and information security theory is a new research direction of the application of information law in information system. 关键词：S鲁棒集隐藏定律椭圆形曲线安全性

相关文献

参考文献（13）
引证文献（73）
耦合文献（134）

参考文献(13)

引证文献(73)

耦合文献(134)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

Function S-rough sets and security-authentication of hiding law

参考文献(13)

引证文献(73)

耦合文献(134)

用户提示