Security Algorithms Research Articles

Designing New AES and Implementing it with LFSR Key to Improve Data Security

Data security is an essential aspect of data communication and data storage. The security and confidentiality of the information has become a significant factor in the communication field. To provide high-level security against all kinds of unauthorized accesses, cryptographic algorithms have been applied to various fields such as medical and military applications. Several techniques for encryption and decryption are proposed to promote the security of the communication systems. Most powerful and significant part of the encryption is a key generation. Presently, hackers are able to break the key with help of the modern high computing machines. Advanced Encryption Standard (AES), a symmetric cryptographic algorithm, is acknowledged as the most secure algorithm for the cryptographic process globally. In this work, Novel design and implementation of AES with LFSR (Linear Feedback Shift Register) key for improving data security is presented. The novelty of this work is using LFSR with AES. The Performance of presented approach is evaluated in terms of speed, area and security. The performance of presented technique will provide effective and efficient security to data.

An Optimized Byzantine Fault Tolerance Algorithm for Medical Data Security

Medical data are an intangible asset and an important resource for the entire society. The mining and application of medical data can generate enormous value. Currently, medical data management is mostly centralized and heavily relies on central servers, which are prone to malfunctions or malicious attacks, making it difficult to form a consensus among multiple parties and achieve secure sharing. Blockchain technology offers a solution to enhance medical data security. However, in medical data security sharing schemes based on blockchain, the widely adopted Practical Byzantine Fault-Tolerant (PBFT) algorithm encounters challenges, including intricate communication, limited scalability, and the inability to dynamically add or remove nodes. These issues make it challenging to address practical requirements effectively. In this paper, we implement an efficient and scalable consensus algorithm based on the PBFT consensus algorithm, referred to as Me-PBFT, which is more suitable for the field of medical data security. First, we design a reputation evaluation model to select more trusted nodes to participate in the system consensus, which is implemented based on a sigmoid function with adjustable difficulty. Second, we implement the division of node roles to construct a dual consensus layer structure. Finally, we design a node dynamic join and exit mechanism on the overall framework of the algorithm. Analysis shows that compared to PBFT and RAFT, ME-PBFT can reduce communication complexity, improve fault tolerance, and have good scalability. It can meet the need for consensus and secure sharing of medical data among multiple parties.

Enhanced Random Forest Classifier with K-Means Clustering (ERF-KMC) for Detecting and Preventing Distributed-Denial-of-Service and Man-in-the-Middle Attacks in Internet-of-Medical-Things Networks

In recent years, the combination of wireless body sensor networks (WBSNs) and the Internet ofc Medical Things (IoMT) marked a transformative era in healthcare technology. This combination allowed for the smooth communication between medical devices that enabled the real-time monitoring of patient’s vital signs and health parameters. However, the increased connectivity also introduced security challenges, particularly as they related to the presence of attack nodes. This paper proposed a unique solution, an enhanced random forest classifier with a K-means clustering (ERF-KMC) algorithm, in response to these challenges. The proposed ERF-KMC algorithm combined the accuracy of the enhanced random forest classifier for achieving the best execution time (ERF-ABE) with the clustering capabilities of K-means. This model played a dual role. Initially, the security in IoMT networks was enhanced through the detection of attack messages using ERF-ABE, followed by the classification of attack types, specifically distinguishing between man-in-the-middle (MITM) and distributed denial of service (DDoS) using K-means. This approach facilitated the precise categorization of attacks, enabling the ERF-KMC algorithm to employ appropriate methods for blocking these attack messages effectively. Subsequently, this approach contributed to the improvement of network performance metrics that significantly deteriorated during the attack, including the packet loss rate (PLR), end-to-end delay (E2ED), and throughput. This was achieved through the detection of attack nodes and the subsequent prevention of their entry into the IoMT networks, thereby mitigating potential disruptions and enhancing the overall network efficiency. This study conducted simulations using the Python programming language to assess the performance of the ERF-KMC algorithm in the realm of IoMT, specifically focusing on network performance metrics. In comparison with other algorithms, the ERF-KMC algorithm demonstrated superior efficacy, showcasing its heightened capability in terms of optimizing IoMT network performance as compared to other common algorithms in network security, such as AdaBoost, CatBoost, and random forest. The importance of the ERF-KMC algorithm lies in its security for IoMT networks, as it provides a high-security approach for identifying and preventing MITM and DDoS attacks. Furthermore, improving the network performance metrics to ensure transmitted medical data are accurate and efficient is vital for real-time patient monitoring. This study takes the next step towards enhancing the reliability and security of IoMT systems and advancing the future of connected healthcare technologies.

