Block Cipher Algorithms Identification Scheme Based on KFDA
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 14870 LNCS, Page: 13-24
2024
- 4Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Captures4
- Readers4
Conference Paper Description
Cryptanalysis requires the identification of cryptographic algorithms, yet in practice, analysts often lack a clear understanding of the algorithms used, leading to ineffective analysis. This paper takes block cipher algorithm as the research object. According to different block cipher algorithms employ dis-tinct structures, cryptographic components, parameters, and key expansion methods, resulting in variations in the distribution of Hamming weights of ciphertexts generated by different algorithms. This paper proposes a Hamming weight-based ciphertext feature extraction method. Employing the dimensionality reduction mapping method with Gaussian kernel to process ciphertext feature data, we propose a block cipher algorithm identification scheme based on Kernel Fisher Discriminant Analysis (KFDA) and Random Forest. Eight block ciphers including AES, DES, SM4, etc. were selected as the experimental objects. In fixed and random key, a total of 144,000 encrypted ciphertext files of eight block cipher algorithms were constructed for algorithm identification. Experimental results demonstrate that compared to existing research, the cryptographic algorithm identification scheme proposed in this paper exhibits higher performance in binary classification and eight-class classification. In fixed key, the binary classification accuracy of block cipher algorithm is about 88%, and the eight-classification accuracy is about 48%, which is 8% and 10% higher than the average accuracy of existing research. In the random key, the accuracy of binary classification is about 72%, and the accuracy of eight classification is about 41%, Compared with the average accuracy of the existing research, the accuracy is increased by 5% and 18% respectively.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85201065308&origin=inward; http://dx.doi.org/10.1007/978-981-97-5606-3_2; https://link.springer.com/10.1007/978-981-97-5606-3_2; https://dx.doi.org/10.1007/978-981-97-5606-3_2; https://link.springer.com/chapter/10.1007/978-981-97-5606-3_2
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know