Search

Wireless sensor networks (WSNs) have up until now faced many challenges because of their open, wide-ranging, and resource-limited nature, including security, efficiency, and energy consumption. In the military system, it is essential to provide high-level security to the significant data over wireless network which is proved to be unreliable public communications. To solve the above problem, high level of security with minimum complexity should be applied to be adequate to limited capabilities of transmission system. This paper presents a new algorithm named (SRS) for encrypting transmitted military images to keep them from getting hacked or broken by WSN. The SRS algorithm is designed to be lightweight, fast, and secure, taking into consideration the limited capabilities of the transmission system. It is implemented as a public key cryptosystem specifically designed for image encryption. The algorithm consists of two parts: encryption and decryption. The proposed system suggested some equations and calculations that are applied to the plain and coded images after being transmitted over the WSN. The results of testing the simulation model demonstrate the effectiveness of the system by evaluation using various metrics such as Signal-to-Noise Ratio (SNR), Mean Squared Error (MSE), and Peak Signal-to-Noise Ratio (PSNR). Overall, the paper presents a new encryption algorithm, SRS, specifically designed for securing military images transmitted over wireless sensor networks. The algorithm aims to provide a balance between security, efficiency, and energy consumption, considering the resource-limited nature of WSNs. The simulation results indicate the improvement of the proposed system by 13 %, 10 %, and 55 % in packet delivery ratio (PDR), throughput, and dropping ratio, respectively, and it shows that the suggested SRS method increased execution time by 67 % compared to RSA based algorithm [ABSTRACT FROM AUTHOR]

Recently, researchers have started to be interested in population-based swarm-based algorithms in optimization due to their simple structure, high optimization performance, and ease of adaptation. Although swarm-based algorithms solve continuous optimization problems, they can also be used to solve binary optimization problems. In continuous optimization, the search space variables try to approach the optimal value, while in discrete optimization, the search space variables are fixed and expressed with real values. In binary optimization, the decision variables take values of 0 and 1 and are basically in the discrete optimization class. In this paper, the proposed Rat Swarm Algorithm (RSA) to solve continuous optimization problems is examined. RSA is an algorithm based on swarm intelligence. RSA was developed by imitating the chasing and attacking behaviors of rats. In this study, the original RSA was updated again to solve binary optimization problems and Binary RSA (BinRSA) was proposed. In BinRSA, four U-shaped and four T-shaped transfer functions are used while converting the continuous search field values to binary values. Thus, eight variants of BinRSA were obtained. These are named as BinRSA1, BinRSA2, BinRSA3, BinRSA4, BinRSA5, BinRSA6, BinRSA7 and BinRSA8. Among these variants, the most successful variant of BinRSA was determined as BinRSA6. Then the BinRSA6 variant was developed by adding crossover and mutation operators and was named GBinRSA. GBinRSA's performance has been tested in knapsack problems. In addition, the success of GBinRSA was compared with different heuristic algorithms selected from the literature. According to the results obtained, it has been seen that the solution quality of the proposed algorithm is effective and comparable. The results showed that GBinRSA is a preferred heuristic for binary optimization problems. [ABSTRACT FROM AUTHOR]

IoT devices typically encompass objects or devices equipped with software and internet connectivity, allowing them to collect data. They have limited processing power, memory, and storage. These limitations can make it difficult to secure these devices, as traditional security measures may not be practical. Implementing security for IoT devices can be challenging due to these characteristics, but several steps can be taken to mitigate these challenges. Elliptic Curve Cryptography (ECC) can secure resource constrained IoT devices by providing a more efficient method of encryption and authentication than traditional methods such as RSA. In this paper, we analyzed the lightweight cryptographic algorithm ECC for securing resource-constrained devices such as IoT and evaluated its performance compared to the RSA cryptosystem. The analysis result indicates that ECC is considered to provide stronger security than RSA for the same key length. The CoAP protocol is applied to devices with limited resources, and an examination of its impact is conducted, considering three key performance metrics: CPU usage, bandwidth efficiency, and message communication latency. [ABSTRACT FROM AUTHOR]

In recent years, cyber‐security of networked control systems has become crucial, as these systems are vulnerable to targeted cyberattacks that compromise the stability, integrity, and safety of these systems. In this work, secure and private communication links are established between sensor–controller and controller–actuator elements using semi‐homomorphic encryption to ensure cyber‐security in model predictive control (MPC) of nonlinear systems. Specifically, Paillier cryptosystem is implemented for encryption‐decryption operations in the communication links. Cryptosystems, in general, work on a subset of integers. As a direct consequence of this nature of encryption algorithms, quantization errors arise in the closed‐loop MPC of nonlinear systems. Thus, the closed‐loop encrypted MPC is designed with a certain degree of robustness to the quantization errors. Furthermore, the trade‐off between the accuracy of the encrypted MPC and the computational cost is discussed. Finally, two chemical process examples are employed to demonstrate the implementation of the proposed encrypted MPC design. [ABSTRACT FROM AUTHOR]

