检索结果-内蒙古大学图书馆

A Note on Determine the Greatest Common Subfamily of Two NFSRs by Grbner Basis

Journal of Systems Science & Complexity 2015年第5期28卷 1231-1242页

作者： WANG Zhongxiao QI Wenfeng TIAN Tian Luoyang University of Foreign Language State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute

For nonlinear feedback shift registers(NFSRs), their greatest common subfamily may be not unique. Given two NFSRs, the authors only consider the case that their greatest common subfamily exists and is unique. If the greatest common subfamily is exactly the set of all sequences which can be generated by both of them, the authors can determine it by Grbner basis theory. Otherwise, the authors can determine it under some conditions and partly solve the problem.

关键词： Greatest common subfamily Grbner basis nonlinear feedback shift register stream cipher

来源：评论

学校读者我要写书评

暂无评论

On s-uniform property of compressing sequences derived from primitive sequences modulo odd prime powers

引用

Science China(Information Sciences) 2017年第5期60卷 84-95页

作者： Yupeng JIANG Qun-Xiong ZHENG Dongdai LIN State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Sciences State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute

Let Z/（p;） be the integer residue ring modulo pewith p an odd prime and e 2. We consider the suniform property of compressing sequences derived from primitive sequences over Z/（p;）. We give necessary and sufficient conditions for two compressing sequences to be s-uniform with α provided that the compressing map is of the form φ(x;, x;,..., x;) = g(x;) + η(x;, x;,..., x;), where g(x;) is a permutation polynomial over Z/（p） and η is an（e-1）-variable polynomial over Z/（p）.

关键词： compressing map linear recurring sequence primitive sequence permutation polynomial s uniform

来源：评论

学校读者我要写书评

暂无评论

Integrating Neighborhood Geographic Distribution and Social Structure Influence for Social Media User Geolocation

引用

Computer Modeling in engineering & Sciences 2024年第9期140卷 2513-2532页

作者： Meng Zhang Xiangyang Luo Ningbo Huang Key Laboratory of Cyberspace Situation Awareness of Henan Province Zhengzhou450001China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China

Geolocating social media users aims to discover the real geographical locations of users from their publicly available data,which can support online location-based applications such as disaster alerts and local content *** relationship-based methods represent a classical approach for geolocating social ***,geographically proximate relationships are sparse and challenging to discern within social networks,thereby affecting the accuracy of user *** address this challenge,we propose user geolocation methods that integrate neighborhood geographical distribution and social structure influence(NGSI)to improve geolocation ***,we propose a method for evaluating the homophily of locations based on the k-order neighbor-hood geographic distribution(k-NGD)similarity among *** are notable differences in the distribution of k-NGD similarity between location-proximate and non-location-proximate *** this distinction,we filter out non-location-proximate social relationships to enhance location homophily in the social *** better utilize the location-proximate relationships in social networks,we propose a graph neural network algorithm based on the social structure *** algorithm enables us to perform a weighted aggregation of the information of users’multi-hop neighborhood,thereby mitigating the over-smoothing problem of user features and improving user geolocation *** results on real social media dataset demonstrate that the neighborhood geographical distribution similarity metric can effectively filter out non-location-proximate social ***,compared with 7 existing social relationship-based user positioning methods,our proposed method can achieve multi-granularity user geolocation and improve the accuracy by 4.84%to 13.28%.

关键词： User geolocation social media neighborhood geographic distribution structure influence

来源：评论

学校读者我要写书评

暂无评论

An efficient quantum meet-in-the-middle attack against NTRU-2005

引用

Chinese Science Bulletin 2013年第28期58卷 3514-3518页

作者： WANG Hong MA Zhi MA ChuanGui State Key Laboratory of Mathematical Engineering and Advanced Computing

NTRU is one of the most widely used public-key cryptosystems and its security has been an active research *** paper proposes a new way to find NTRU-2005 private *** algorithm is based on meet-in-the-middle attack and a quantum algorithm for searching the fixed weight *** with the current classical and quantum meet-in-the-middle attacks,our algorithm has lower time and space ***,this attack can also be applied against different versions of *** result can help to understand the security of NTRU better.

