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

8th International Conference on Computer Engineering and Networks, CENet 2018

作者： Jiao, Ge Li, Lang Zou, Yi College of Computer Science and Technology Hengyang Normal University HengyangHunan421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application HengyangHunan421002 China

ISBN: (纸本)9783030146795

In order to against the side channel analysis attack such as power, electromagnetic waves, and time attack, an optimized masking method is proposed for Advanced Encryption Standard (AES) algorithm in this paper. This scheme adopts random hamming distance mask and offset randomization strategy in the first two rounds, the last round and two rounds randomly selected in the middle of the AES algorithm to ensure the security of each intermediate value. The scheme then adopts fixed-value mask strategy in the five rounds in the middle, which can reduce the time and space consumption to recalculate S box, improve the efficiency of the algorithm and reduce the production cost. To compare with other defence methods, we build a power analysis platform and conduct extensive experiments. The experimental results show that our optimized AES masking method is more secure than the compared methods, and it is able to resist second-order correlation power analysis (CPA) attacks. © Springer Nature Switzerland AG 2020.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

A Reconstruction Method for Cross-Cut Shredded Documents Based on the Extreme Learning Machine Algorithm

Research Square

引用

Research Square 2022年

作者： Zhang, Zhenghui Zou, Juan Zheng, Jinhua Yang, Shengxiang Gong, Dunwei Pei, Tingrui Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Hunan Xiangtan411105 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Information Engineering College of Xiangtan University Hunan Xiangtan411105 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom School of Information and Electronic Engineering China University of Mining and Technology Xuzhou221116 China

Reconstruction of cross-cut shredded text documents (RCCSTD) has important applications for information security and judicial evidence collection. The traditional method of manual construction is a very time-consuming task, so the use of computer-assisted efficient reconstruction is a crucial research topic. Fragment consensus information extraction and fragment pair compatibility measurement are two fundamental processes in RCCSTD. Due to the limitations of the existing classical methods of these two steps, only documents with specific structures or characteristics can be spliced, and pairing error is larger when the cutting is more fine-grained. In order to reconstruct the fragments more effectively, this paper improves the extraction method for consensus information and constructs a new global pairwise compatibility measurement model based on the extreme learning machine algorithm. The purpose of the algorithm’s design is to exploit all available information and computationally suggest matches to increase the algorithm’s ability to discriminate between data in various complex situations, then find the best neighbor of each fragment for splicing according to pairwise compatibility. The overall performance of our approach in several practical experiments is illustrated. The results indicate that the matching accuracy of the proposed algorithm is better than that of the previously published classical algorithms and still ensures a higher matching accuracy in the noisy datasets, which can provide a feasible method for RCCSTD intelligent systems in real scenarios. © 2022, CC BY.

关键词： Knowledge acquisition

来源：评论

学校读者我要写书评

暂无评论

Exploring how hydrogen at gold-sulfur interface affects spin transport in single-molecule junction

引用

Chinese Physics B 2020年第8期29卷 525-530页

作者： Jing Zeng Ke-Qiu Chen Yanhong Zhou College of Physics and Electronic Engineering Hengyang Normal UniversityHengyang 421002China Department of Applied Physics School of Physics and ElectronicsHunan UniversityChangsha 410082China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang 421002China College of Science East China Jiao Tong UniversityNanchang 330013China

Very recently,experimental evidence showed that the hydrogen is retained in dithiol-terminated single-molecule junction under the widely adopted preparation conditions,which is in contrast to the accepted view[***.11351(2019)].However,the hydrogen is generally assumed to be lost in the previous physical models of single-molecule *** the retention of the hydrogen at the gold-sulfur interface exerts a significant effect on the theoretical prediction of spin transport properties is an open ***,here in this paper we carry out a comparative study of spin transport in M-tetraphenylporphyrin-based(M=V,Cr,Mn,Fe,and Co;M-TPP)single-molecule junction through Au-SR and Au-S(H)R *** results show that the hydrogen at the gold-sulfur interface may dramatically affect the spin-filtering efficiency of M-TPP-based single-molecule junction,depending on the type of transition metal ions embedded into porphyrin ***,we find that for the Co-TPP-based molecular junction,the hydrogen at the gold-sulfur interface has no obvious effect on transmission at the Fermi level,but it has a significant effect on the spin-dependent transmission dip induced by the quantum interference on the occupied *** the fate of hydrogen should be concerned in the physical model according to the actual preparation condition,which is important for our fundamental understanding of spin transport in the single-molecule *** work also provides guidance in how to experimentally identify the nature of gold-sulfur interface in the single-molecule junction with spin-polarized transport.