Key dependent information confidentiality scheme based on deoxyribonucleic acid (DNA) and circular shifting

In this era of advanced information technology, the exploration and development of novel mechanisms to ensure information confidentiality have consistently captivated the attention of upcoming researchers. In this article, we present a pioneering approach that combines DNA sequencing with a four-dimensional (4D) hyperchaotic map to bolster the security of digital information. Our primary focus is on the design of a robust and secure scheme for encrypting color images, leveraging DNA cryptography and hyperchaos. By extracting three distinct DNA sequences, we generate encryption keys through the integration of DNA computing and 4D hyperchaotic maps. Notably, these keys are intricately linked to the plaintext and vary with any alterations in the input. Consequently, the proposed encryption method stands resilient against an array of potential cryptographic attacks. To gauge the algorithm's security, we subject it to rigorous standard statistical analysis. Our findings underscore the efficiency and robustness of the proposed framework, establishing its potential for facilitating secure communication.

A review on machine learning methods for intrusion detection system

With the increasing access to the Internet and the development of information technology, concerns about computer security have been raised on a considerably large scale. Computer crimes contain various methods to undermine information privacy and system integrity, causing millions to trillions lose in the past few years. It is urgent to improve the security algorithms and models to perform as a thorough structure to prevent attacks. Among this prevention structure, an intrusion detection system (IDS) has played a vital role to monitor and detect malicious behaviours. However, due to the rapidly increasing variety of threats, the traditional algorithms are not sufficient, and new methods should be brought into IDS to improve the functionality. Deep learning (DL) and Machine learning (ML) are newly developed programs which can process data on a considerably large scale. They can also make decisions and predictions without specific programming, and these features are suitable to improve and enhance the IDS. This article mainly focuses on a review of ML methods used in IDS construction.

Cluster Head Selection and Secured Routing Using Glowworm Swarm Algorithm and Hybrid Security Algorithm for Over IoT-WSNs

WSNs (Wireless Sensor Networks) have received a lot of attention in a number of industries due to its self-configurability, simplicity in maintenance, and scaling capacities. WSN is configured with extra nodes in order to transport data around the network. The usual characteristics of sensor networks are low bandwidth, low energy, constrained power supply, and little memory space, which makes security particularly difficult in these networks. CH (Cluster heads) in a cluster experience heavier traffic loads than other cluster nodes. This results in the hotspot problems. Therefore, in a cluster-oriented routing scheme, picking the right CH is crucial. The two-level security is recommended in this research to safeguard data transmission via the WSN. A novel CH selection methodology is presented in order to increase the network's lifespan and energy effectiveness. This work also combines the fruit fly algorithm (FGF) with the GSA (firefly swarm algorithm) based on fitness to choose the optimal CH. To defend the network from assaults, it employs a hybrid security method that combines the Diffie-Hellman key exchange mechanism and the ECC (elliptic curve cryptography) algorithm. The suggested GSA-HSA protocol consistently produces good performance results in terms of MSR (Message Success Rate), E2E (End-to-End) Latency, NT (Network Throughput), and network throughput. average AEE (energy efficiency). The suggested approach outperforms all prior research by giving the wireless sensor network combination security, optimised coverage, and energy savings.

Analysis and Utilization of the Base64 Algorithm for Image Encryption and Decryption Security in Web-Based Images