This article introduced a new generalized RSA crypto-system based on 2 n prime numbers called generalized RSA (GRSA). This is a modern technique to provide supreme security for the computer world by factoring the variable N , where its analysis process has become much easier nowadays with the development of tools and equipment. 2 n primes (prime numbers) are used in the GRSA crypto-system to provide security over the network system. This includes encryption, key generation, and decryption. In this method we used 2 n primes which are not easily broken, 2 n primes are not comfortably demented. This method provides greater performance and fidelity over the network system. [ABSTRACT FROM AUTHOR]

There are many ways to ensure data security, one of the classic way but still effective is to use encryption. Encryption itself has two techniques or algorithms: symmetric-key (also called secret-key) and asymmetric-key encryption (also called public key). In this paper, we proposed an analysis of two algorithm of encryption: RSA and AES algorithm in term of securing digital data. The method used in this research are: RSA and AES analysis, then retrieving the result. The two algorithm is deeply and thoroughly analyzed to discover the effectiveness to secure the data. The Technological Readiness Level (TKT) is at level 6, which means demonstration of a model or prototype or the analysis result of a system or subsystem or a study in a relevant environment. The result concluded that the application of the AES encryption algorithm is more optimal than RSA encryption in digital data security. Because the encryption and decryption process of using the AES algorithm is faster, although the difference in testing time of the two encryption algorithms is not too significant. The entropy value of 4.96 in AES encryption is greater than that of RSA proving that the even distribution of characters in the chiper text code does not accumulate on certain characters so that it will be difficult to attack using frequency analysis.

At a time when communication network technology is developing rapidly, the security of the Internet has aroused widespread concern in the academic community. In particular, electronic payment, which has been booming in recent years, has great security risks and people are prone to information leakage and property loss in the process of payment. In order to solve these problems, this study adopts the AES to encrypt the information in the payment process, introduces the RSA Public Key System (RSA) and the SM4 packet cipher algorithm for comparison, and analyses their encryption (decryption) speed, decryption (decryption) speed and encryption speed respectively. (decryption) speed, as well as PR curve, Loss function and sensitivity. The results show that the AES algorithm has a faster encryption (decryption) speed compared to the other two algorithms. In the PR curve, the AES algorithm has an AP value of 0.9988, which is significantly higher than the other two algorithms, and has a better balance between accuracy and recall, and better performance. In the sensitivity analysis, the AES algorithm can have the highest sensitivity of 97.88%. This is significantly higher than the 93.47% and 96.59% of the other two algorithms. Moreover, as shown by the Loss function of the AES algorithm, it converges faster and the Liss value varies between 0.1 and 0.9. In summary, the AES algorithm has a faster encryption speed and is better in terms of accuracy, convergence speed and security factor in all aspects. This also demonstrates the feasibility and effectiveness of this algorithm for information security protection in electronic payment processes. [ABSTRACT FROM AUTHOR]

With the increasing number of computer network users, the problem of network communication security has become more and more serious. Encryption technology, as one of the key technologies for securing communication, has important research and application values. However, the security of conventional encryption methods is gradually challenged, and at the same time, traditional encryption algorithms require a large amount of computing resources, which makes it difficult to realize real-time encryption and decryption operations. Therefore, how to improve the confidentiality and efficiency of computer network communication security encryption system has become a current urgent problem to be solved. This paper firstly discussed the analysis of its application in the computer network communication security encryption system based on the ant colony optimization (ACO) algorithm. Through the theoretical analysis of the ACO algorithm in terms of bioheuristic optimization algorithm and the analysis of the characteristics of the algorithm, the optimization scheme of key distribution based on the ACO algorithm was discussed. Then, the differences between the ACO algorithm and the traditional encryption algorithm in terms of encryption duration, key distribution time, encryption strength and random number generation speed were further analyzed and verified by experimental data. The data results showed that the key distribution of the encryption system using the ACO algorithm had higher security and better performance compared with the traditional key distribution algorithm. By counting and comparing the data, it was found that the ACO algorithm showed very obvious advantages in terms of encryption and decryption time, key distribution time, encryption strength and random number generation. This indicates that the ACO algorithm has very important application prospects in computer network communication security encryption systems. [ABSTRACT FROM AUTHOR]

The objective of this paper is to present a novel application of 2-cyclic refined integers to build a novel crypto scheme for the encryption and decryption of data and information based on the algebraic properties of 2-cyclic refined integers combined with RSA algorithm, where an improved version of RSA crypto-scheme will be established and applied to the security of information and data. On the other hand, we illustrate some examples and figures to show the validity and complexity of the algorithm. [ABSTRACT FROM AUTHOR]