关键词： transport properties molecular electronic devices gold-sulfur interface density-functional theory nonequilibrium Green’s functions

来源：评论

学校读者我要写书评

暂无评论

Decomposed Neural Architecture Search for image denoising

引用

Applied Soft Computing 2022年 124卷

作者： Li, Di Bai, Yunpeng Bai, Zongwen Li, Ying Shang, Changjing Shen, Qiang School of Computer Science National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Shaanxi Provincial Key Laboratory of Speech & Image Information Processing Northwestern Polytechnical University Xi'an710129 China Department of Computer Science Faculty of Business and Physical Sciences Aberystwyth University AberystwythSY233DB United Kingdom Shaanxi Key Laboratory of Intelligent Processing for Big Energy Data School of Physics and Electronic Information Yan'an University Yan'an716000 China

In practical applications of deep learning, as the demand for the modeling capability increases, the network size may need to be massively enlarged in response. This may form a significant challenge in practice, especially when facing the dilemma of limited computational resources, making model compression indispensable. It can be time-consuming and interminable to obtain an appropriate network architecture through manual compression. In this paper, we propose an automated method for searching decomposed network architectures, named DNAS (standing for Decomposed Neural Architecture Search). It integrates both tasks of neural architecture search and tensor decomposition based model compression within a unified framework. The method is able to efficiently find a compact network with high performance for image denoising, with respect to memory and runtime. Particularly, using one single V100 GPU, it only takes about 1.5 h to obtain a denoising network on the BSD500 dataset. Experimental results demonstrate that compared with models developed using existing methods, DNAS consumes significantly less inference time and employs much fewer trainable parameters, outperforming existing approaches on both synthetic and real-world denoising datasets. © 2022 Elsevier B.V.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Constructions of Lightweight MDS Diffusion Layers from Hankel Matrices

Constructions of Lightweight MDS Diffusion Layers from Hanke...

引用

作者： Qiuping Li Lang Li Jian Zhang Junxia Zhao Kangman Li Hengyang Normal University Hunan Provincial Key Laboratory of Intelligent Information Processing and Application

Maximal Distance Separable（MDS） matrices are used as optimal diffusion layers in many block ciphers and hash ***,the designers paid more attentions to the lightweight MDS matrices because it can reduce the hardware *** this paper,we give a new method to construct the lightweight MDS *** provide some theoretical results and two kinds of 4 x4 lightweight Hankel MDS *** also prove that the 2～8 x 2～8 involution Hankel MDS matrix is not exist in finite ***,we searched the 4 x4 Hankel MDS matrices over GL（4,F） and GL（8,F） that have the better s-XOR counts until now.

关键词： Diffusion Layer Lightweight MDS Matrix Hankel Matrix

来源：评论

学校读者我要写书评

暂无评论

A many-objective evolutionary algorithm based on rotation and decomposition

引用

Swarm and Evolutionary Computation 2021年 60卷

作者： Zou, Juan Liu, Jing Yang, Shengxiang Zheng, Jinhua Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University XiangtanHunan411105 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Information Engineering College of Xiangtan University XiangtanHunan411105 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Evolutionary algorithms have shown their promise in addressing multiobjective problems (MOPs). However, the Pareto dominance used in multiobjective optimization loses its effectiveness when addressing many-objective problems (MaOPs), which are defined as having more than three objectives. This is because the Pareto dominance loses its ability to distinguish between individuals. In this paper, a many-objective evolutionary algorithm based on rotation and decomposition is proposed (MaOEA-RD) to overcome the shortcoming of insufficient selection pressure caused by the Pareto dominance. First, the coordinates system is rotated and a hyperplane is established to distinguish between the nondominated individuals. Then, a novel individual selection mechanism incorporating decomposition is adopted to maintain the diversity of the population. In order to compensate for the deficiency of the predefined reference vectors, a reference vector adjustment mechanism is proposed. Experimental studies on several well-known benchmark problems show that the proposed algorithm is competitive compared with nine state-of-the-art many-objective algorithms. © 2020 Elsevier B.V.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Differential Power Analysis of Lightweight Block Cipher LED

Research on Differential Power Analysis of Lightweight Block...

引用

作者： Yi Zou Lang Li Hui-huang Zhao Ge Jiao College of Computer Science and Technology Hengyang Normal University Human Provincial Key Laboratory of Intelligent Information Processing and Application

