20
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A block cipher algorithm identification scheme based on hybrid k-nearest neighbor and random forest algorithm

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Cryptographic algorithm identification, which refers to analyzing and identifying the encryption algorithm used in cryptographic system, is of great significance to cryptanalysis. In order to improve the accuracy of identification work, this article proposes a new ensemble learning-based model named hybrid k-nearest neighbor and random forest (HKNNRF), and constructs a block cipher algorithm identification scheme. In the ciphertext-only scenario, we use NIST randomness test methods to extract ciphertext features, and carry out binary-classification and five-classification experiments on the block cipher algorithms using proposed scheme. Experiments show that when the ciphertext size and other experimental conditions are the same, compared with the baselines, the HKNNRF model has higher classification accuracy. Specifically, the average binary-classification identification accuracy of HKNNRF is 69.5%, which is 13%, 12.5%, and 10% higher than the single-layer support vector machine (SVM), k-nearest neighbor (KNN), and random forest (RF) respectively. The five-classification identification accuracy can reach 34%, which is higher than the 21% accuracy of KNN, the 22% accuracy of RF and the 23% accuracy of SVM respectively under the same experimental conditions.

          Related collections

          Most cited references22

          • Record: found
          • Abstract: not found
          • Article: not found

          African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Artificial gorilla troops optimizer: A new nature‐inspired metaheuristic algorithm for global optimization problems

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A modified farmland fertility algorithm for solving constrained engineering problems

                Bookmark

                Author and article information

                Contributors
                Journal
                PeerJ Comput Sci
                PeerJ Comput Sci
                peerj-cs
                PeerJ Computer Science
                PeerJ Inc. (San Diego, USA )
                2376-5992
                10 October 2022
                2022
                : 8
                : e1110
                Affiliations
                [1 ]School of Computer and Information Engineering, Henan University , Kaifeng, Henan, China
                [2 ]Henan Key Laboratory of Big Data Analysis and Processing, Henan University , Kaifeng, Henan, China
                [3 ]International Education College, Henan University , Zhengzhou, Henan, China
                [4 ]College of Cybersecurity, Nankai University , Tianjin, Tianjin, China
                [5 ]School of Data Science, Tongren University , Tongren, Guizhou, China
                Article
                cs-1110
                10.7717/peerj-cs.1110
                9575859
                36262148
                0d07a85b-efce-4568-8024-c80e5c1ebcb2
                © 2022 Yuan et al.

                This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited.

                History
                : 11 May 2022
                : 29 August 2022
                Funding
                Funded by: The National Natural Science Foundation of China
                Award ID: 61972073, 61972215, 62066040
                Funded by: The Natural Science Foundation of Tianjin
                Award ID: 20JCZDJC00640
                Funded by: The Key Specialized Research and Development Program of Henan Province
                Award ID: 222102210062
                Funded by: The Basic Higher Educational Key Scientific Research Program of Henan Province
                Award ID: 22A413004
                Funded by: The National Innovation Training Program of University Student
                Award ID: 202110475072
                This work was supported by the National Natural Science Foundation of China (61972073, 61972215, 62066040); the Natural Science Foundation of Tianjin (20JCZDJC00640); the Key Specialized Research and Development Program of Henan Province (222102210062); the Basic Higher Educational Key Scientific Research Program of Henan Province (22A413004); and the National Innovation Training Program of University Student (202110475072). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
                Categories
                Artificial Intelligence
                Cryptography
                Data Mining and Machine Learning

                cryptographic algorithm identification,machine learning,randomness test,random forest algorithm,k-nearest neighbor algorithm

                Comments

                Comment on this article