Data is often the target of irresponsible people for misuse. The theft is done is to benefit from the person who has the data. In addition to theft of work files, theft is also carried out on image files. The purpose of this file theft is to find out what the image contains. Someone has a private image that cannot be known by others. Misuse of image files will be fatal for the owner of the image. Cryptographic techniques are needed in securing images and one of the methods used to secure these images is using the base64 algorithm. The Caesar Cipher algorithm can help users secure the image file. The Base64 algorithm can be used to change the ASCII 256 format to Base64 so that it is easy to send or store on a storage medium. By applying the Base64 algorithm to image files, the security and confidentiality of these files will protect data from irresponsible people.

A Secure Multi-Party Computation Protocol for Graph Editing Distance against Malicious Attacks

The secure computation of the graph structure is an important element in the field of secure calculation of graphs, which is important in querying data in graphs, since there are no algorithms for the graph edit distance problem that can resist attacks by malicious adversaries. In this paper, for the problem of secure computation of similarity edit distance of graphs, firstly, the encoding method applicable to the Paillier encryption algorithm is proposed, and the XOR operation scheme is proposed according to the Paillier homomorphic encryption algorithm. Then, the security algorithm under the semi-honest model is designed, which adopts the new encoding method and the XOR operation scheme. Finally, for the malicious behaviors that may be implemented by malicious participants in the semi-honest algorithm, using the hash function, a algorithm for secure computation of graph editing distance under the malicious model is designed, and the security of the algorithm is proved, and the computational complexity and the communication complexity of the algorithm are analyzed, which is more efficient compared with the existing schemes, and has practical value. The algorithm designed in this paper fills the research gap in the existing literature on the problem of graph edit distance and contributes to solving the problem.

A Deep Learning Approach for Securing IoT Infrastructure with Emphasis on Smart Vertical Networks

As a result of the Internet of Things (IoT), smart city infrastructure has been able to advance, enhancing efficiency and enabling remote management. Despite this, this interconnectivity poses significant security and privacy concerns, as cyberthreats are rapidly adapting to exploit IoT vulnerabilities. In order to safeguard privacy and ensure secure IoT operations, robust security strategies are necessary. To detect anomalies effectively, intrusion detection systems (IDSs) must employ sophisticated algorithms capable of handling complex and voluminous datasets. A novel approach to IoT security is presented in this paper, which focuses on safeguarding smart vertical networks (SVNs) integral to sector-specific IoT implementations. It is proposed that a deep learning-based method employing a stacking deep ensemble model be used, selected for its superior performance in managing large datasets and its ability to learn intricate patterns indicative of cyberattacks. Experimental results indicate that the model is exceptionally accurate in identifying cyberthreats, exceeding other models, with a 99.8% detection rate for the ToN-IoT dataset and 99.6% for the InSDN dataset. The paper aims not only to introduce a robust algorithm for IoT security, but also to demonstrate its efficacy through comprehensive testing. We selected a deep learning ensemble model due to its proven track record in similar applications and its ability to maintain the integrity of IoT systems in smart cities.

A STUDY ON MODIFIED RSA CRYPTOSYSTEM

Cryptography is the technique of turning information into an unreadable form in order to safeguard it. It is used to prevent unwanted data access. The RSA Algorithm offers robust encryption; however, it is computationally demanding. The RSA algorithm, has a vulnerability related to integer factorization for small numbers. The researchers want to improve the RSA cryptosystem's security and efficiency by presenting and comparing various modifications that attempt to improve the key generation, encryption, and decryption procedures. This paper explains how to extend and modify the RSA algorithm for better security and performance, then gives brief description of their output

Message Hiding Using the Least Significant Bit Method with Shifting Hill Cipher Security