关键词：中间人攻击量子算法 NTRU 空间复杂度公钥密码安全性私钥搜索

来源：评论

学校读者我要写书评

暂无评论

Multiple Images Steganography of JPEG Images Based on Optimal Payload Distribution

引用

Computer Modeling in engineering & Sciences 2020年第10期125卷 417-436页

作者： Yang Pei Xiangyang Luo Yi Zhang Liyan Zhu Zhong Yuan Network Security Research Institute Zhengzhou UniversityZhengzhou450000China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450000China

Multiple images steganography refers to hiding secret messages in multiple natural images to minimize the leakage of secret messages during ***,the main multiple images steganography algorithms mainly distribute the payloads as sparsely as possible inmultiple cover images to improve the detection error rate of stego *** order to enable the payloads to be accurately and efficiently distributed in each cover image,this paper proposes a multiple images steganography for JPEG images based on optimal payload ***,the algorithm uses the principle of dynamic programming to redistribute the payloads of the cover images to reduce the time required in the process of payloads ***,by reducing the difference between the features of the cover images and the stego images to increase the detection error rate of the stego ***,this paper uses a data decomposition mechanism based on Vandermonde *** if part of the data is lost during the transmission of the secret messages,as long as the data loss rate is less than the data redundancy rate,the original secret messages can be *** results show that the method proposed in this paper improves the efficiency of payloads distribution compared with existing multiple images *** the same time,the algorithm can achieve the optimal payload distribution of multiple images steganography to improve the anti-statistical detection performance of stego images.

关键词： Multiple images steganography payloads distribution dynamic programming messages recovery

来源：评论

学校读者我要写书评

暂无评论

Dynamic evolution of collective emotions in social networks: a case study of Sina weibo

引用

Science China(Information Sciences) 2013年第7期56卷 150-167页

作者： XIONG XiaoBing ZHOU Gang HUANG YongZhong CHEN HaiYong XU Ke State Key Laboratory of Mathematical Engineering and Advanced Computing State Key Laboratory of Software Development Environment Beihang University

Emotion is a fundamental object of human existence and determined by a complex set of factors. With the rapid development of online social networks (OSNs), more and more people would like to express their emotion in OSNs, which provides wonderful opportunities to gain insight into how and why individual emotion is evolved in social network. In this paper, we focus on emotion dynamics in OSNs, and try to recognize the evolving process of collective emotions. As a basis of this research, we first construct a corpus and build an emotion classifier based on Bayes theory, and some effective strategies (entropy and salience) are introduced to improve the performance of our classifier, with which we can classify any Chinese tweet into a particular emotion with an accuracy as high as 82%. By analyzing the collective emotions in our sample networks in detail, we get some interesting findings, including a phenomenon of emotion synchronization between friends in OSNs, which offers good evidence for that human emotion can be spread from one person to another. Furthermore, we find that the number of friends has strong correlation with individual emotion. Based on those useful findings, we present a dynamic evolution model of collective emotions, in which both self-evolving process and mutual-evolving process are considered. To this end, extensive simulations on both real and artificial networks have been done to estimate the parameters of our emotion dynamic model, and we find that mutual-evolution plays a more important role than self-evolution in the distribution of collective emotions. As an application of our emotion dynamic model, we design an efficient strategy to control the collective emotions of the whole network by selecting seed users according to k-core rather than degree.

关键词： online social network emotion classifier emotion spread emotion dynamic model emotion controlling

来源：评论

学校读者我要写书评

暂无评论

An advanced Automatic Construction Method of ROP

引用

Wuhan University Journal of Natural Sciences 2015年第2期20卷 119-128页

作者： OUYANG Yongji WANG Qingxian PENG Jianshan ZENG Jie State Key Laboratory of Mathematical Engineering and Advanced Computing

