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

Cryptanalysis of full PRIDE block cipher

Science china(Information Sciences) 2017年第5期60卷 169-180页

作者： Yibin DAI Shaozhen CHEN State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute

PRIDE is a lightweight block cipher proposed at CRYPTO 2014 by Albrecht et al., who claimed that the construction of linear layers is efficient and secure. In this paper, we investigate the key schedule and find eight 2-round iterative related-key differential characteristics, which can be used to construct 18-round related-key differentials. A study of the first subkey derivation function reveals that there exist three weak-key classes, as a result of which all the differences of subkeys for each round are identical. For the weak-key classes,we also find eight 2-round iterative related-key differential characteristics. Based on one of the related-key differentials, we launch an attack on the full PRIDE block cipher. The data and time complexity are 2;chosen plaintexts and 2;encryptions, respectively. Moreover, by using multiple related-key differentials, we improve the cryptanalysis, which then requires 2;chosen plaintexts and 2;encryptions, respectively. Finally, we use two 17-round related-key differentials to analyze full PRIDE, which requires 2;plaintexts and 2;*** are the first results on full PRIDE, and show that the PRIDE block cipher is not secure against related-key differential attack.

关键词： cryptanalysis block cipher PRIDE iterative characteristics related-key differential

来源：评论

学校读者我要写书评

暂无评论

Stego key searching for LSB steganography on JPEG decompressed image

引用

Science china(Information Sciences) 2016年第3期59卷 60-74页

作者： Jiufen LIU Yuguo TIAN Tao HAN Junchao WANG Xiangyang LUO Zhengzhou Information Science and Technology Institute State Key Laboratory of Mathematical Engineering and Advanced Computing

At present, steganalysis research focuses on detecting the existence of a hidden message. However,extracting the hidden information, i.e., an extracting attack, is crucial in obtaining effective evidence in computer forensics. Due to the difficulty of an extracting attack, research in this field is limited. In steganography with a stego key, an extracting attack is equivalent to recovering the stego key. In this paper we study a method for recovering the stego key in least significant bit(LSB) steganography with a decompressed JPEG image as the cover image. Firstly, the recovery of the stego key is translated into a cryptanalysis problem for a sequential cipher. The method for recovering the stego key is based on estimating the modification positions. The minimum size of the data used to recover the stego key successfully is discussed. Secondly, when a decompressed JPEG image is used as the cover image, the probability of recovering the cover pixels using recompression is *** is used to compute the error of the estimated sequence. Finally, an algorithm to recover the stego key in LSB steganography with a decompressed JPEG image as the cover image is proposed. The experimental results for the steganographic software, Hide and Seek 4.1 and its variant, which is a typical representative of LSB steganography, show that the proposed method can successfully recover the stego key in LSB replacement and LSB matching, i.e., the extracting attack is successful, and it outperforms three previous methods in terms of computational complexity.

关键词： steganalysis extracting attack LSB steganography decompressed JPEG image recompression stego key

来源：评论

学校读者我要写书评

暂无评论

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 空间复杂度公钥密码安全性私钥搜索

来源：评论

学校读者我要写书评

暂无评论

IP2vec:an IP node representation model for IP geolocation

引用

Frontiers of Computer Science 2024年第6期18卷 189-204页

作者： Fan ZHANG Meijuan YIN Fenlin LIU Xiangyang LUO Shuodi ZU State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450001China Key Laboratory of Cyberspace Situation Awareness of Henan Province Zhengzhou 450001China

IP geolocation is essential for the territorial analysis of sensitive network entities,location-based services(LBS)and network fraud *** has important theoretical significance and application ***-based IP geolocation is a hot research ***,the existing IP geolocation algorithms cannot effectively utilize the distance characteristics of the delay,and the nodes’connection relation,resulting in high geolocation *** is challenging to obtain the mapping between delay,nodes’connection relation,and geographical *** on the idea of network representation learning,we propose a representation learning model for IP nodes(IP2vec for short)and apply it to street-level IP ***2vec model vectorizes nodes according to the connection relation and delay between nodes so that the IP vectors can reflect the distance and topological proximity between IP *** steps of the street-level IP geolocation algorithm based on IP2vec model are as follows:Firstly,we measure landmarks and target IP to obtain delay and path information to construct the network ***,we use the IP2vec model to obtain the IP vectors from the network ***,we train a neural network to fit the mapping relation between vectors and locations of ***,the vector of target IP is fed into the neural network to obtain the geographical location of target *** algorithm can accurately infer geographical locations of target IPs based on delay and topological proximity embedded in the IP *** cross-validation experimental results on 10023 target IPs in New York,Beijing,Hong Kong,and Zhengzhou demonstrate that the proposed algorithm can achieve street-level *** with the existing algorithms such as Hop-Hot,IP-geolocater and SLG,the mean geolocation error of the proposed algorithm is reduced by 33%,39%,and 51%,respectively.

