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

6th International Conference on communication, Image and Signal Processings, CCISP 2021

作者： Peng, Haiyang Yao, Hao Zhao, Yue Chen, Yuxiang He, Yachen He, Shanxiang Science and Technology on Communication Security Laboratory Chengdu610041 China No.30 Research Institute of China Electronics Technology Group Corporation Chengdu610041 China China Electronics Technology Cyber Security Co. Ltd Chengdu610041 China 4 Hangzhou Hikvision Digital Technology Co. Ltd. China

ISBN: (纸本)9781665432795

In view of the common edge computing-based cloud-side collaborative environment summary existing search key and authentication key sharing caused by data information leakage, this paper proposes a cryptographic search based on public key searchable encryption in an edge computing environment method, this article uses the public key to search for the characteristics of the encryption algorithm, and allows users to manage the corresponding private key. In the process of retrieval and execution, the security of the system can be effectively ensured through the secret trapdoor. Through the comparison of theoretical algorithms, the searchable encryption scheme in the edge computing environment proposed in this paper can effectively reduce the computing overhead on the user side, and complete the over-complex computing process on the edge server or the central server, which can improve the overall efficiency of encrypted search. © 2021 IEEE

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Fast Decryption of Excel Document Encrypted by RC4 Algorithm 20

Fast Decryption of Excel Document Encrypted by RC4 Algorithm

引用

20th IEEE International Conference on communication technology, ICCT 2020

作者： Zhang, Lijun Tan, Cheng Yu, Fei Science and Technology on Communication Security Laboratory Chengdu610041 China

ISBN: (纸本)9781728181417

In this paper, we give a fast decryption method of Excel document encrypted by RC4 algorithm. Through a detailed analysis of document storage structure and encryption process, we illustrate the inner principle of key generation and data encryption in the block by block manner. We present an efficient way of recovering the intermediate key by using rainbow table attack, which can be directly applied to decrypt the Excel document. The advantage of our method is that the decryption time of one document is no longer affected by the password length and complexity. In our practical test, it has achieved the decryption of Excel encrypted documents in an average of 3 minutes on a common personal computer, which greatly improves decryption efficiency of encrypted documents compared with the current dictionary and brute force attack methods of recovering document password. © 2020 IEEE.

关键词： Personal computers

来源：评论

学校读者我要写书评

暂无评论

Improving key rates by tighter information reconciliation leakage estimation for quantum key distribution

arXiv

引用

arXiv 2025年

作者： Mao, Hao-Kun Yang, Bo Qiao, Yu-Cheng Yan, Bing-Ze Zhao, Qiang Xu, Bing-Jie Li, Qiong School of Cyberspace Science Faculty of Computing Harbin Institute of Technology Harbin150080 China Guangxi Key Lab Cryptography and Information Security Guilin University of Electronic Technology Guangxi Guilin541004 China School of Information Engineering Zhejiang Ocean University Zhoushan316022 China Science and Technology on Security Communication Laboratory Institute of Southwestern Communication Chengdu610041 China

Previous research has aimed to precisely estimate information leakage to improve the secure key rate (SKR) and maximum transmission distance in quantum key distribution (QKD). However, existing methods repeatedly considerd the information of the multi-photon pulses known to Eve before and after information reconciliation, resulting in an overestimation of the leakage amount. We propose a novel approach that considers the quantum part’s effect on post-processing, providing a more accurate estimation of information reconciliation leakage to improve the SKR. Theoretical analysis shows that our method more accurately estimates the information reconciliation leakage, significantly improving the SKR at any distance as well as the maximum transmission distance. It is worth mentioning that previous studies treat information leakage of the error correction as Shannon bound Nh(e), and our method can estimate it more tightly. Simulation results for decoy-BB84 and measurement-device-independent (MDI) protocols using Cascade are consistent with the theoretical analysis. The farther the transmission distance, the greater the growth rate of SKR. When the error rate is 33%, compared with the original method, the SKR growth rate of decoy-BB84 at 100KM is 100.4%, and the transmission distance of MDI increases by 22KM. Copyright © 2025, The Authors. All rights reserved.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

A Classification and Identification technology of TLS Encrypted Traffic Applications 4

A Classification and Identification Technology of TLS Encryp...

引用

2021 IEEE 4th International Conference on Big Data and Artificial Intelligence, BDAI 2021