With the rapid increase in demand for data trustworthiness and data security, distributed data storage technology represented by blockchain has received unprecedented attention. These technologies have been suggested for various uses because of their remarkable ability to offer decentralization, high autonomy, full process traceability, and tamper resistance. Blockchain enables the exchange of information and value in an untrusted environment. There has been a significant increase in attention to the confidentiality and privacy preservation of blockchain technology. Ensuring data privacy is a critical concern in cryptography, and one of the most important protocols used to achieve this is the secret-sharing method. By dividing the secret into shares and distributing them among multiple parties, no one can access the secret without the cooperation of the other parties. However, Attackers with quantum computers in the future can execute Grover’s and Shor’s algorithms on quantum computers that can break or reduce the currently widely used cryptosystems. Furthermore, centralized management of keys increases the risk of key leakage. This paper proposed a post-quantum threshold algorithm to reduce the risk of data privacy leakage in blockchain Systems. This algorithm uses distributed key management technology to reduce the risk of individual node private key leakage and provide post-quantum security. The proposed privacy-preserving cryptographic algorithm provides a postquantum threshold architecture for managing data, which involves defining users and interaction processes within the system. This paper applies a linear secret-sharing solution to partition the private key of the Number Theory Research Unit (NTRU) algorithm into n parts. It constructs a t–n threshold that allows recovery of the plaintext only when more than t nodes participate in decryption. The characteristic of a threshold makes the scheme resistant to collusion attacks from members whose combined credibility is less than the threshold. This mitigates the risk of single-point private key leakage. During the threshold decryption process, the private key information of the nodes will not be leaked. In addition, the fact that the threshold algorithm is founded on the NTRU lattice enables it to withstand quantum attacks, thus enhancing its security. According to the analysis, the proposed scheme provides superior protection compared to currently available methods. This paper provides postquantum security solutions for data security protection of blockchain, which will enrich the use of blockchain in scenarios with strict requirements for data privacy protection. [ABSTRACT FROM AUTHOR]

Over the recent decades, incorporating Vehicular Ad-hoc Network (VANET) into Cloud computing plays a vital role, since it provides a reliable safety journey to vehicular drivers, passengers, etc. However, attaining security and emergency message dissemination is still major bottleneck in VANET combined Cloud, due to the dynamic nature of vehicles and wireless communication. Our major intention is to provide high level security in VANET-Cloud environment. In addition to it, we also reduce delay in emergency dissemination. Our proposed Delay Aware Emergency Message Dissemination and Data Retrieval in Secure (DEMD2RS) VANET-Cloudis composed of four sequential processes: Authentication, Clustering, Data Retrieval and Data dissemination. In regard to maintainingsecurity for both Road Side Unit (RSU) and Vehicles, we propose Hash based Credential Authentication Scheme (HCAS) that affords authentication using Secure Hash Algorithm-3 (SHA-3) and Elliptic Curve Points (ECP). To sustain a stable cluster, Firm Aware Clustering Scheme (FACS) is pursued where Stud Krill Herd (SKH) algorithm is exploited. In the data retrieval process, cloud provides requested information to the RSU in encrypted form using the Twofish algorithm. RSU discover the path to deliver received data through executing Artificial Neural Network (ANN) algorithm. In order to diminish delay in emergency message dissemination, best disseminator is selected by cluster head using Fuzzy-Topsis (FT) algorithm. Our DEMD2RSVANET-Cloud network is implemented in Omnet 4.6 and SUMO 0.21.0 simulation tool. Finally, the evaluation of DEMD2RS work performance is achieved by computing consequent metrics that are Throughput, Packet Delivery Ratio, Transmission delay, and Average delay, Key generation time, Encryption time and Decryption time. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Guangxi Normal University - Natural Science Edition is the property of Gai Kan Bian Wei Hui and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Broadcast Encryption (BE) is public-key encryption allowing a sender to encrypt a message by specifing recipients, and only the specified recipients can decrypt the message. In several BE applications, since the privacy of recipients allowed to access the message is often as important as the confidentiality of the message, anonymity is introduced as an additional but important security requirement for BE. Kiayias and Samari (IH 2013) presented an asymptotic lower bound on the ciphertext sizes in BE schemes satisfying anonymity (ANO-BE for short). More precisely, their lower bound is derived under the assumption that ANO-BE schemes have a special property. However, it is insufficient to show their lower bound is asymptotically tight since it is unclear whether existing ANO-BE schemes meet the special property. In this work, we derive asymptotically tight lower bounds on the ciphertext size in ANO-BE by assuming only properties that most existing ANO-BE schemes satisfy. With a similar technique, we first derive asymptoticallyqueryPlease provide MSC codes. For more details, please visit http://www.ams.org/msc/. tight lower bounds on the authenticator sizes in Anonymous Broadcast Authentication (ABA). Furthermore, we extend the above result and present (non-asymptotically) tight lower and upper bounds on thequeryPlease check and confirm the Running title. ciphertext sizes in ANO-BE. We show that a variant of ANO-BE scheme proposed by Li and Gong (ACNS 2018) is optimal. We also provide tight bounds on the authenticator sizes in ABA via the same approach as ANO-BE, and propose an optimal construction for ABA. [ABSTRACT FROM AUTHOR]

Cryptography algorithms are an essential tool for protecting sensitive data and communications. They can be compared based on several criteria. The paper compares some of the traditional AES, RSA and SHA with lightweight Speck, Simon and Clefia cryptography algorithms based on key size, block size, rounds and security. It is worth noting that the choice of algorithm depends on the specific use case and the level of security. In general, traditional algorithms may be more appropriate for applications that require high levels of security, while lightweight algorithms may be more suitable for resource-constrained environments. [ABSTRACT FROM AUTHOR]