Technological developments go hand in hand with advances in digital messaging. In protecting the confidentiality of the message, it is necessary to double secure the data. This security can be done with a combination of steganography and cryptographic techniques. Steganography algorithm which is a technique for hiding messages well, one of which is Least Significant Bit (LSB). The LSB algorithm is a simple method because it only converts the value of the last bit in a message with the inserted message bit, which is a convenience of the LSB algorithm, but it becomes vulnerable to message theft attacks if not combined with other algorithms for security. So it is necessary to increase security. This research developed a combination method of LSB algorithm for steganography technique with Hill Cipher algorithm for cryptographic technique, Hill Cipher was developed with shifting (shifting) 2 (two) characters. With the development of this method, hackers will find it difficult to crack messages, and is expected to improve the performance of the algorithm in affecting image quality and travel time in running the algorithm. The results of this study will be tested using several evaluation tools MSE, PSNR, BER, CER, AE, and Entropy. With the development of this method, hackers will find it difficult to decipher messages, and from the results of this experiment has been able to improve the performance of the algorithm in maintaining image quality and can shorten travel time in running the algorithm.

Dynamic security region of natural gas systems in integrated electricity-gas systems

In an integrated electricity-gas system (IEGS), gas-fired units with flexibility response capabilities address the uncertainty associated with renewable energy by swiftly adapting their output, which may result in uncertain fluctuations in the gas withdrawal of gas-fired units, potentially posing risks to the security of IEGS. Hence, it is necessary to efficiently evaluate the dynamic security region (DSR) of natural gas systems in IEGS by considering the real-time dynamic characteristics of natural gas systems, which are not satisfactorily handled in state-of-the-art works. To bridge this gap, this paper first conceptionally verifies the necessity of the DSR and establishes its mathematical model. Then, a dimensionality reduction method is proposed for the efficient solution and visualization of the high-dimensional DSR evaluation model. A fast evaluation (FE) algorithm is developed to address the difficulties of the nonconvex dynamic constraints in the reduced DSR model. Finally, the necessity and notable advantages of the proposed DSR model and FE are verified based on small and relatively large test systems in comparison with common security region models and algorithms. To the best of our knowledge, this is the first paper that comprehensively presents models and efficient algorithms regarding the DSR of natural gas systems in IEGS.

Enhancing Firefly Algorithm for better Network lifetime optimization in Healthcare Monitoring System - Cloud Computing Environment

The Internet of Things (IoT), a new phenomenon in the technology industry, is mostly responsible for updating healthcare systems by gathering and analyzing patient physiological data through wearable technology and sensor networks. It is difficult to process so much data from so many IoT devices in such a short amount of time. Maximizing the network lifetime is one of the most significant tasks faced by any wireless sensor network. The objective of the study described in this paper was to apply swarm intelligence metaheuristics to optimize the cluster head selection. In order to extend the lifetime of the WSN, we have implemented both the original firefly algorithm (FA) and the proposal for the revised FA. Additionally, According to the proposed study, sensitive data is created and stored by IoT devices, which are vulnerable to attack, and data processing is handled by the edge server. Standard security algorithms like AES, DES, and RSA make it difficult for the majority of IoT devices to function successfully because of their restricted resources. For real-time processing, visualization, and diagnosis, the real-time data is subsequently sent to a distant cloud server.

Lightweight Privacy-Preserving Remote User Authentication and Key Agreement Protocol for Next-Generation IoT-Based Smart Healthcare

The advancement and innovations in wireless communication technologies including the Internet of Things have massively changed the paradigms of health-based services. In particular, during the COVID-19 pandemic, the trends of working from home have been promoted. Wireless body area network technology frameworks help sufferers in remotely obtaining scientific remedies from physicians through the Internet without paying a visit to the clinics. IoT sensor nodes are incorporated into the clinical device to allow health workers to consult the patients’ fitness conditions in real time. Insecure wireless communication channels make unauthorized access to fitness-related records and manipulation of IoT sensor nodes attached to the patient’s bodies possible, as a result of security flaws. As a result, IoT-enabled devices are threatened by a number of well-known attacks, including impersonation, replay, man-in-the-middle, and denial-of-service assaults. Modern authentication schemes do solve these issues, but they frequently involve challenging mathematical concepts that raise processing and transmission costs. In this paper, we propose a lightweight, secure, and efficient symmetric key exchange algorithm and remote user authentication scheme. Our research proposal presents a successful privacy-protecting method for remote users and provides protection against known attacks. When compared to conventional options, this technique significantly reduces calculation costs by up to 37.68% and transmission costs by up to 32.55%.

