activity
20132021
most citedTowards Strengthening Deep Learning-based Side Channel Attacks with Mixup

16 citations · 44 across the 11 of their papers we have counts for

collaborators

11 papers

cs.CR2021★ 2 cited

A Fast-Detection and Fault-Correction Algorithm against Persistent Fault Attack

Yukun Cheng, Mengce Zheng, Fan Huang +3

Persistent Fault Attack (PFA) is a recently proposed Fault Attack (FA) method in CHES 2018. It is able to recover full AES secret key in the Single-Byte-Fault scenario. It is demon…

cs.CR2021★ 16 cited

Towards Strengthening Deep Learning-based Side Channel Attacks with Mixup

Zhimin Luo, Mengce Zheng, Ping Wang +3

In recent years, various deep learning techniques have been exploited in side channel attacks, with the anticipation of obtaining more appreciable attack results. Most of them conc…

cs.IT2021

Two Problems about Monomial Bent Functions

Honggang Hu, Bei Wang, Xianhong Xie +1

In 2008, Langevin and Leander determined the dual function of three classes of monomial bent functions with the help of Stickelberger's theorem: Dillon, Gold and Kasami. In their p…

cs.CR2020★ 3 cited

Adversarial Attack Based Countermeasures against Deep Learning Side-Channel Attacks

Ruizhe Gu, Ping Wang, Mengce Zheng +2

Numerous previous works have studied deep learning algorithms applied in the context of side-channel attacks, which demonstrated the ability to perform successful key recoveries. T…

cs.CR2020★ 13 cited

An Enhanced Convolutional Neural Network in Side-Channel Attacks and Its Visualization

Minhui Jin, Mengce Zheng, Honggang Hu +1

In recent years, the convolutional neural networks (CNNs) have received a lot of interest in the side-channel community. The previous work has shown that CNNs have the potential of…

cs.CR2020★ 9 cited

Enhancing the Performance of Practical Profiling Side-Channel Attacks Using Conditional Generative Adversarial Networks

Ping Wang, Ping Chen, Zhimin Luo +4

Recently, many profiling side-channel attacks based on Machine Learning and Deep Learning have been proposed. Most of them focus on reducing the number of traces required for succe…

cs.IT2019

Construction of three classes of Strictly Optimal Frequency-Hopping Sequence Sets

Yi Ouyang, Xianhong Xie, Honggang Hu +1

In this paper, we construct three classes of strictly optimal frequency-hopping sequence (FHS) sets with respect to partial Hamming correlation and family size. The first class is…

cs.IT2017

New Classes of Ternary Bent Functions from the Coulter-Matthews Bent Functions

Honggang Hu, Xiaolong Yang, Shaohua Tang

It has been an active research issue for many years to construct new bent functions. For odd with , and , the function $f(x)=Tr(ax^{\fra…

cs.IT2016

On the Dual of the Coulter-Matthews Bent Functions

Honggang Hu, Qingsheng Zhang, Shuai Shao

For any bent function, it is very interesting to determine its dual function because the dual function is also bent in certain cases. For odd and , it is known th…

cs.IT2014

Comments on "A New Method to Compute the 2-Adic Complexity of Binary Sequences"

Honggang Hu

We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by…

cs.IT2013★ 1 cited

The Proof of Lin's Conjecture via the Decimation-Hadamard Transform

Honggang Hu, Shuai Shao, Guang Gong +1

In 1998, Lin presented a conjecture on a class of ternary sequences with ideal 2-level autocorrelation in his Ph.D thesis. Those sequences have a very simple structure, i.e., their…