Data security is critical in wireless sensor networks (WSNs) because communication signals are highly available due to data transmission in free space. Attacks ranging from passive eavesdropping to active snooping are more common on these networks. This paper proposes secure data transfer using data encryption based on the improved Rivest–Shamir–Adleman (RSA) with Diffie–Hellman (DH) key exchange algorithm (IRSA-DH). For this purpose, the adaptive distance-based agglomerative hierarchical (ADAH)-based clustering method is used. Then the cluster head (CH) is selected using the improved weight-based rain optimization (IWRO) to improve the network's lifespan. This study aims to design a secure group communication method for WSNs. In order to generate and distribute the key to the group, the RSA and DH and key exchange algorithm had been hybridized with the Key Management Center (KMC). For safe communication between users, the key exchange technique is investigated. The performance measures such as throughput, packet loss ratio (PLR), packet delivery ratio (PDR), latency, energy consumption, end-to-end delay (EED) and network lifetime are analyzed and compared with the existing approaches. [ABSTRACT FROM AUTHOR]

When generating primes |$p$| and |$q$| for an RSA key, the algorithm specifies that if |$p-1$| and |$q-1$| must be relatively prime to the public exponent |$e$|⁠. If this is not done, then the decryption exponent is not well defined. However, what if a software bug allows the generation of public parameters |$N$| and |$e$| of an RSA key with this property and then it is subsequently used for encryption? Though this may seem like a purely academic question, a software bug in a preview release of the Windows 10 operating system makes this question of more than purely theoretical. Without a well defined decryption exponent, plaintexts encrypted to such keys will be undecryptable thus potentially losing user data, a serious software defect. Though the decryption exponent is no longer well defined, it is in fact possible to recover the a small number of potential plaintexts, if the prime factors |$p$| and |$q$| of the public modulus |$N$| are known. This paper presents an analysis of what steps fail in the RSA algorithm and derives a plaintext recovery algorithm. The runtime of this algorithm is |$O(e)$| making it practical to use, and it has been implemented in python. [ABSTRACT FROM AUTHOR]

Secure and reliable exchange of information between devices is crucial for any network in the current digital world. This information is maintained on storage devices, routing devices, and communication over the cloud. Cryptographic techniques are used to ensure the secure transmission of data, ensuring the user's privacy by storing and transmitting data in a particular format. Using encryption, only the intended user possessing the key can access the information. During data or essential transmission, the channel should be secured by using robust encryption techniques. Homomorphic Encryption (HE) techniques have been used in the past for this purpose. However, one of the flaws of the conventional HE is seen either in its slow transmission or fast key decryption. Thus, this paper proposes an optimized Homomorphic Encryption Chinese Remainder Theorem with a Rivest-Shamir-Adleman (HE-CRT-RSA) algorithm to overcome this challenge. The proposed Technique, HE-CRT-RSA, utilizes multiple keys for efficient communication and security. In addition, the performance of the HE-CRT-RSA algorithm was evaluated in comparison with the classical RSA algorithm. The result of the proposed algorithm shows performance improvement with reduced decryption time. It is observed that the proposed HE-CRT-RSA is 3–4% faster than the classical Rivest-Shamir-Adleman (RSA). The result also suggests that HE-CRT-RSA effectively enhances security issues of the cloud and helps to decrease the involvement of intruders or any third party during communication or inside the data/server centers. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Beijing University of Technology is the property of Journal of Beijing University of Technology, Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The motivation for this research arises from the challenges faced by railway operators in managing ticketing processes effectively. These challenges highlight the need for a robust web-based application to automate ticket verification and validation, emphasizing the importance of developing a secure and efficient ticket generation and validation system. The proposed solution employs RSA (Rivest-Shamir-Adleman) and Keccak cryptographic algorithms to ensure the security and efficiency of ticket generation and validation. By generating digital signatures and hash functions, the authenticity and integrity of ticket data are maintained. Recipients can utilize the sender's public key and the same hash function to verify the ticket data's authenticity. The system offers several advantages, including security, integrity, authentication, efficiency, and scalability. Future work may involve implementing multi-party computation, developing more efficient algorithms, exploring blockchain technology, and conducting more extensive testing and evaluation. [ABSTRACT FROM AUTHOR]

In the context of digital signatures, the proxy signature holds a significant role of enabling an original signer to delegate its signing ability to another party (i.e., proxy signer). It has significant practical applications. Particularly it is useful in distributed systems, where delegation of authentication rights is quite common. For example, key sharing protocol, grid computing, and mobile communications. Currently, a large portion of existing proxy signature schemes are based on the hardness of problems like integer factoring, discrete logarithms, and/or elliptic curve discrete logarithms. However, with the rising of quantum computers, the problem of prime factorization and discrete logarithm will be solvable in polynomial-time, due to Shor's algorithm, which dilutes the security features of existing ElGamal, RSA, ECC, and the proxy signature schemes based on these problems. As a consequence, construction of secure and efficient post-quantum proxy signature becomes necessary. In this work, we develop a post-quantum proxy signature scheme Mult-proxy, relying on multivariate public key cryptography (MPKC), which is one of the most promising candidates of post-quantum cryptography. We employ a 5-pass identification protocol to design our proxy signature scheme. Our work attains the usual proxy criterion and a one-more-unforgeability criterion under the hardness of the Multivariate Quadratic polynomial (MQ) problem. It produces optimal size proxy signatures and optimal size proxy shares in the field of MPKC. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