Automatic return oriented programming （ROP） technology can effectively improve the efficiency of ROP constructed, but the existing research results still have some shortcomings including needing more address space, poor generality. In order to solve these problems, this paper presents an improved ROP auto-constructor QExtd. Firstly, we design a Turing-complete language QExtdL and provide the basis of gadgets analysis. Secondly, we represent the MI instruction and realize precise process of side-effect instructions for improving the efficiency of automatic construction. At last, we establish a three-layer language conversion mechanism, making it convenient for users to construct ROP. Theoretical and experimental data show that the QExtd automatic construction method is much better than the ROPgadget based on syntax. In addition, the proposed method succeeds in constructing gadgets of ROP with the probability of 84% for programs whose sizes are more than 20 KB and whose directory is ＂/usr/bin＂ in Ubuntu, which proves that the construction capability improves significantly.

关键词： return oriented programing (ROP) gadget automatic construction Turing-complete

来源：评论

学校读者我要写书评

暂无评论

APU-D* Lite: Attack Planning under Uncertainty Based on D* Lite

引用

Computers, Materials & Continua 2020年第11期65卷 1795-1807页

作者： Tairan Hu Tianyang Zhou Yichao Zang Qingxian Wang Hang Li State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China School of Electrical Engineering and Telecommunications UNSW KensingtonNSW 2033Australia

With serious cybersecurity situations and frequent network attacks,the demands for automated pentests continue to increase,and the key issue lies in attack *** the limited viewpoint of the attacker,attack planning under uncertainty is more suitable and practical for pentesting than is the traditional planning approach,but it also poses some *** address the efficiency problem in uncertainty planning,we propose the APU-D*Lite algorithm in this ***,the pentest framework is mapped to the planning problem with the Planning Domain Definition Language(PDDL).Next,we develop the pentest information graph to organize network information and assess relevant exploitation actions,which helps to simplify the problem ***,the APU-D*Lite algorithm is introduced based on the idea of incremental heuristic *** method plans for both hosts and actions,which meets the requirements of *** the pentest information graph as the input,the output is an alternating host and action *** experiments,we use the attack success rate to represent the uncertainty level of the *** result shows that APU-D*Lite displays better reliability and efficiency than classical planning algorithms at different attack success rates.

关键词： Attack planning under uncertainty automated pentest APU-D*Lite algorithm incremental heuristic search

来源：评论

学校读者我要写书评

暂无评论

An efficient and practical threshold gateway-oriented password-authenticated key exchange protocol in the standard model

引用

Science China(Information Sciences) 2017年第7期60卷 130-143页

作者： Fushan WEI Jianfeng MA Ruijie ZHANG Chuangui MA Xuan WANG State Key Laboratory of Integrated Service Networks Xidian University State Key Laboratory of Mathematical Engineering and Advanced Computing The PLA Information Engineering University Engineering University of CAPF

With the assistance of an authentication server, a gateway-oriented password-authenticated key exchange(GPAKE) protocol can establish a common session key shared between a client and a gateway. Unfortunately, a GPAKE protocol becomes totally insecure if an adversary can compromise the authentication server and steal the passwords of the clients. In order to provide resilience against adversaries who can hack into the authentication server, we propose a threshold GPAKE protocol and then present its security proof in the standard model based on the hardness of the decisional Diffie-Hellman(DDH) problem. In our proposal,the password is shared among n authentication servers and is secure unless the adversary corrupts more than t + 1 servers. Our protocol requires n > 3t servers to work. Compared with existing threshold PAKE protocols,our protocol maintains both stronger security and greater efficiency.

关键词： password key exchange gateway threshold provable security

来源：评论

学校读者我要写书评

暂无评论

An anonymous key agreement protocol with robust authentication for smart grid infrastructure

引用

Science China(Information Sciences) 2022年第9期65卷 291-293页

作者： Ting CHEN Qingfeng CHENG Xinghua LI School of Cyber Engineering Xidian University State Key Laboratory of Mathematical Engineering and Advanced Computing

Dear editor,The issue on how to ensure the smart grid environment’s security and reliability has always been a focus in current research. The rapid expansion of the Internet of Things enables billions of smart devices to be involved in the smart grid, such as smart meters, who play a part in monitoring and recording consumers’ power usage. The smart meter first amasses the information of energy consumption and then sends it to utility control.

关键词： smart grid infrastructure impersonation attack perfect forward security ephemeral key compromise attack key agreement

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：