LED algorithm is a new lightweight encryption algorithm proposed in CHES 2011, which is used for IOT to protect the communication security of RFID tags and smart cards. It has been found that it is possible to retrieve secret key of algorithm by appropriate analysis of the devices' s power consumption,and the differential power analysis is the most powerful attack. This paper proposed a method of differential power analysis on LED algorithm. Combined with hardware circuit, it designed and implemented differential power analysis of the LED encryption system. The experimental results show that method which is proposed in this paper was cracked the 64 bits key of LED. Thus,without protection, the cipher LED would be difficult to resist differential power analysis. and according this, We provide a general analysis method of differential power analysis on other lightweight cryptographic algorithms.

关键词： Lightweight block cipher Differential power analysis LED

来源：评论

学校读者我要写书评

暂无评论

Transfer learning-based few-shot sample deep learning-assisted template attacks

引用

Physical Communication 2025年 72卷

作者： Zhiying Feng Lang Li Yu Ou Lianrui Deng College of Computer Science and Technology Hengyang Normal University Hengyang 421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang Normal University Hengyang 421002 China

Deep learning-assisted template attack (DLATA) is a novel side-channel attack (SCA) method proposed by Lichao Wu at CHES2022. It utilizes a triplet network to assist template attacks (TA), avoiding the redundant training and hyperparameter tuning required in traditional DL-based SCA methods. However, the training of the triplet network requires a large number of power samples due to its unique structure. We propose a new optimization scheme, in which the transfer learning (TL) technology is used to train multiple models on several similar datasets with fewer power traces, to mitigation the problem. The approach allows us to leverage pre-trained models to product a new mode on the another target dataset by fine-tuning weights so that significantly reduce the training cost for the triplet network while maintaining attack effectiveness. We remould the structure and dimensionality of similar datasets so that the models trained on them can perform effective transfer learning for training on the target dataset. Concretely, some of parameters and features obtained from pretraining can be used directly for the target task, while the rest only require fine-tuning. Evaluation and experimental validation on the public ASCAD dataset demonstrate that our method achieves or even surpasses the performance of the original method with a 90% reduction in the training set. These findings highlight the effectiveness of the proposed TL strategy in achieving robust attack performance in low-sample training environments.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

CHARACTERIZATIONS OF COMPOSITION OPERATORS ON BLOCH AND HARDY TYPE SPACES

arXiv

引用

arXiv 2022年

作者： Chen, Shaolin Hamada, Hidetaka College of Mathematics and Statistics Hengyang Normal University Hunan Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application 421002 China Faculty of Science and Engineering Kyushu Sangyo University 3-1 Matsukadai 2-Chome Higashi-ku Fukuoka813-8503 Japan

The main purpose of this paper is to investigate characterizations of composition operators on Bloch and Hardy type spaces. Initially, we use general doubling weights to study the composition operators from harmonic Bloch type spaces on the unit disc ⅅ to pluriharmonic Hardy spaces on the Euclidean unit ball Bn. Furthermore, we develop some new methods to study the composition operators from harmonic Bloch type spaces on ⅅ to pluriharmonic Bloch type spaces on ⅅ. Additionally, some application to new characterizations of the composition operators between pluriharmonic Lipschitz type spaces to be bounded or compact will be presented. The obtained results of this paper provide the improvements and extensions of the corresponding known *** Codes 31C10, 47B33, 32A35, 30H30 Copyright © 2022, The Authors. All rights reserved.

关键词： Harmonic functions

来源：评论

学校读者我要写书评

暂无评论

On Riesz type inequalities, Hardy-Littlewood type theorems and smooth moduli

arXiv

引用

arXiv 2022年

The purpose of this paper is to develop some methods to study Riesz type inequalities, Hardy-Littlewood type theorems and smooth moduli of holomorphic, pluriharmonic and harmonic functions in high-dimensional cases. Initially, we prove some sharp Riesz type inequalities of pluriharmonic functions on bounded symmetric domains. The obtained results extend the main results in (Trans. Amer. Math. Soc. 372 (2019) 4031–4051). Furthermore, some Hardy-Littlewood type theorems of holomorphic and pluriharmonic functions on John domains are established. Additionally, we also discuss the Hardy-Littlewood type theorems and smooth moduli of holomorphic, pluriharmonic and harmonic functions. Consequently, we improve and generalize the corresponding results in (Acta Math. 178 (1997) 143–167) and (Adv. Math. 187 (2004) 146–172).MSC Codes Primary 42A50, 42B30, 46E15, 31B05, 31C10, 32U05 Copyright © 2022, The Authors. All rights reserved.

关键词： Harmonic functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：