To address a business need, most organizations allow employees to use their own devices to enhance productivity and job satisfaction. For this purpose, the Bring Your Own Device (BYOD) policy provides controllable access for employees to organize data through their personal devices. Although the BYOD practice implies plenty of advantages, this also opens the door to a variety of security risks. This study investigates these security risks and proposes a complementary encryption approach with a digital signature that uses symmetric and asymmetric algorithms, depending on the organization's digital certificate, to secure sensitive information stored in employees' devices within the framework of BYOD policies. The method uses Advanced Encryption System (AES), Blowfish, RSA and ElGamal with a digital signature to achieve strong encryption and address critical security considerations such as user authentication, confidentiality and data integrity. The proposed encryption approach offers a robust and effective cryptographic solution for securing sensitive information in organizational settings that involve BYOD policies. The study includes experimental results demonstrating the proposed approach's efficiency and performance, with reasonable encryption and decryption times for different key and file sizes. The results of the study revealed that AES and Blowfish have the best execution time. AES has a good balance of security and performance. RSA performs better than ElGamal in encryption and signature verification, while RSA is slower than ElGamal in decryption. The study also provides a comparative analysis with previous studies of the four encryption algorithms, highlighting the strengths and weaknesses of each approach. [ABSTRACT FROM AUTHOR]

Copyright of Journal of South China University of Technology (Natural Science Edition) is the property of South China University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Cloud computing is a technology that provides secure storage space for the customer’s massive data and gives them the facility to retrieve and transmit their data efficiently through a secure network in which encryption and decryption algorithms are being deployed. In cloud computation, data processing, storage, and transmission can be done through laptops and mobile devices. Data Storing in cloud facilities is expanding each day and data is the most significant asset of clients. The important concern with the transmission of information to the cloud is security because there is no perceivability of the client’s data. They have to be dependent on cloud service providers for assurance of the platform’s security. Data security and privacy issues reduce the progression of cloud computing and add complexity. Nowadays; most of the data that is stored on cloud servers is in the form of images and photographs, which is a very confidential form of data that requires secured transmission. In this research work, a public key cryptosystem is being implemented to store, retrieve and transmit information in cloud computation through a modified Rivest-Shamir-Adleman (RSA) algorithm for the encryption and decryption of data. The implementation of a modified RSA algorithm results guaranteed the security of data in the cloud environment. To enhance the user data security level, a neural network is used for user authentication and recognition. Moreover; the proposed technique develops the performance of detection as a loss function of the bounding box. The Faster Region-Based Convolutional Neural Network (Faster R-CNN) gets trained on images to identify authorized users with an accuracy of 99.9% on training. [ABSTRACT FROM AUTHOR]

In recent times, technology development has greatly influenced the model of Blockchain for communication due to extensive digitalization worldwide. Moreover, blockchain technology plays an essential part in the role of an educational system for sharing important data between students and teachers. However, the security hazard is the main problem while transferring the data because the malicious attacker may be able to hack the essential data in communication. A novel Signature-based Rivest Shamir Framework (SbRSF) is proposed to overcome such issues for privacy limit maintenance and security action improvement. Also, the harmful attack in data transmission is estimated by this projected approach. The implementation of this research has been done on the python platform. Hence, the proposed model has gained 98.03% throughput, encryption, and decryption time of 5 ms and reduced the error rate to 0.2%. Moreover, the achieved results are compared with the conventional methods, such as the Elliptic curve model, sensitivity-based elliptic crypto scheme, and secure record sharing, to validate the significance of the projected approach in blockchain development. [ABSTRACT FROM AUTHOR]

Nowadays, medical enterprises are gradually attracted to store their data in the cloud paradigm and distribute the data between the authorized person due to the enormous growth of cloud computing and big data. However, the rapid growth of these systems has faced some crucial challenges such as data privacy and security. Presently, different cryptography techniques are used in a large amount of data processing and storage, but it is not suitable for the security of big data over cloud-based data transmission. Thus, this article presents the novel African Buffalo-based Elapid Crypto Model (AB-ECM) method for monitoring and securing the data while transferring it to the receiver. Here, the large amount of data from the cloud is compressed by the two-stage compression approach. Then, the system's security has been enhanced by the auditing phase; if the secret key of both auditing stages in the sender and receiver is the same, then only the data is decrypted. The execution of this secure process is done in the MATLAB Platform. The simulation consequences of the proposed system have been compared with the conventional methods in terms of confidential rate, data transfer rate, encryption time, resource usage, and decryption time. The comparison shows that the developed model has attained the finest security function over the existing techniques. [ABSTRACT FROM AUTHOR]