关键词： IP geolocation network measurement node embedding

来源：评论

学校读者我要写书评

暂无评论

Fast Warming Over the Mongolian Plateau a Catalyst for Extreme Rainfall Over North china

引用

Geophysical Research Letters 2025年第8期52卷

作者： Gu, Jun Zhao, Chun Xu, Mingyue Ma, Yuanyuan Hu, Zhiyuan Jin, Chen Guo, Jianping Geng, Tao Cai, Wenju Deep Space Exploration Laboratory/School of Earth and Space Sciences/CMA-USTC Laboratory of Fengyun Remote Sensing/State Key Laboratory of Fire Science/Institute of Advanced Interdisciplinary Research on High-Performance Computing Systems and Software University of Science and Technology of China Hefei China Laoshan Laboratory Qingdao China CAS Center for Excellence in Comparative Planetology University of Science and Technology of China Hefei China Key Laboratory of Land Surface Process and Climate Change in Cold and Arid Regions Northwest Institute of Eco-Environment and Resources Chinese Academy of Sciences Lanzhou China Key Laboratory for Climate Change and Natural Disaster Studies of Guangdong Province School of Atmospheric Sciences Sun Yat-sen University Zhuhai China Southern Marine Science and Engineering Guangdong Laboratory Zhuhai China State Key Laboratory of Severe Weather Chinese Academy of Meteorological Sciences Beijing China and Physical Oceanography Laboratory Ocean University of China Qingdao China

Extreme rainfall events are becoming increasingly severe under a warming climate. North china has experienced several catastrophic rainfall events, of which the rainstorm in 2023 was particularly severe inducing unprecedented damage. Since 1980, the neighboring Mongolian Plateau (MP) has been warming at a rate three times the global average, faster than the surrounding regions. Whether a link exists between extreme rainfall in North china and the fast MP warming is unknown. Here, using global variable-resolution atmospheric model with convection-permitting capability over North china, we find the rapid warming trends, particularly over the MP, are highly conducive to extreme rainfall over North china. In the 2023 case, the fast MP warming induced an anomalous terrestrial high, which in the Western North Pacific Subtropical High created a strong high-pressure system over North china. This system obstructed northeastward movement of Typhoon Doksuri, concentrating moisture supply which prolonged and intensified the extreme. © 2025. The Author(s).

关键词： Global warming

来源：评论

学校读者我要写书评

暂无评论

Complexity of Tensor Product Functions in Representing Antisymmetry

arXiv

引用

arXiv 2025年

作者： Wang, Yuyang Hu, Yukuan Liu, Xin State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China CERMICS Ecole des Ponts IP Paris Marne-la-Vallée77455 France

Tensor product function (TPF) approximations have been widely adopted in solving high-dimensional problems, such as partial differential equations and eigenvalue problems, achieving desirable accuracy with computational overhead that scales linearly with problem dimensions. However, recent studies have underscored the extraordinarily high computational cost of TPFs on quantum many-body problems, even for systems with as few as three particles. A key distinction in these problems is the antisymmetry requirement on the unknown functions. In the present work, we rigorously establish that the minimum number of involved terms for a class of TPFs to be exactly antisymmetric increases exponentially fast with the problem dimension. This class encompasses both traditionally discretized TPFs and the recent ones parameterized by neural networks. Our proof exploits the link between the antisymmetric TPFs in this class and the corresponding antisymmetric tensors and focuses on the Canonical Polyadic rank of the latter. As a result, our findings uncover a fundamental incompatibility between antisymmetry and low-rank TPFs in high-dimensional contexts and offer new insights for further developments. Copyright © 2025, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Optimal Bilinear Equalizer for Cell-Free Massive MIMO Systems over Correlated Rician Channels