Secure data access using blockchain technology through IoT cloud and fabric environment

AbstractIn the current landscape, staying abreast of the latest technological advancements is a formidable challenge, especially given the deluge of data inundating the internet. The realization has dawned that effectively managing the surge in emerging data necessitates the integration of multiple technologies. In pursuit of this objective, the Internet of Things (IoT), renowned for its sensor‐based data capture capabilities, is frequently coupled with blockchain technology to ensure secure data storage and access. This amalgamation, in turn, leverages the cloud environment when data volume surpasses a machine's processing capacity, thus mitigating infrastructure and maintenance costs. This study endeavors to optimize data storage within the blocks of the blockchain (BCT) by storing an index that points to the actual data. This innovative approach not only conserves storage space but also enhances operational efficiency. Furthermore, it simplifies the task of identifying malicious or faulty nodes deployed at different locations for data capture within the prescribed time frame. To exemplify this implementation, a case study is presented, focusing on securing user votes through the creation of contracts. The results showcased underscore the preference for a permissioned blockchain, such as Fabric, over a permissionless one, like Ethereum, particularly in the context of security considerations. The findings reveal that as the number of operations (in this case, votes cast) increases, Ethereum's performance deteriorates, while Fabric exhibits exceptional robustness. Additionally, the study analyzes sensor data simulated via IoT nodes before and after the application of security algorithms to underscore the significance of the proposed Secure Cloud‐Based Blockchain (SCB2) model. The analysis encompasses various facets, including the creation, validation, and computation times of transactions and blocks within a node, and positions the model favorably in comparison to existing literature.

Application of RESTful Method with JWT Security and Haversine Algorithm on Web Service-Based Teacher Attendance System

A teacher attendance system utilizing fingerprints has been implemented at Ponpes Daarul Muttaqien II. However, fingerprint recognition errors frequently occur if the scanner is unclean. Teachers fill out an attendance update form for various reasons, including forgotten attendance, damaged fingerprints, and unnoticed absences. The Human Resources Bureau receives updates from around 28 instructors within one week. Statistics reveal that 30% of instructors update due to finger injuries preventing recognition, and 70% due to forgetting. Amid the COVID-19 pandemic, organizations advise remote work. Similarly, only specific sections, like technical and security units, require attendance at Ponpes Daarul Muttaqien II. Due to the potential risks of linking fingerprints to virus transmission, this study proposes a web-based attendance system. It employs the RESTful API approach, JWT Security, and the Haversine Formula Algorithm. The system mandates employees to be within 100 meters of a designated coordinate point for attendance. The system tracks attendance status, arrival and delay times, and absence status. Future enhancements might involve facial recognition for more robust validation. In conclusion, this innovative approach addresses attendance challenges, offering adaptability, security, and potential fraud prevention.

Innovative chaotic dragon fractal (ChDrFr) shapes for efficient encryption applications: a new highly secure image encryption algorithm