Recently, Wireless Sensor Network (WSN) becomes most potential technologies for providing improved services to several data gathering and tracking applications. Because of the wireless medium, multi-hop communication, absence of physical protectivity, and accumulated traffic, WSN is highly vulnerable to security concerns. Therefore, this study explores a specific type of DoS attack identified as a selective forwarding attack where the misbehaving node in the network drops packet on a selective basis. It is challenging to determine if packet loss is caused by a collision in the medium access path, poor channel quality, or a selective forwarding assault. Identifying misbehaving nodes at the earliest opportunity is an acceptable solution for performing secure routing in such networks. As a result, in this study effort, we present a unique Modified Ad Hoc On-Demand Distance Vector (AODV) Routing protocol depending upon the One time password (OTP) method that employs the RSA algorithm. Finally, a trust evaluation process determines which approach is the most optimal. According to the simulation findings of the suggested routing protocol and comparison with existing routing protocols provided in this article, the proposed work is both efficient and cost-effective. [ABSTRACT FROM AUTHOR]

Abstract Background The Internet of things (IoT) is the network of different objects or “things” containing sensors, software, and other technologies used to exchange data between devices and systems over the cloud. Such systems and networks should be provided with a proper cryptographic methodology to block unauthorized data transmission access. This issue is considered an essential challenge of resources that are shared on the data communication network, that is its security. So, in this study, a cryptosystem is proposed to maintain the security level of such systems with a new idea depending on DNA cryptography and DNA mixing. Results In this study, the proposed cryptosystem is based on the RSA algorithm and DNA cryptography concepts with a novel idea for mixing DNA strands obtained from encoding medical image and report to enhance the security level through the IoT networks. This system achieved a proper result in reconstructing images with high quality. The similarity between the original data and the restored one reached 92% through 18 s. Conclusions Such a proposed cryptosystem provided the feasibility of data security in network security, especially for E-health care through IoT system to help medical teamwork in handling medical data between hospitals safely. The result showed that RSA is a fast, efficient algorithm that can be utilized safely in cryptography schemes.

Solar systems connected to the grid are crucial in addressing the global energy crisis and meeting rising energy demand. The efficiency of these systems is totally impacted by varying weather conditions such as changes in irradiance and temperature throughout the day. Additionally, partial shading (PS) adds to the complexity of the nonlinear characteristics of photovoltaic (PV) systems, leading to significant power loss. To address this issue, maximum power point tracking (MPPT) algorithms have become an essential component in PV systems to ensure optimal power extraction. This paper introduces a new MPPT control technique based on a novel reptile search optimization algorithm (RSA). The effectiveness of the proposed RSA method is evaluated under different weather conditions with varying irradiance and partial shading. The results of the RSA algorithm are compared to other existing bio-inspired algorithms and show superior performance with an average efficiency of 99.91%, faster dynamic response of 50 ms, and less than 20 watts of oscillation. The RSA-MPPT based technique provides higher efficiency, faster settling time, and minimal oscillation around the maximum power point (MPP), making it a reliable solution for effective solar power harvesting. [ABSTRACT FROM AUTHOR]

University and college laboratories are important places to train professional and technical personnel. Various regulatory departments in colleges and universities still rely on traditional laboratory management in research projects, which are prone to problems such as untimely information and data transmission. The present study aimed to propose a new method to solve the problem of data islands, explicit ownership, conditional sharing, data safety, and efficiency during laboratory data management. Hence, this study aimed to develop a data-centered lab management system that enhances the safety of lab data management and allows the data owners of the labs to control data sharing with other users. The architecture ensures data privacy by binding data ownership with a person using a key management method. To achieve data flow safely, data ownership conversion through the process of authorization and confirmation was introduced. The designed lab management system enables laboratory regulatory departments to receive data in a secure form by using this platform, which could solve data sharing barriers. Finally, the proposed system was applied and run in different server environments by implementing data security registration, authorization, confirmation, and conditional sharing using SM2, SM4, RSA, and AES algorithms. The system was evaluated in terms of the execution time for several lab data with different sizes. The findings of this study indicate that the proposed strategy is safe and efficient for lab data sharing across domains. [ABSTRACT FROM AUTHOR]

In order to enhance the cyber-security of networked control systems, Kogiso and Fujita (2015) proposed a concept of controller encryption using homomorphic encryption for the first time. Encrypted linear controllers using a homomorphic encryption scheme could conceal the information processed inside the controller device and maintain the original functions of controllers. In this paper, we propose a scheme to encrypt the linear controller using the BGN encryption, which supports homomorphic addition and multiplication. We also compare the efficiency of this scheme with the scheme with an encrypted controller using RSA encryption and Paillier encryption. [ABSTRACT FROM AUTHOR]

The advent of quantum computing threatens blockchain protocols and networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies and other digital assets that rely on blockchain ledgers as well as thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in these public and immutable ledgers. The quantum threat and some potential solutions are well understood and presented in the literature. However, most proposals are theoretical, require large QKD networks, or propose new quantum-resistant blockchain networks to be built from scratch. Our work, which is presented in this paper, is pioneer in proposing an end-to-end framework for post-quantum blockchain networks that can be applied to existing blockchain to achieve quantum-resistance. We have developed an open-source implementation in an Ethereum-based (i.e., EVM compatible) network that can be extended to other existing blockchains. For the implementation we have (i) used quantum entropy to generate post-quantum key pairs, (ii) established post-quantum TLS connections and X.509 certificates to secure the exchange of information between blockchain nodes over the internet without needing a large QKD network, (iii) introduced a post-quantum second signature in transactions using Falcon-512 post-quantum keys, and (iv) developed the first on-chain verification of post-quantum signatures using three different mechanisms that are compared and analyzed: Solidity smart-contracts run by the validators for each transaction, modified EVM Opcode, and precompiled smart contracts. [ABSTRACT FROM AUTHOR]

