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

A Novel S-Box GenerationMethodology Based on the Optimized GANModel

Computers, Materials & Continua 2023年第8期76卷 1911-1927页

作者： Runlian Zhang Rui Shu Yongzhuang Wei Hailong Zhang Xiaonian Wu Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic TechnologyGuilin541004China State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijing100085China

S-boxes can be the core component of block ciphers,and how to efficiently generate S-boxes with strong cryptographic properties appears to be an important task in the design of block *** this work,an optimized model based on the generative adversarial network(GAN)is proposed to generate 8-bit *** central idea of this optimized model is to use loss function constraints for *** specially,the Advanced Encryption Standard(AES)S-box is used to construct the sample dataset via the affine equivalence ***,three models are respectively built and cross-trained to generate 8-bit S-boxes based on three extended frameworks of GAN,i.e.,Deep Convolution Generative Adversarial Networks(DCGAN),Wasserstein Generative Adversarial Networks(WGAN),and WassersteinGenerativeAdversarial NetworkwithGradient Penalty(WGANGP).Besides,an optimized model based onWGAN-GP referred to asWGPIM is also proposed,which adds the loss function constraints to the generator network of the WGAN-GP model,including bijection loss,differential uniformity loss,and nonlinearity *** this case,8-bit S-boxes can be generated with *** results illustrate that the WGP-IM model can generate S-boxes with excellent cryptographic *** particular,the optimal differential uniformity of the generated S-boxes can be reduced to 8,and the nonlinearity can be up to *** with previous S-box generation methods,this new method is simpler and it can generate S-boxes with excellent cryptographic properties.

关键词： S-box generative adversarial network loss function affine equivalence

来源：评论

学校读者我要写书评

暂无评论

Minimizing CNOT-count in quantum circuit of the extended Shor’s algorithm for ECDLP

引用

Cybersecurity 2025年第1期8卷 153-179页

作者： Xia Liu Huan Yang Li Yang State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijingChina School of Cyber Security University of Chinese Academy of SciencesBeijingChina Beijing Youzhuju Network Technology Co. Ltd.BeijingChina

The elliptic curve discrete logarithm problem(ECDLP)is a popular choice for cryptosystems due to its high level of ***,with the advent of the extended Shor’s algorithm,there is concern that ECDLP may soon be *** the algorithm does ofer hope in solving ECDLP,it is still uncertain whether it can pose a real threat in *** the perspective of the quantum circuits of the algorithm,this paper analyzes the feasibility of cracking ECDLP using an ion trap quantum computer with improved quantum circuits for the extended Shor’s *** give precise quantum circuits for extended Shor’s algorithm to calculate discrete logarithms on elliptic curves over prime felds,including modular subtraction,three diferent modular multiplication,and modular ***,we incorporate and improve upon windowed arithmetic in the circuits to reduce the *** previous studies mostly focused on minimizing the number of qubits or the depth of the circuit,we focus on minimizing the number of CNOT gates in the circuit,which greatly afects the running time of the algorithm on an ion trap quantum ***,we begin by presenting implementations of basic arithmetic operations with the lowest known CNOT-counts,along with improved constructions for modular inverse,point addition,and windowed ***,we precisely estimate that,to execute the extended Shor’s algorithm with the improved circuits to factor an n-bit integer,the CNOT-count required is1237n^(3)/log n+2n^(2)+***,we analyze the running time and feasibility of the extended Shor’s algorithm on an ion trap quantum computer.

关键词： Elliptic curve discrete logarithm problem Extended Shor’s algorithm Quantum circuits Ion trap quantum computer

来源：评论

学校读者我要写书评

暂无评论

TMC-GCN: Encrypted Traffic Mapping Classification Method Based on Graph Convolutional Networks

引用

Computers, Materials & Continua 2025年第2期82卷 3179-3201页

作者： Baoquan Liu Xi Chen Qingjun Yuan Degang Li Chunxiang Gu School of Cyberspace Security Zhengzhou UniversityZhengzhou450002China School of Cyberspace Security Information Engineering UniversityZhengzhou450001China Henan Key Laboratory of Network Cryptography Technology Zhengzhou450001China

With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.

关键词： Encrypted traffic classification deep learning graph neural networks multi-layer perceptron graph convolutional networks

来源：评论

学校读者我要写书评

暂无评论

A Fault-Tolerant Group Key Management Scheme for the Internet of Things Based on Multi-Layer Blockchain

引用

IEEE Internet of Things Journal 2025年第11期12卷 18004-18018页

作者： Hou, Zhiwen Pei, Tingrui Li, Ming Wei, Kaimin Chen, Yingyang Cao, Sixing Jinan University College of Cyber Security Guangzhou510632 China Jinan University The Natl. Joint Engineering Research Center of Network Security Detection and Protection Technology College of Information Science and Technology Jinan University College of Cyber Security Guangzhou510632 China Jinan University College of Information Science and Technology Guangzhou510632 China

