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. I...
详细信息
It is a key issue to reasonably represent human travel and social contact in epidemic models. Various measures were applied to develop the models of human mobility and contact in a long range or a short range, such as...
详细信息
Let H0 denote the set of all sense-preserving harmonic mappings f = h + g in the unit disk D, normalized with h(0) = g(0) = g′(0) = 0 and h′(0) = 1. In this paper, we investigate some properties of certain subclasse...
详细信息
An improved algorithm based on the hybrid query tree (HQT) algorithm is proposed in this work. Tags are categorized according to the combined information of the highest bit of collision and second-highest bit of colli...
详细信息
Borrowing the power of deep neural networks, deep reinforcement learning achieved big success in games, and it becomes a popular method to solve the sequential decision-making problems. However, the success is still r...
详细信息
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 ...
详细信息
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.
Semantic Communication (SC) has emerged as a novel communication paradigm in recent years, successfully transcending the Shannon physical capacity limits through innovative semantic transmission concepts. Nevertheless...
详细信息
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 train...
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.
Label distribution learning techniques can significantly enhance the effectiveness of side-channel analysis. However, this method relies on using probability density functions to estimate the relationships between lab...
详细信息
暂无评论