Lattice attacks can compromise the security of encryption algorithms used in blockchain networks, allowing attackers to tamper with transaction records, steal private keys, and execute other forms of attacks. With symmetric encryption, both parties can encrypt and decrypt messages using the same key. Lattice attacks on digital signature algorithms (ECDSA) involve forming a basis and setting a target vector from signatures, then solving the closest vector problem (CVP) or shortest vector problem (SVP) in the generated lattice to obtain the private key. Prior research focused on obtaining leakage information from the signature's random nonce to facilitate a CVP or SVP solution. This study establishes a clear boundary for a successful ECDSA attack and introduces a "double basis" lattice version that expands the boundary or reduces the necessary signatures by nearly half with the same lattice rank. To approach the boundary, a heuristic strategy is employed to shift the target vector in different directions with a feasible step size, using tests on the Trusted Platform Module (TPM) 2.0 ECDSA. The distance from the closest moved target vector to the boundary is reduced by a ratio of 424 to 179 to the minimal length of orthogonal vectors in the formed basis. Experimental results show that moving attempts in two directions with the original basis and 84 signatures take approximately 247.7 s on the experiment computer. [ABSTRACT FROM AUTHOR]

Steganography is the practice of hiding data, such as images, videos, or text, within a cover image without it being detectable by the human eye. Several factors, such as the capacity, security, and robustness of the technique, are essential when transferring information using this method. In this study, we propose a new approach to image steganography that improves the Least Significant Bit (LSB) technique by utilizing images of 24 bits in each pixel. Improving the capacity and security of LSB-based steganography requires a combination of techniques, such as indirect embedding, embedding in multiple channels, and applying cryptographic and compression techniques. This approach conducts by encrypting each compressed secret message bit with the most significant bit of the red channel and then saving the output bit (hidden bit) in the least significant bit of the (green/blue) channel according to the row value (odd/ even). To further security, the suggested approach uses multi-level encryption; employs RSA to encrypt the secret message before applying the Huffman compression and encrypting the hidden bit by (XOR/XNOR) in the embedding method based on the row value of the pixel. Meanwhile, it is planned to use the Huffman coding technique to shorten the length of the encrypted message that will be inserted in the cover image. For the color photos in this work, the standard images were acquired from a standard dataset (USC-SIPI). The suggested approach performs better when measured in terms of mean square error (MSE), peak signalto- noise ratio (PSNR), and comparison to findings from related prior efforts. [ABSTRACT FROM AUTHOR]

With the rapid development of mobile Internet, high-definition video and cloud computing, users' bandwidth demands are not only larger and larger but also more and more diverse. To solve this problem, there searchers put forward the concept of elastic optical network (EON). EON adopts the transmission mode of elastic grid, which can allocate spectrum resources flexibly and meet high bandwidth and diversity requirements at the same time. Routing and spectrum allocation (RSA) is an important issue in EON. In this paper, we present a heuristic algorithm named constrained-lower-indexed-block (CLIB) allocation algorithm for the RSA problem. The algorithm is based on the K candidate paths. When there are available spectrum blocks on multiple candidate paths, if the increase of the path length does not exceed a given threshold, the lower index spectrum would be selected for the connection request on a longer path. The aim of the algorithm is to concentrate the occupied frequency slices on one side of the spectrum and leave another side of the spectrum to the later arrived connection requests as much as possible, to reduce the blocking probability of connection requests. Simulation results show that comparing with the first-last-fit and hybrid grouping algorithms, the CLIB algorithm can reduce the blocking probability of connection requests. [ABSTRACT FROM AUTHOR]

In the field of cryptography, many algorithms rely on the computation of modular multiplicative inverses to ensure the security of their systems. In this study, we build upon our previous research by introducing a novel sequence, (z j) j ≥ 0 , that can calculate the modular inverse of a given pair of integers (a , n) , i.e., a − 1 ; m o d , n . The computational complexity of this approach is O (a) , which is more efficient than the traditional Euler's phi function method, O (n , ln , n) . Furthermore, we investigate the properties of the sequence (z j) j ≥ 0 and demonstrate that all solutions of the problem belong to a specific set, I , that only contains the minimum values of (z j) j ≥ 0 . This results in a reduction of the computational complexity of our method, especially when a ∼ n and it also opens new opportunities for discovering closed-form solutions for the modular inverse. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a new technology that has drawn interest from both industry and academia in the modern digital era. The IoT provides a platform for any device to connect and share data over the Internet. Because of the diverse IoT environment and resource-constrained IoT devices, this nascent technology has numerous security challenges. Due to the lack of fine-grained access control and flexibility, traditional cryptographic algorithms such as private key encryption and public-key encryption are not suitable for providing access control mechanisms. ABE (Attribute-Based Encryption) is a new cryptographic approach that not only provides security but also fine-grained access control. This paper provides a comprehensive survey of ABE and its various forms, such as key policy ABE and ciphertext policy ABE, based on access structure, multi-authority, and hierarchy features. Further access structures used in ABE and applications of the ABE technique in IoT are also discussed. A comparison of different ABE schemes is presented regarding features, efficiency, and security. In addition, numerous schemes are analyzed to uncover obstacles, issues, and gaps that need to be investigated further. [ABSTRACT FROM AUTHOR]

