G. Ramesh, Venkata Ashok K Gorantla, Venkataramaiah Gude
{"title":"A hybrid methodology with learning based approach for protecting systems from DDoS attacks","authors":"G. Ramesh, Venkata Ashok K Gorantla, Venkataramaiah Gude","doi":"10.47974/jdmsc-1747","DOIUrl":"https://doi.org/10.47974/jdmsc-1747","url":null,"abstract":"Distributed Denial of Service (DDoS) attacks still prevailing in Internet based and cloud based applications. To detect such attacks and mitigate their effect, many approaches came into existence. There are signature based methods, metrics based methods and machine learning (ML) based methods. With the availability of training data, ML based solutions, of late, became popular. However, there is need for evaluation of different ML models for real time usage in distributed applications. We proposed a ML based framework that has mechanisms, including feature selection, to have supervised learning for threat detection. The framework enables workflow required to pre-process data, select essential features, train ML classifiers and detect the DDoS attack and classify it. We also proposed an algorithm known as DDoS Attack Detection for Critical Services Protection (DAD-CSP) that takes dataset and ML pipeline as input, exploits the ML models and evaluates them. Feature selection has resulted in dimensionality reduction for improving quality in training. The ML models such as Decision Tree, Naïve Bayes and Random Forest showed different capabilities in attack classification. RF exhibited highest performance with 92% accuracy when compared with other two models.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135355352","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":"Blockchain enabled security mechanism for preventing data forgery in IoT-based smart homes","authors":"Arjun Singh, Surbhi Chauhan, Shashi Kant Dargar, Sumegh Tharewal, Vitthal Sadashiv Gutte, Pradeep Kumar Tiwari, Sonam Gupta","doi":"10.47974/jdmsc-1769","DOIUrl":"https://doi.org/10.47974/jdmsc-1769","url":null,"abstract":"Conventional homes have grown to be smart homes (SM) with the assistance of the Internet of Things (IoT). A unified gateway connects all Internet-enabled devices. Those gateways need to be secured by the usage of a sturdy safety method due to the fact safety is very vital. In order to conquer those problems, this observation shows employing Blockchain Technology (BC) for secured houses to make certain information private and safe. To cope with the safety problem with SH gateways, this paper proposes a solution. A reliable Q-learning algorithm with Blockchain assistance is proposed for the SH gateway to save data. three sections make up the protocol Q Learning Algorithm with Blockchain Support (QLABS). First, a Lattice cryptosystem based on Cipolla’s extended Euclidean distance algorithm is used to record and store user data (CEED-LC). Second, while preserving data secrecy and integrity, the proposed cryptosystem offers a small Key Generation (KG) with excellent security. Third, with the assistance of QLABS protocol agreement, the blocks are created with a specific gateway enrolment-ID. The testing results demonstrate how highly safe the suggested framework is against the vulnerabilities by obtaining a higher throughput along with a higher Packet Delivery Ratio (PDR) value. The results show that the recommended approach tops other existing algorithms in terms of PDR and throughput.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135355614","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}
R. Jegan, P. Vijayakumar, V. D. Ambethkumar, Pa Vijay, Edeh Michael Onyema
{"title":"Encryption and decryption of a word into weighted graph using super-edge anti-magic total labeling of Bi-star graph","authors":"R. Jegan, P. Vijayakumar, V. D. Ambethkumar, Pa Vijay, Edeh Michael Onyema","doi":"10.47974/jdmsc-1752","DOIUrl":"https://doi.org/10.47974/jdmsc-1752","url":null,"abstract":"Graph labeling is an important topic in Graph theory, a branch of Mathematics, having applications in the field of Networks, radio astronomy and cryptography etc. In most of encryption algorithms, words are encrypted as words. But our implementation is based on the algorithm that encrypts words into numbers, with the help of an edge weighted graph. Mapping of certain positive integers to graph elements in such a way that weights of all edges computed as, sum of the labels of all graph elements, are distinct is termed as Antimagic labeling In this paper, we present an algorithm that encrypts words into edge weighted graphs using super-edge antimagic total labeling of Bi-star graph and illustrate with an example.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135355624","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 landscape view of news recommendation systems based on MIND dataset","authors":"Niran A. Abdulhussein, Ahmed J. Obaid","doi":"10.47974/jdmsc-1617","DOIUrl":"https://doi.org/10.47974/jdmsc-1617","url":null,"abstract":"Nowadays, it’s a very important way for researchers and all people to find their desired meaning instead of searching for a specific topic. Recommendation systems are strategies to solve the problems of search, finding or reducing the time of interest content for users under complex information environments. R.S. can show us the related results that are close to what we desire. In this paper, we list rates of the most used techniques applied over MIND dataset and show the results and comparisons among these techniques, we have proposed our analysis on that dataset, which has been collected from Microsoft in 2019, and we proposed new techniques and explain the views of researchers in previous studies and the techniques in R.S. that depend on.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135845177","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":"J-Prime submodules and some related concepts","authors":"Iman A. Athab, Nuhad S. Al-Mothafar","doi":"10.47974/jdmsc-1630","DOIUrl":"https://doi.org/10.47974/jdmsc-1630","url":null,"abstract":"Suppose R has been an identity-preserving commutative ring, and suppose V has been a legitimate submodule of R-module W. A submodule V has been J-Prime Occasionally as well as occasionally based on what’s needed, it has been acceptable: x ∈ V + J(W) according to some of that r ∈ R, x ∈ W and J(W) an interpretation of the Jacobson radical of W, which x ∈ V or r ∈ [V: W] = {s ∈ R; sW ⊆ V}. To that end, we investigate the notion of J-Prime submodules and characterize some of the attributes of has been classification of submodules.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135845184","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}