The importance of group communication in the context of the Internet of Things (IoT) is growing, yet the security and stability of this communication are facing significant challenges. The prevailing distributed group key management schemes are ill-suited to resource-constrained devices. Furthermore, those that rely on servers are vulnerable to single-point failures and Byzantine risks. The distributed, immutable, and automatic execution of smart contracts on blockchains may offer a potential solution to these problems. This paper puts forth a multi-layer blockchain-based IoT group key management scheme with Byzantine fault tolerance. The scheme oversees the management of IoT device subgroups through the deployment of blockchain and smart contracts on edge servers while overseeing the entire device group in a hierarchical structure. A redundant selection mechanism based on hash mapping has been designed to guarantee reliable communication between disparate blockchains and devices. Concurrently, the scheme incorporates a server detection mechanism for Byzantine behavior, thereby ensuring the stability of the blockchain. The results of the experimental analysis demonstrate that the scheme exhibits enhanced security and fault tolerance. © 2014 IEEE.

关键词： Blockchains Servers Internet of Things security Fault tolerant systems Fault tolerance Smart contracts Protocols Scalability Electronic mail

来源：评论

学校读者我要写书评

暂无评论

A verifiable EVM-based cross-language smart contract implementation scheme for matrix calculation

引用

Digital Communications and Networks 2025年第2期11卷 432-441页

作者： Yunhua He Yigang Yang Chao Wang Anke Xie Li Ma Bin Wu Yongdong Wu Information Science and Technology North China University of TechnologyBeijing100144China Bei Hang University Yunnan Innovation Institute Yunnan650233China Institute of Information Engineering Chinese Academy of SciencesBeijing101408China College of Cyber Security and College of Information Science and Technology Jinan UniversityGuangzhou510632China

The wide application of smart contracts allows industry companies to implement some complex distributed collaborative businesses,which involve the calculation of complex functions,such as matrix ***,complex functions such as matrix operations are difficult to implement on Ethereum Virtual Machine(EVM)-based smart contract platforms due to their distributed security environment *** off-chain methods often result in a significant reduction in contract execution efficiency,thus a platform software development kit interface implementation method has become a feasible way to reduce overheads,but this method cannot verify operation correctness and may leak sensitive user *** solve the above problems,we propose a verifiable EVM-based smart contract cross-language implementation scheme for complex operations,especially matrix operations,which can guarantee operation correctness and user privacy while ensuring computational *** this scheme,a verifiable interaction process is designed to verify the computation process and results,and a matrix blinding technology is introduced to protect sensitive user data in the calculation *** security analysis and performance tests show that the proposed scheme can satisfy the correctness and privacy of the cross-language implementation of smart contracts at a small additional efficiency cost.

关键词： Smart contract Blockchain Cross-language programming Bilinear pairing Publicly verifiable computation

来源：评论

学校读者我要写书评

暂无评论

Randomization Strategies in Image Steganography Techniques:A Review

引用

Computers, Materials & Continua 2024年第8期80卷 3139-3171页

作者： AFM Zainul Abadin Rossilawati Sulaiman Mohammad Kamrul Hasan Center for Cyber Security Faculty of Information Science and TechnologyUniversiti Kebangsaan Malaysia(UKM)BangiSelangor43600Malaysia Department of Information and Communication Engineering Pabna University of Science and TechnologyPabna6600Bangladesh

Image steganography is one of the prominent technologies in data hiding *** system performance mostly depends on the embedding *** goal is to embed strictly confidential information into images without causing perceptible changes in the original *** randomization strategies in data embedding techniques may utilize random domains,pixels,or region-of-interest for concealing secrets into a cover image,preventing information from being discovered by an *** implementation of an appropriate embedding technique can achieve a fair balance between embedding capability and stego image imperceptibility,but it is challenging.A systematic approach is used with a standard methodology to carry out this *** review concentrates on the critical examination of several embedding strategies,incorporating experimental results with state-of-the-art methods emphasizing the robustness,security,payload capacity,and visual quality metrics of the stego *** fundamental ideas of steganography are presented in this work,along with a unique viewpoint that sets it apart from previous works by highlighting research gaps,important problems,and ***,it offers a discussion of suggested directions for future study to advance and investigate uncharted territory in image steganography.

关键词： information hiding image steganography randomized embedding techniques payload capacity imperceptibility

来源：评论

学校读者我要写书评

暂无评论

Redundant Node Scheduling Algorithm for Wireless Sensor Networks Based on Topology Structure

引用

IEEE Access 2025年 13卷 84752-84764页

作者： Shi, Lijuan Zheng, Jun Changzhou College of Information Technology School of Cyberspace Security Changzhou213164 China Nanjing University of Aeronautics and Astronautics College of Electronic and Information engineering Nanjing210016 China