Recently, cloud computing resources have become one of the trending technologies that permit the user to manage diverse resources and a huge amount of data in the cloud. Task scheduling is considered one of the most significant challenges and ineffective management results in performance degradation. It is necessary to schedule the task effectively with maximum resource utilization and minimum execution time. Therefore, this paper proposes a novel technique for effective task scheduling with enhanced security in the cloud computing environment. A novel convolutional neural network optimized modified butterfly optimization (CNN-MBO) algorithm is proposed for scheduling the tasks, thereby maximizing the throughput and minimizing the makespan. Secondly, a modified RSA algorithm is employed to encrypt the data, thereby providing secure data transmission. Finally, our proposed approach is simulated under a cloudlet simulator and the evaluation results are analyzed to determine its performance. In addition to this, the proposed approach is compared with various other task scheduling-based approaches for various performance metrics, namely, resource utilization, response time, as well as energy consumption. The experimental results revealed that the proposed approach achieved minimum energy consumption of 180 kWh, a minimum response time of the 20 s, a minimum execution time of 0.43 s, and maximum utilization of 98% for task size 100. [ABSTRACT FROM AUTHOR]

Cloud file sharing (CFS) has become one of the important tools for enterprises to reduce technology operating costs and improve their competitiveness. Due to the untrustworthy cloud service provider, access control and security issues for sensitive data have been key problems to be addressed. Current solutions to these issues are largely related to the traditional public key cryptography, access control encryption or attribute-based encryption based on the bilinear mapping. The rapid technological advances in quantum algorithms and quantum computers make us consider the transition from the tradtional cryptographic primitives to the post-quantum counterparts. In response to these problems, we propose a lattice-based Ciphertext-Policy Attribute-Based Encryption(CP-ABE) scheme, which is designed based on the ring learing with error problem, so it is more efficient than that designed based on the learing with error problem. In our scheme, the indirect revocation and binary tree-based data structure are introduced to achieve efficient user revocation and dynamic management of user groups. At the same time, in order to further improve the efficiency of the scheme and realize file sharing across enterprises, the scheme also allows multiple authorities to jointly set up system parameters and manage distribute keys. Furthermore, by re-randomizing the user's private key and update key, we achieve decryption key exposure resistance(DKER) in the scheme. We provide a formal security model and a series of security experiments, which show that our scheme is secure under chosen-plaintext attacks. Experimental simulations and evaluation analyses demonstrate the high efficiency and practicality of our scheme. [ABSTRACT FROM AUTHOR]

• The effect of synchronisation on the master-slave NNs with time delay is examined. • The NN's chaotic attractor is reconstructed using the fractal interpolation. • Reconstructed chaotic sequence is applied in image encryption. • Image encryption is carried out using RSA algorithm. • Various statistical measures are used to verify the efficacy. This paper examines synchronization of delayed chaotic neural networks with impulsive control, event-triggered impulsive control, and event-triggered delayed impulsive control. Lyapunov-based event-triggered mechanism is constructed to derive few sufficient conditions in terms of Linear Matrix Inequalities (LMIs). The feedback and event-triggered gain matrices are evaluated with the help of numerical packages. The fractal interpolation functions are employed to reconstruct the chaotic sequence of the neural networks since the chaotic attractor has self-similar properties and coincides with the fractal functions. In this study, a linear fractal interpolation is used to reconstruct both the master-slave chaotic attractor and the encrypted chaotic attractor, with optimized scaling factors. Finally, an application of the image encryption algorithm is given in terms of RSA public-key cryptosystems, permutation, and finite field diffusion for the chaotic sequence generated by fractal interpolation functions. [ABSTRACT FROM AUTHOR]

Mobile Crowd Sensing (MCS) is an effective way to tackle day-to-day life problems nowadays, from Google Maps to Uber cabs. It is an effective and efficient way of data collection, processing and delivery of results to the users, from the users and for the users. All the entities that make up a Mobile crowd sensing system be it a worker, requester or miner can be represented as a node. All the nodes interact together to make a trustworthy system where there is a limited or no scope of deception. The traditional approach to crowd sensing gives little importance to communication between the nodes and in most cases, it assumes the communication happens through a secure channel and ignores the potential hazards. We propose a novel blockchain-based decentralized and collaborative approach to communicate between the nodes which would help workers/users to interact in real-time and solve conflicts should there be any. To decentralize we use the blockchain technology to overcome single point of failure which is a major issue, as mentioned peer-to-peer link between nodes is more expensive only but it improvise the security and privacy concerns by using the consensus mechanism. With the aim of improving the traditional communication technology between the nodes, we propose a mechanism based on Kafka, blockchain and RSA encryption for continuous exchange of data between the nodes which would help to enhance the security and efficiency of the system. [ABSTRACT FROM AUTHOR]