引用

IEEE Transactions on Signal Processing 2025年

作者： Wang, Zhe Zhang, Jiayi Bjornson, Emil Niyato, Dusit Ai, Bo Beijing Jiaotong University State Key Laboratory of Advanced Rail Autonomous Operation Beijing100044 China Beijing Jiaotong University School of Electronics and Information Engineering Beijing100044 China KTH Royal Institute of Technology Department of Computer Science Stockholm114 28 Sweden Nanyang Technological University College of Computing & Data Science 639798 Singapore

In this paper, we explore the low-complexity optimal bilinear equalizer (OBE) combining scheme design for cell-free massive multiple-input multiple-output networks with spatially correlated Rician fading *** provide a spectral efficiency (SE) performance analysis framework for both the centralized and distributed processing schemes with bilinear equalizer (BE)-structure combining schemes applied. The BE-structured combining is a set of schemes that are constructed by the multiplications of channel statistics-based BE matrices and instantaneous channel estimates. Notably, we derive closed-form achievable SE expressions for centralized and distributed BE-structured combining schemes. We propose one centralized and two distributed OBE schemes: Centralized OBE (C-OBE), Distributed OBE based on Global channel statistics (DG-OBE), and Distributed OBE based on Local channel statistics (DL-OBE), which maximize their respective SE expressions. OBE matrices in these schemes are tailored based on varying levels of channel statistics. Notably, we obtain new and insightful closed-form results for the C-OBE, DG-OBE, and DL-OBE combining schemes. Numerical results demonstrate that the proposed OBE schemes can achieve excellent SE, even in scenarios with severe pilot contamination. © 2025 IEEE. All rights reserved.

关键词： Fading channels

来源：评论

学校读者我要写书评

暂无评论

IP-geolocater:a more reliable IP geolocation algorithm based on router error training

引用

Frontiers of Computer Science 2022年第1期16卷 101-111页

作者： Shuodi ZU Xiangyang LUO Fan ZHANG State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China Zhengzhou Science and Technology Institute Zhengzhou450001China

Location based services(LBS)are widely utilized,and determining the location of users’IP is the foundation for *** by unstable delay and insufficient landmarks,the existing geolocation algorithms have problems such as low geolocation accuracy and uncertain geolocation error,difficult to meet the requirements of LBS for accuracy and reliability.A new IP geolocation algorithm based on router error training is proposed in this manuscript to improve the accuracy of geolocation results and obtain the current geolocation error ***,bootstrapping is utilized to divide the landmark data into training set and verification set,and/24 subnet distribution is utilized to extend the training ***,the path detection is performed on nodes in the three data sets respectively to extract the metropolitan area network(MAN)of the target city,and the geolocation result and error of each router in MAN are obtained by training the detection ***,the MAN is utilized to get the target’s *** on china’s 24,254 IP geolocation experiments,the proposed algorithm has higher geolocation accuracy and lower median error than existing typical geolocation algorithms LBG,SLG,NNG and RNBG,and in most cases the difference is less than 10km between estimated error and actual error.

关键词： estimated error geolocation path detection network measurement

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Revocable Broadcast Encryption with Constant Ciphertext and Private key Size

引用

Chinese Journal of Electronics 2019年第4期28卷 690-697页

作者： JIA Hongyong CHEN Yue YANG Kuiwu GUO Yuanbo WANG Zhiwei Zhengzhou University State Key Laboratory of Mathematical Engineering and Advanced Computing Nanjing University of Post and Communications

In a revocable broadcast encryption scheme, the group manager can flexibly set revoked users who cannot decrypt the ciphertext. Many applications of the revocable broadcast encryption have been found in the secure cloud data sharing. An adaptively secure revocable broadcast encryption system with constant ciphertext and private key size under standard assumptions is more suitable for use in the cloud environment. Few existing revocable broadcast encryption schemes meet such a requirement. We propose a revocable broadcast encryption scheme with constant size ciphertext and private key by combining the RSA cryptographic accumulator with an efficient identity based encryption system. We prove it to be adaptively secure under standard assumptions using dual system encryption techniques.

关键词： Cryptographic accumulator Broadcast encryption Revocable Dual system encryption Cloud data sharing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：