作者： Zhao, Yue Yang, Yarang Niu, Yiru Wu, Kaijun Hao, Yao Su, Hong Zhao, Qi Science and Technology on Communication Security Laboratory Chengdu610041 China Kashi University College of Physics and Electrical Engineering Kashi84006 China The Thirtieth Research Institute of China Electronic Technology Group Corporation Chengdu610041 China

ISBN: (纸本)9781665412704

In the paper, regarding the transport layer security encrypted traffic of the Internet, the application program identification and application protocol classification technology of encrypted traffic based on hidden Markov model and long short-term memory networks are studied, and the encrypted traffic detection prototype is constructed. The experimental results show that in terms of web application, real-time transport protocol and other encrypted traffics, the prototype can make accurate classification and identification, and the accuracy rate is generally higher than 96.5%, the recall rate higher than 92.0%, and the classification and identification time is less than 0.2 seconds, whereby the proposed method can improve the classification accuracy and real-time detection performance. © 2021 IEEE.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Research on Data security of Unmanned Aerial Vehicles

Research on Data Security of Unmanned Aerial Vehicles

引用

2021 International Conference on Networking and Network Applications, NaNA 2021

作者： Chen, Yuxiang Hao, Yao Wu, Kaijun Yi, Zhongqiang Peng, Haiyang Sijie, Liao Science and Technology on Communication Security Laboratory Chengdu610041 China No.30 Inst China Electronics Technology Group Corporation China China Electronics Technology Cyber security Co. Ltd China

ISBN: (纸本)9781665441582

With the development of unmanned platforms, there are large numbers of unmanned aerial vehicles(UAVs), due to UAVs' new features such as lightweight, high speed mobility and heterogeneous, UAVs are facing great challenges of data security. As a key means to protect data security, cryptography is of great significance. Traditional mature and complete cryptography schemes need to be adjusted to meet the new features of UAVs. We start with the security challenges faced by UAV architecture, then analyze the cryptographic technologies that can be applied. By comparing with existing researching schemes, we shows the advantages of different cryptographic technologies in the security protection of unmanned platforms and looks forward to the future. © 2021 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

A Lower Bound on the Third-Order Nonlinearity of the Simplest $Mathcal{Ps}_ap$ Bent Functions

SSRN

引用

SSRN 2023年

作者： Li, Zhaole Shen, Bing Tang, Deng School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China Science and Technology on Communication Security Laboratory Institute of Southwest Communication Research Sichuan Chengdu610041 China

Boolean functions used in symmetric-key encryption should have high higher-order nonlinearity to resist several known attacks, such as algebraic attack and low-degree approximation. The higher-order nonlinearity also plays an important role in coding theory and theoretical computer science. It is well-known that bent functions have the highest nonlinearity in even number of variables and thus they possess the best resistance against fast correlation attack and best affine approximation. However, there is limited knowledge regarding the higher-order nonlinearity of bent functionsbecause computing the higher-order nonlinearity, or even providing tight lower bounds, is a hard task. In 1974, Dillon proposed two well-known classes of bent functions based on partial spread (in brief, $\mathcal{PS}$), called $\mathcal{PS}^-$ and $\mathcal{PS}^+$, respectively. He also exhibited a subclass of $\mathcal{PS}^-$, known as partial spread affine plane ($\mathcal{PS}_{ap}$ for short). In this paper, we provide a lower bound on the third-order nonlinearity of the simplest $\mathcal{PS}_{ap}$ bent functions in $n$ variables, where $n\ge 6$ is even, by calculating nonlinearities of all second-order derivatives of this kind of bent functions. Compared to the two known lower bounds on the third-order nonlinearity given by Carlet and Tang et al. respectively, our lower bound is much better than these two ones. © 2023, The Authors. All rights reserved.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Experimental Demonstration of High-Rate Discrete-Modulated Continuous-Variable Quantum Key Distribution System

arXiv

引用

arXiv 2022年

作者： Pan, Yan Wang, Heng Shao, Yun Pi, Yaodi Li, Yang Liu, Bin Huang, Wei Xu, Bingjie Science and Technology on Communication Security Laboratory Institute of Southwestern Communication Chengdu610041 China College of Computer Science Chongqing University Chongqing 400044 China

