{"title":"Implementation and evaluation of low-speed speech compression LPC and MELP algorithms","authors":"Dương Phúc Phần, Chu Thi Ngoc Quynh, Nguyen Thanh Ngoc","doi":"10.54654/isj.v1i18.940","DOIUrl":"https://doi.org/10.54654/isj.v1i18.940","url":null,"abstract":"Abstract— Currently, the design of a speech signal compression module that responds to low speed but still ensures signal quality for communication devices is a topic of interest for research. LPC (Linear Prediction Coding) and MELP (Mixed-Excitation Linear Prediction), two common approaches, are extensively researched and used, particularly in the vocoder of radio communication equipment like HF or VHF equipment. Implementing security solutions for these devices are challenging due to the crucial role played by the vocoder in signal processing prior to encryption. The paper first analyzes the two algorithms LPC and MELP and implements them on the current popular hardware technologies ARM and DSP to give an evaluation direction when choosing technology to serve the design of vocoders. There are many different methods of speech quality assessment in this paper, the PESQ method according to the ITU-T P862 standard was used to evaluate the results of the implementation of the proposed algorithms. The results show that the quality of the compression rate reduction of about 2 kbps is still satisfactory, and dedicated DSP technology for better speech quality results is a basis for helping vocoder device developers choose the right hardware technology when designing products.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124378240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluating the Efficiency of Vietnamese SMS Spam Detection Techniques","authors":"Vu Minh Tuan, Nguyen Xuan Thang, T. Q. Anh","doi":"10.54654/isj.v1i18.932","DOIUrl":"https://doi.org/10.54654/isj.v1i18.932","url":null,"abstract":"Abstract— This paper is aimed at evaluating the efficiency of Vietnamese SMS spam detection methods on different variants of Vietnamese datasets by utilizing both traditional machine learning models and deep learning models. The researchers experimented with five algorithms, which were Support Vector Machine (SVM), Naive Bayes (NB), Random Forests (RF), Convolutional Neural Network (CNN), and Long Short-Term Memory (LSTM), on three different Vietnamese datasets. The findings reveal that the LSTM and CNN, supported by a transformer learning model - PhoBert, were more efficient than the traditional machine learning models. The LSTM model showed the highest accuracy of 97,77% when operating on the full-accent Vietnamese dataset. Similarly, the CNN model and PhoBert model showed the highest accuracy of 95,56% when dealing with non-diacritic Vietnamese dataset.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114657196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Triệu Quang Phong, Đỗ Đại Chí, Trần Đức Huy, Nguyễn Ngọc Điệp
{"title":"Xem xét một số vấn đề trên các lược đồ chữ ký số truyền thống","authors":"Triệu Quang Phong, Đỗ Đại Chí, Trần Đức Huy, Nguyễn Ngọc Điệp","doi":"10.54654/isj.v1i18.884","DOIUrl":"https://doi.org/10.54654/isj.v1i18.884","url":null,"abstract":"Tóm tắt— Trong bài báo này, nhóm tác giả sẽ xem xét 02 vấn đề trên các lược đồ chữ ký số truyền thống. Vấn đề đầu tiên sẽ liên quan đến các tấn công đa mục tiêu, vốn thường được xem xét trên họ các lược đồ chữ ký số dựa trên hàm băm như XMSS, HORST, FORST mà được đề xuất như các ứng viên cho mật mã hậu lượng tử. Bài báo sẽ chỉ ra ảnh hưởng của kiểu tấn công này lên các lược đồ chữ ký số đang được sử dụng phổ biến hiện nay như RSA, ECDSA và sau đó phân tích, đánh giá một số giải pháp ngăn chặn. Vấn đề còn lại được quan tâm trong bài báo sẽ liên quan đến yêu cầu về bước lặp trong các lược đồ chữ ký số dựa trên bài toán logarit rời rạc như ECDSA. Ở đó, nhóm tác giả sẽ đề xuất một số bước kiểm tra và lặp lại tính toán trong thuật toán ký để tránh việc lộ lọt thông tin liên quan đến khóa ký một cách dễ dàng.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117128034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A method of generating mutated Windows malware to evade ensemble learning","authors":"V. Pham, T. To, Phan The Duy","doi":"10.54654/isj.v1i18.906","DOIUrl":"https://doi.org/10.54654/isj.v1i18.906","url":null,"abstract":"Tóm tắt— Thời gian gần đây, việc ứng dụng học máy vào lĩnh vực an ninh mạng, đặc biệt là trong phát hiện và ngăn chặn mã độc được chú trọng và quan tâm sâu sắc. Nhiều công trình nghiên cứu về phân tích phần mềm độc hại đã được đề xuất với những kết quả hứa hẹn cho các ứng dụng thực tế. Trong những công trình như vậy, việc sử dụng mạng sinh đối kháng (Generative Adversarial Networks) hoặc học tăng cường (Reinforcement Learning) có thể giúp các kẻ xấu tạo ra phần mềm độc hại đột biến trốn tránh các phần mềm chống vi-rút. Trong nghiên cứu này, chúng tôi đề xuất một hệ thống đột biến chống lại các trình phát hiện mã độc dựa trên học tổng hợp bằng cách sử dụng kết hợp mô hình mạng sinh đối kháng và học tăng cường để khắc phục hạn chế của mô hình MalGAN. Cụ thể, chúng tôi phát triển mô hình FeaGAN, mô hình dựa trên MalGAN, bằng cách kết hợp mô hình với mô hình học tăng cường DQEAF (Deep Q-network anti-malware Engines Attacking Framework). Ngoài ra, mô hình FeaGAN sử dụng mô hình học tổng hợp cho trình phát hiện phần mềm độc hại để cải thiện khả năng trốn tránh của các mẫu đối kháng được tạo ra. Kết quả thực nghiệm cho thấy 100% mẫu đột biến được chọn đều đảm bảo định dạng. Ngoài ra, khả năng đảm bảo khả năng thực thi của các biến thể mã độc đạt được những kết quả tiềm năng với tỷ lệ thành công đạt mức ổn định.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114191693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Network attack classification framework based on Autoencoder model and online stream analysis technology","authors":"Nguyen Viet Hung, Đang Thi Mai, Ngo Thanh Tung","doi":"10.54654/isj.v1i18.938","DOIUrl":"https://doi.org/10.54654/isj.v1i18.938","url":null,"abstract":"Abstract— To deal with diverse and constantly changing forms of cyberattacks, machine learning methods have been researched and applied extensively in network data processing for positive results in network attack detection. However, machine learning models require extensive computational resources and their application to handle significant real-time data flow monitoring problems still needs improvement. In this paper, we research and propose a network attack detection framework using a 2-stage classification algorithm with an Autoencoder model, integrating online stream processing technology based on Apache Kafka and Spark technology. The results show that the proposed framework has high efficiency in detecting network attacks and faster processing time than traditional data processing technology.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127736425","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient multiplication of a vector by a matrix MDS","authors":"Pablo Freyre Arrozarena, E. D. Fiallo","doi":"10.54654/isj.v3i17.888","DOIUrl":"https://doi.org/10.54654/isj.v3i17.888","url":null,"abstract":"Abstract— An algorithm is proposed for the efficient multiplication of a vector by an n x n MDS matrix defined on Fq or by its inverse. The algorithm is based on the multiplication of two polynomials modulo a polynomial of degree n Reed-Solomon code generator and has complexity O(nlog2log2(nlog2q)).\u0000The algorithm only needs to store n values of the Fq field for the multiplication of a vector by an n x n MDS matrix and 2n values for the multiplication of the vector by the inverse matrix.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131106507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alejandro Freyre Echevarría, Ramses Rodríguez Aulet, Alejandro García Gómez
{"title":"On some relations of SCA-related properties of S-box under the Hamming weight leakage mode","authors":"Alejandro Freyre Echevarría, Ramses Rodríguez Aulet, Alejandro García Gómez","doi":"10.54654/isj.v2i17.902","DOIUrl":"https://doi.org/10.54654/isj.v2i17.902","url":null,"abstract":"Abstract— Physical implementations of cryptographic algorithms are vulnerable to so-called side-channel attacks, in which sensitive information can be recovered through the analysis of the leakages produced by the operating device. In the particular case of block ciphers, substitution boxes are often the target of such attacks, as they are the main nonlinear component of the cipher. Literature survey contains some definitions of theoretical properties to measure the resistance provided by substitution boxes with respect to the imminent threat of side-channel attacks. The fundamental questions we board in this paper are: are all these properties related? And if so, what can we tell of their relation? We pretend to bring some clarification to this subject using some well-known side-channel related properties of S-box.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131050549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tong Anh Tuan, Nguyen Ngoc Cuong, Nguyen Viet Anh, Hoang Viet Long
{"title":"Proposing the application of a deep learning model to detect the malicious IP address of botnet in the computer network","authors":"Tong Anh Tuan, Nguyen Ngoc Cuong, Nguyen Viet Anh, Hoang Viet Long","doi":"10.54654/isj.v3i17.894","DOIUrl":"https://doi.org/10.54654/isj.v3i17.894","url":null,"abstract":"Abstract— Malware in general and botnets in particular are big threats to cybersecurity. They have many sophisticated methods to bypass security systems to infect computers and perform attacks, sabotage, or spying activities. Botnet detection solutions are always focused on and solved by scientists and cybersecurity specialists. The DGA botnet is a group of common botnet families that share the same mechanism of needing to connect back to the C&C server via DNS to receive commands to operate. Many studies that propose algorithms for detecting and classifying DGA botnets have been proposed and tested with high results. In this study, we approach by using the above solutions to detect malicious IP addresses and botnet malware families. First, we evaluate the efficiency of two deep learning models LA_Bin07 and LA_Mul07 on a new specialized dataset, UTL_DGA22. Next, we extended the experiment with the ISCX-Bot-2014 dataset. The results show that LA_Bin07 and LA_Mul07 models both get high accuracy on the new dataset, with 0.98 and 0.86 correspondingly. Experimenting on the reality dataset also gives positive results, helping network administrators to localize malicious IP addresses for deeper investigation. The proposed solution is effective enough to be applied as a module in cybersecurity solutions such as firewalls, intrusion detection, and prevention systems or unified thread management - UTM.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121321941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Automated Test Data Generation for Embedded System Models Using Combinatorial Testing","authors":"Do Thi Bich Ngoc","doi":"10.54654/isj.v3i17.890","DOIUrl":"https://doi.org/10.54654/isj.v3i17.890","url":null,"abstract":"Abstract— Embedded systems have been playing very important roles in modern society. They have appeared in every aspect of life from automotive to avionics industries to home appliances, etc. These embedded systems therefore must satisfy high quality requirements. As a consequence, quality assurance for these kinds of systems has attracted much attention and investment from both academic research and industry communities. In developing embedded systems, testing often requires high coverage with different measures with respect to international standards like Decision Coverage (DC), Condition Coverage (CC), Modified Condition/Decision Coverage (MC/DC) respected to ISO 26262. However, it is difficult to generate test cases with high coverage due to the complexity of the embedded system, the larger number of inputs, and the complex continuous signals of inputs.\u0000In order to have good test cases with high DC, CC, MC/DC coverage measures, this paper proposes a method to automatically generate test-cases by applying Combinatorial testing technique. The requirements of the inputs of the embedded model will be encoded to the input of Combinatorial testing technique in order to generate test cases that cover all pair values of any two inputs. Experiments on case studies showed that proposed method has coverage result better than that of the random testing method.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125691711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pablo Freyre Arrozarena, Adrián Alfonso Peñate, Alejandro Freyre Echevarría, Ramses Rodríguez Aulet
{"title":"A new look in the representation of AES like S-box","authors":"Pablo Freyre Arrozarena, Adrián Alfonso Peñate, Alejandro Freyre Echevarría, Ramses Rodríguez Aulet","doi":"10.54654/isj.v3i17.900","DOIUrl":"https://doi.org/10.54654/isj.v3i17.900","url":null,"abstract":"Abstract— Substitution box plays an essential role in block ciphers as their main non-linear component in the round function, providing confusion. In this paper, it will be proven how the action of any substitution box on every fixed element can be represented through an affine transformation using an invertible matrix in a finite field. Furthermore, a particular way to represent the action of permutations on every element through a modular addition is given. An analysis of the AES substitution box is conducted based on the theoretical results obtained.","PeriodicalId":329633,"journal":{"name":"Journal of Science and Technology on Information security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134004689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}