Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Min Gu 0004

dblp:82/1157-4 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-1537-1758ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › convolutional neural network › convolutional neural network architecture
2D CNN
0.812024
MA-DG: Learning Features of Sequences in Different Dimensions for Min-Entropy Evaluation via 2D-CNN and Multi-Head Self-Attention · IEEE Trans. Inf. Forensics Secur. 2024
Machine learning › Deep learning architectures and training
convolutional neural network
0.812024
MA-DG: Learning Features of Sequences in Different Dimensions for Min-Entropy Evaluation via 2D-CNN and Multi-Head Self-Attention · IEEE Trans. Inf. Forensics Secur. 2024
Cryptographic primitives and cryptanalysis › random number generation › entropy estimation
min-entropy estimation
0.812024
MA-DG: Learning Features of Sequences in Different Dimensions for Min-Entropy Evaluation via 2D-CNN and Multi-Head Self-Attention · IEEE Trans. Inf. Forensics Secur. 2024
Cryptographic primitives and cryptanalysis
random number generation
0.812024
MA-DG: Learning Features of Sequences in Different Dimensions for Min-Entropy Evaluation via 2D-CNN and Multi-Head Self-Attention · IEEE Trans. Inf. Forensics Secur. 2024

Methods — techniques the papers use, named apart from their topics

multi-head self-attention · 1.5gramian angular field · 1.5discrete fourier transform · 1.5
YearPublicationVenuePosition
2024 MA-DG: Learning Features of Sequences in Different Dimensions for Min-Entropy Evaluation via 2D-CNN and Multi-Head Self-Attention
abstract
In information security, random number quality is closely related to cryptographic system security; moreover, random number quality depends on the corresponding entropy source quality. Therefore, evaluating the entropy source quality is extremely important. For existing evaluation methods, the ability of statistical-based entropy estimators to extract and learn data information is weak, resulting in lower entropy evaluation accuracies for some complex entropy sources. The prediction-based (especially neural network-based) entropy estimators with machine learning techniques have strong data-fitting and feature-extracting capabilities and can more accurately estimate the entropy values of complex entropy sources. However, owing to the relatively simple architecture of 1D neural networks, the 1D neural networks used by these estimators frequently reach bottlenecks, seriously limiting the further improvement in entropy estimation accuracy. Considering the above issues, this paper innovatively proposes an entropy estimation method based on a 2D-CNN and a multi-head self-attention mechanism. First, we built the MA-DG Net model. This model converts 1D random number sequences into 2D images via the GAF and DFT methods and then uses a 2D-CNN to extract and learn feature information from 2D images while retaining the original 1D sequential feature information via a multi-head self-attention mechanism. Next, we train the model to find its optimal parameters. Finally, we test the evaluation effect of the model using simulated datasets with known min-entropy and a real-world dataset with unknown min-entropy. The results show that compared with the entropy estimators in the experiment, our model achieves the lowest average relative error in entropy estimation on the simulated dataset of only 1.03%. In the real-world dataset, our model achieves the lowest entropy estimation value, which is an average of 0.88 lower than that of the other entropy estimators in the experiment.
Yilong Huang, Chaofeng Huang, Haomiao Yang, Min Gu 0004
IEEE Trans. Inf. Forensics Secur.5