Wireless sensor networks face issues such as high energy consumption and the impact of individual node failures on the entire network. In order to effectively regulate redundant nodes to balance node coverage and energy consumption in the network, the Ditian algorithm is introduced and initialized. The computation structure is reconstructed through adaptive adjustment, and the discrimination of redundant nodes is optimized. Meanwhile, the cluster topology is added to wireless sensor networks to control network nodes and complete the information transmission process. The experimental results showed that the improved Ditian had an average remaining energy of 3.6J after 600 runs. In the validation set, the energy efficiency of the algorithm was further improved, with an average remaining energy of 1.92J and a standard deviation of 0.51J. When the RMSE threshold was 0.8, the network lifetime reached 11 minutes, and the running time was significantly better than comparison algorithms. Furthermore, in the simulation experiment verification, the working state nodes of the proposed hybrid algorithm accounted for 1/5 of the total nodes, and the lifespan of the regional network could reach 1098 seconds, with a duration better than common algorithms. The above results indicate that the algorithm constructed in the study can effectively improve energy utilization, expand the application of wireless sensing technology in multiple fields, and provide new solutions for the efficient operation of wireless sensor networks. © 2013 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

A new edge weight-based measure for k-shell influential node identification in complex networks

引用

International Journal of security and Networks 2024年第1期19卷 1-9页

作者： Xiong, Yang Cheng, Yang School of Cyberspace Security Changzhou College of Information Technology Changzhou213164 China School of Computer and Information Engineering Changzhou Institute of Technology Changzhou213002 China College of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications Nanjing210003 China

There are mainly two problems with traditional k-shell centrality in complex networks. First, the traditional k-shell centrality divides many nodes into the same shell layer, which cannot accurately distinguish the propagation ability of nodes. Secondly, the network's local attributes and global perspective cannot be effectively combined into the k-shell centrality, and most of the methods ignore the role of edge weight. Because of these problems, a new edge weight is introduced based on traditional k-shell centrality. The edge weight between any two nodes is defined from the local degree centrality and the global k-shell centrality. From the dynamics of information propagation, a new edge weight-based measure for k-shell centrality is put forward. The simulation results indicate that this improved centrality based on edge weight is good at ranking the key nodes in a complex network, and the influential spreaders identified by this method can obtain better performance in the susceptible-infected (SI) model and susceptible-infected-recovered (SIR) model of infectious diseases. © 2024 Inderscience Enterprises Ltd.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Risk Evaluation Model for Data Center security Risk Assessment 10

Comprehensive Risk Evaluation Model for Data Center Security...

引用

10th International Conference on Wireless and Telematics, ICWT 2024

作者： Hussaini, Sayed Shoaib Raharjo, Budi Institute of Technology Bandung Management Engineering and Information Security Bandung Indonesia

ISBN: (纸本)9798350377057

Data centers play a crucial role in modern organizations by storing and processing large volumes of sensitive information. However, the evolving threat landscape and the increasing sophistication of cyberattacks pose significant security challenges to data centers. To ensure the integrity and availability of critical data, this research endeavors to address this pressing need by proposing a cutting-edge Comprehensive Risk Evaluation Model (CREM). By systematically assessing and mitigating the various dimensions of risk associated with data centers, CREM aims to redefines risk assessment through its dynamic, iterative framework, where ongoing recursive loops constantly find threats, examine events, and assess vulnerabilities. The study involves a comprehensive literature review, basic related concepts, methodology and development of risk evaluation model architecture that addresses the identified gaps. The model incorporates modules for threat source identification, threat event analysis, risk assessment, vulnerability scanning, risk impact analysis, threat level identification and control evaluation process. This research aims to enhance security practices, enabling proactive risk identification and mitigation. The findings contribute to the field of data center security and offer practical guidelines for improving security posture. © 2024 IEEE.

关键词： Data centers

来源：评论

学校读者我要写书评

暂无评论

Spectrum fragmentation-aware dynamic network slicing deployment in computing power networks based on elastic optical networks

引用

Journal of Optical Communications 2025年第2期46卷 335-346页

作者： Wang, Laiming Zhang, Haojie Li, Lei Ren, Danping Hu, Jinhua Zhao, Jijun School of Information and Electrical Engineering Hebei University of Engineering Handan056038 China Hebei Key Laboratory of Security and Protection Information Sensing and Processing Handan056038 China Beijing KELIBANG Information Technology Corporation Limited Beijing10081 China

The widespread application of AI with high computing requirements has driven the rapid development of the computing field. Computing Power Networks (CPNs) have been recognized as solutions to providing on-demand computing services, and its service provisioning can be modeled as a network slicing deployment problem. Elastic Optical Networks (EONs) offer the flexibility to allocate spectrum resources, making them well-suited for network slicing technology. Consequently, EON-based CPNs have attracted considerable attention. However, the unbalanced distribution of computing resources leads to inefficient computing resource utilization. Meanwhile, spectrum resources may be isolated and difficult for other services. This phenomenon is known as spectrum fragmentation, leading to inefficient spectrum resource utilization. To achieve balanced and efficient resource utilization, this paper first analyzes the main reasons for load unbalance and spectrum fragmentation in CPNs: mismatched slicing deployment and inappropriate resource scheduling. Therefore, a dynamic network slicing scheme based on traffic prediction (DNS-TP) is designed. Its core highlight is cooperative optimization slicing deployment and resource scheduling based on spectrum fragmentation awareness. Simulation results show that the proposed scheme enhances the network slicing acceptance ratio, computing and spectrum resource utilization while exhibiting strong performance in resource balancing. © 2024 Walter de Gruyter GmbH, Berlin/Boston.

关键词： Fiber optic networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：