In this paper, the generation of new dragon fractal shapes with chaotic iteration parameters is introduced as the main component of a new efficient approach for different cryptographic applications. This process involves applying a chaotic map, which is considered the initiator pattern, to generate different chaotic dragon fractal (ChDrFr) shapes in lieu of lines (which are classically used to generate dragon fractals). This is the new concept of this paper. The used chaotic maps are sensitive to their initial conditions and are characterized by randomness; hence, the resulting scheme is highly secure. As the resulting ChDrFr shapes have sparse structures, the spaces are packed with random values generated from another 5D hyper chaotic map. For encryption applications based on the substitution approach, one of the five generated ChFrDr shapes can be used to construct a chaotic fractal (ChFr) S-Box, while the other four ChDrFr shapes can be used for diffusion purposes. As an application to these new ChDrFr shapes and the ChFr S-Box, we introduce in this paper a new highly secure image encryption algorithm. A Henon chaotic map is used as the initiator of the ChDrFr shapes. The integer wavelet transform (IWT) is used to generate an approximation and three detail sub-bands for the original image. As the approximation sub-band contains a considerable amount of information about the original image, the above-described ChFr S-Box is used as a replacement for each pixel’s value in this sub-band. Then, the resultant substituted image is diffused with one of the generated ChFrDr shapes. The other three ChDrFr shapes are XORed with the details sub-images. Numerical simulation is applied to ensure the efficacy of encrypted images against different attacks. In particular, the correlation coefficient between the initial and the generated images is shown to be nearly zero. Moreover, tests reveal that the information entropy of the encrypted images and UACI were close to their optimum values. The properties of the newly proposed ChDrFr-based encryption algorithm are compared to the ones obtained by other encryption algorithms, and the results prove the superiority of this newly proposed algorithm to other types of encryption methods.

Enhancing Data Security: A Comprehensive Study on the Efficacy of JSON Web Token (JWT) and HMAC SHA-256 Algorithm for Web Application Security

In today's digital era, data security is a very important aspect in various applications and services. In order to protect the integrity, confidentiality and authentication of data, security technologies such as JSON Web Token (JWT) and HMAC SHA256 algorithm are widely used. JWT is an open standard (RFC 7519) that is used to represent information in the form of tokens that can be signed digitally. The research methodology used in this research is a descriptive research method. The descriptive method is a method that describes the purpose of the data collected and records every aspect of the situation being investigated to get a clear picture of what is needed. It was found that there were several data leaks when data security was not implemented in layers, including cases that had occurred such as loss of important data contained in the website and leaks of important data which caused identities to be spread widely. Conclusions from the use of JSON Web Token (JWT) and HMAC-SHA-256 algorithm for website security is that this combination provides a strong layer of protection against security threats that are common in the online environment.

Improved Rsa Algorithm for Data Security against DDoS Attack in a Cloud-based Intrusion Detection System

Improved Rsa Algorithm for Data Security against DDoS Attack in a Cloud-based Intrusion Detection System

WITHDRAWN: Efficient fragmentation and allocation on clustering in distributed environment (FACE)

Distributed data processing systems require a reliable storage structure that ensures consistent, high-scale, and scalable data access for all users. Data fragmentation and subsequent allocation are important aspects of a flexible distributed database system. Existing techniques may result in significant data loss while performing data allocation and fragmentation. To overcome these issues a novel fragmentation and Allocation on Clustering in Distributed Environment (FACE) is proposed for reliable storage with scalable data access for all users. Initially, the user query is given to distributed database system (DDBS), then the query is fed to the query parser. The query parser parses and converts a textual query into a query object. After parsing the query data, it is passed to the query optimizer, which optimizes the query to access the data more efficiently. In the next step, the query is fragmented using dual (horizontal and vertical) fuzzy C means clustering. In Dual fuzzy C means clustering, the vertical fragmentation focuses on clustering attribute values that are frequently accessed together, and horizontal fragmentation focuses on grouping records that meet data selection criteria. After fragmentation, the query is allocated using sequential rule mining, in which queries occur in sequential order. The allocated query is optimized using the Efficient Fragment Security (EFS) algorithm to normalize the parameters to achieve better results. The performance metrics of the proposed techniques are calculated based on Final Prediction Error (FPE), and Execution time. The proposed FACE achieves a lower execution time of the 1.56 s. The result shows that the proposed FACE decreases the overall execution time lower than the 4.70 s, 4.46 s, 3.3 Sec, and 3.14 s in MAPA, DMA, BBE, and RATS-HM respectively.