A high-rate continuous-variable quantum key distribution (CV-QKD) system based on high-order discrete modulation is experimentally investigated. With the help of the novel system scheme, effective digital signal processing algorithms and advanced analytical security proof method, the transmission results of 5 km, 10 km, 25 km, and 50 km are achieved for the 1 GBaud optimized quantum signals. Correspondingly, the asymptotic secret key rate (SKR) is 288.421 Mbps, 159.395 Mbps, 50.004 Mbps and 7.579 Mbps for discrete Gaussian (DG) 64QAM, and 326.708 Mbps, 179.348 Mbps, 50.623 Mbps and 9.212 Mbps for DG 256QAM. Under the same parameters, the achieved SKRs of DG 256QAM is almost same to ideal Gaussian modulation. In this case, the demonstrated high-rate discrete modulated CV-QKD system has the application potential for high speed security communication under tens of kilometers. © 2022, CC BY.

关键词： Quadrature amplitude modulation

来源：评论

学校读者我要写书评

暂无评论

Tight Bound on Tilted Chsh Inequality with Measurement Dependence

SSRN

引用

SSRN 2023年

作者： Li, Runze Li, Dandan Huang, Wei Xu, Bingjie Gao, Fei State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China Beijing University of Posts and Telecommunications Beijing100876 China Science and Technology on Communication Security Laboratory Institute of Southwestern Communication Chengdu610041 China

Measurement dependence is the property that the distribution of the underlying variable is correlated with the measurement settings. If there is measurement dependence in a Bell test, the upper bound of Bell inequality will be affected. In the framework of deviceindependent quantum random number generation, the violation of Bell inequality indicates the existence of certified randomness. A tight upper bound on Bell inequality is critical to the amount of certified randomness. Recently, Sadhu et al. [Phys. Rev. A 107, 012212 (2023)] obtained a modified tilted CHSH inequality when measurement dependence exists. However, the upper bound of the modified tilted CHSH inequality they obtained is not tight. In this paper, we propose a method to quantify the measurement dependence applicable to the tilted CHSH inequality based on its structure. After that, we obtain a tight upper bound of modified tilted CHSH inequality and construct a local deterministic strategy to reach the upper bound. © 2023, The Authors. All rights reserved.

关键词： Bells

来源：评论

学校读者我要写书评

暂无评论

Automatic Text Summarization Method Based on Improved Textrank Algorithm and K-Means Clustering

SSRN

引用

SSRN 2023年

作者： Liu, Wenjun Sun, Yuyan Yu, Bao Wang, Hailan Peng, Qingcheng Hou, Mengshu Guo, Huan Wang, Hai Liu, Cheng Chengdu611731 China School of Computer and Software Engineering XiHua University Chengdu610039 China School of Big Data and Artificial Intelligence Chengdu Technological University Chengdu611730 China Science and Technology on Communication Security Laboratory The 30th Research Institute of China Electronics Technology Group Corporation Chengdu610041 China

Automatic text summarization is to obtain a summary by compressing the text while retaining its important information, and then users can obtain the important content of the text by reading the summary. In the research literatures, the extraction method is widely used and is also one of the main research methods of most abstracts. However, this summary method still has some problems. The selection of the initial cluster center has not been carefully determined, and in articles with complex sentences, the sentence redundancy summarized is high. In order to solve the above problems, this paper proposes an automatic text summarization method based on improved TextRank algorithm and K-Means clustering. This method uses the improved BM25 model to calculate the BM25 similarity between sentences, and then uses the TextRank model to obtain the TR score of sentences. Then, the TR score is used to select the initial center of K-Means clustering. Finally, the summary is obtained through the class score and sentence score. The experimental results show that the proposed BM25Rank algorithm has a better effect on DUC2004 dataset. In conclusion, the improved TextRank and K-Means method proposed in this paper improve the accuracy of automatic text summarization and reduce the redundancy. © 2023, The Authors. All rights reserved.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Experimental demonstration of 4-user quantum access network based on passive optical network

Experimental demonstration of 4-user quantum access network ...

引用

49th European Conference on Optical communications (ECOC 2023)

作者： Y. Pan Y. Bian H. Wang J. Dou Y. Shao Y. Pi T. Ye J. Yang Y. Li W. Huang S. Yu Y. Zhang B. Xu Science and Technology on Communication Security Laboratory Institute of Southwestern Communication Chengdu 610041 People's Republic of China State Key Laboratory of Information Photonics and Optical Communications School of Electronic Engineering Beijing University of Posts and Telecommunications Beijing 100876 People's Republic of China

A 4-user high-compatibility quantum access network using coherent states is experimentally demonstrated based on passive optical network. The achieved average secret key rate is around 4.1 Mbps between the transmitter...

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：