Search

Since the RSA public key cryptosystem was proposed, it has been widely used because of its strong security. Although the proposal of the Shor's algorithm offers hope for cracking RSA, it is debatable whether the algorithm can actually pose a threat in practice. From the perspective of the quantum circuit of the Shor's algorithm, we analyse the feasibility of cracking RSA with improved quantum circuits using an ion-trap quantum computer. We present an improved quantum circuit for the modular exponentiation of a constant, which is the most expensive operation in Shor's algorithm for integer factorization. Whereas previous studies mostly focused on minimizing the number of qubits or the depth of the circuit, we minimize the number of CNOTs, which greatly affects the time to run the algorithm on an ion-trap quantum computer. First, we give the implementation of the basic arithmetic with the lowest known number of CNOTs and the construction of an improved modular exponentiation of a constant by accumulating intermediate data and using a windowing technique. Then, we precisely estimate the number of improved quantum circuits needed to perform the Shor's algorithm for factoring an n -bit integer, which is 217 n 3 / log 2 n + 4 n 2 + n. We analyse the running time and feasibility of the Shor's algorithm on an ion-trap quantum computer according to the number of CNOTs. Finally, we discussed the lower bound of the number of CNOTs needed to implement the Shor's algorithm. [ABSTRACT FROM AUTHOR]

Cyberphysical systems connect physical devices and large private network environments in modern communication systems. A fundamental worry in the establishment of large private networks is mitigating the danger of transactional data privacy breaches caused by adversaries using a variety of exploitation techniques. This study presents a privacy-preserving architecture for ensuring the privacy and security of transaction data in large private networks. The proposed model employs digital certificates, RSA-based public key infrastructure, and the blockchain to address user transactional data privacy concerns. The model also guarantees that data in transit remains secure and unaltered and that its provenance remains authentic and secure during node-to-node interactions within a large private network. The proposed model has increased the encryption speed by about 17 times, while the decryption process is expedited by 4 times. Therefore, the average overall acceleration obtained was 16.5. Both the findings of the security analysis and the performance analysis demonstrate that the proposed model can safeguard transactional data during communications on large private networks more effectively and securely than the existing solutions. [ABSTRACT FROM AUTHOR]

In recent times, the security of sensor networks, especially in the field of IoT, has become a priority. This article focuses on the security features of the Zigbee protocol in Xbee devices developed by Digi International, specifically in the Xbee 3 (XB3-24) devices. Using the TI LaunchXL-CC26X2R1 kit, we intercepted and analyzed packets in real-time using the Wireshark application. The study encompasses various stages of network formation, packet transmission and analysis of security key usage, considering scenarios as follows: without security, distributed security mode and centralized security mode. Our findings highlight the differences in security features of Xbee devices compared to the Zigbee protocol, validating and invalidating methods of establishing security keys, vulnerabilities, strengths, and recommended security measures. We also discovered that security features of the Xbee 3 devices are built around a global link key preconfigured therefore constituting a vulnerability, making those devices suitable for man-in-the-middle and reply attacks. This work not only elucidates the complexities of Zigbee security in Xbee devices but also provides direction for future research for authentication methods using asymmetric encryption algorithms such as digital signature based on RSA and ECDSA. [ABSTRACT FROM AUTHOR]

We present a linear-time, space and communication data-oblivious algorithm for securely merging two private, sorted lists into a single sorted, secret-shared list in the two party setting. Although merging two sorted lists can be done insecurely in linear time, previous secure merge algorithms all require super-linear time and communication. A key feature of our construction is a novel method to obliviously traverse permuted lists in sorted order. Our algorithm only requires black-box use of the underlying additively homomorphic cryptosystem and generic secure computation protocols for comparison and equality testing. [ABSTRACT FROM AUTHOR]

RSA is a well-known cryptosystem in Modern Cryptography and its efficiency is based on the hardness of the Integer Factorization problem. The algorithm is shown to be vulnerable to several attacks in a number of special scenarios with assumptions. In this paper, the strength of RSA is investigated if the primes in the modulus are close and the same modulus is used for two instances. The attack is highly efficient compared to other known attacks which are only concentrated on either closeness of the primes or the same modulus used for two or more instances. This attack examines the closeness of the primes chosen whenever the RSA system is used for two instances with the same modulus. The LLL algorithm is used to obtain the bound, and the bound is highly efficient compared to other known attacks. [ABSTRACT FROM AUTHOR]

Protecting digital data, especially digital images, from unauthorized access and malicious activities is crucial in today's digital era. This paper introduces a novel approach to enhance image encryption by combining the strengths of the RSA algorithm, homomorphic encryption, and chaotic maps, specifically the sine and logistic map, alongside the self-similar properties of the fractal Sierpinski triangle. The proposed fractal-based hybrid cryptosystem leverages Paillier encryption for maintaining security and privacy, while the chaotic maps introduce randomness, periodicity, and robustness. Simultaneously, the fractal Sierpinski triangle generates intricate shapes at different scales, resulting in a substantially expanded key space and heightened sensitivity through randomly selected initial points. The secret keys derived from the chaotic maps and Sierpinski triangle are employed for image encryption. The proposed scheme offers simplicity, efficiency, and robust security, effectively safeguarding against statistical, differential, and brute-force attacks. Through comprehensive experimental evaluations, we demonstrate the superior performance of the proposed scheme compared to existing methods in terms of both security and efficiency. This paper makes a significant contribution to the field of digital image encryption, paving the way for further exploration and optimization in the future. [ABSTRACT FROM AUTHOR]

The internet of things (IoT) faces significant obstacles due to insufficient identity recognition and evolving network architecture, leading to concerns about the confidentiality of data and causing anxiety. The attribute-based encryption (ABE) techniques have recently been considered a solution to guarantee the security of data transfer and precise data sharing. However, most of the existing methods used the attribute-based encryption (ABE) technique, which requires a lot of computation power and is unsuitable for IoT devices with minimal resources. Researchers have achieved improvements in establishing practical methods for cloud security on mobile IoT devices using lightweight ABE. In this paper, the ciphertext policy-revocable and searchable attribute-based encryption (CP-RSABE) method is proposed to protect privacy and security. The proposed methods greatly lower the cost of computing IoT devices with the availability of multiple-keyword searchers for the users of data. The user's side of computation is very efficient, and the cloud server handles most of the computing tasks. The proposed method performs significantly better in terms of ciphertext size, decryption time, and parameter size. The method achieves data security, privacy preservation, and mobile terminal operations that are suitable for applications of IoT methods. The existing methods such as online/offline multi authority-ABE with cryptographic reverse firewalls (OO-MA-ABE-CRF), ciphertext policy ABE (CP-ABE), ABE with full privacy protection (ABE-FPP) are used to justify the effectiveness of CP-RSABE method. The proposed method CP-RSABE achieves the encryption time (0.0163s), decryption time (0.25s), communication overhead (3.4KB), size of secret key (5.1KB), and size of ciphertext (10.7KB) compared to the OO-MA-ABE-CRF, CP-ABE, ABE-FPP. [ABSTRACT FROM AUTHOR]

Fog computing accredits by utilizing the network edge while still rendering the possibility to interact with the cloud. Nevertheless, the features of fog computing are encountering several security challenges. The security of end users and/or fog servers brings a significant dilemma in implementing fog computing. The computational power of the resources constrains Internet of Things (IoT) devices in the fog-computing environment. Therefore, an attacker can easily attack. The traditional methods like attribute-based encryption (ABE) techniques are inappropriate for resource-constraint devices with protracted computing and limited computational capabilities. In this regard, we investigate a multiauthority ciphertext policy-attribute-based encryption (MA-CP-ABE) method that enables multiauthority attribute revocation and computation outsourcing. Moreover, the encryption and decryption processes of resource-constraint IoT devices are outsourced to the fog nodes. In this way, it also reduces the computational burden of the resource-constraint IoT devices. Hence, we propose MA-CP-ABE for encryption and decryption, attribute revocation and outsourcing by reducing the computational burden and securing the system. We compare the computational offloading approach with the existing techniques to prove that the proposed approach outperforms the existing approaches. The proposed method reduces the operation time for the encryption and decryption process. We outsource cryptography operations to the fog node, reducing the end user's computational cost. Eventually, simulated outcomes are used to assess the algorithm's computational cost. [ABSTRACT FROM AUTHOR]

In public-key cryptography, the RSA algorithm is an inevitable part of hardware security because of the ease of implementation and security. RSA Cryptographic algorithm uses many modular arithmetic operations that decide the overall performance of the architecture. This paper proposes VLSI architecture to implement an RSA public-key cryptosystem driven by the Residue Number System (RNS). Modular exponentiation in the RSA algorithm is executed by dividing the entire process into modular squaring and multiplication operations. Based on the RNS employment in modulo-exponential operation, two RSA architectures are proposed. A Verilog HDL code is used to model the entire RSA architecture and ported in Zynq FPGA (XC7Z020CLG484-1) for Proof of Concept (PoC). The Cadence Genus Synthesizer tool characterizes a system's performance for TSMCs standard Cell library. Partial RNS (Proposed-I)- and Fully RNS (Proposed-II)-based RSA architectures increase the operation speed by 13% and 35%, respectively, compared with the existing RSA. Even though there is an increase in parameters like area, power and PDP for a smaller key size, the improvement in area utilization and encryption/ decryption speed of RSA for a larger key size is evident from the analysis. [ABSTRACT FROM AUTHOR]

Over the last decade, millions of 4G and 5G-enabled mobile devices have become part of the Internet. Almost, all the applications have been shifted to smartphones. A person connects his smartphone to several other devices or remote servers for exchanging sensitive data. In this sense, security threats in terms of authentication, data confidentiality, and data integrity are increasing day by day for mobile devices. The asymmetric key cryptosystem is considered more secure, but it is heavyweight for smart devices on the basis of computation and communication costs. The symmetric key cryptosystem is considered lightweight for smart devices in terms of computation and communication overheads, but it is vulnerable to several attacks such as MITM attacks. Several symmetric key security systems have been proposed for smart devices but adopt complex mathematical procedures. Therefore, existing symmetric key security systems increase the computation and communication overheads. In this paper, we propose a lightweight and authentic symmetric key cryptosystem for resource-constrained mobile client–server environments. Our proposed cryptosystem consists of a lightweight symmetric session key exchange algorithm, mutual authentication service, and data confidentiality service, respectively. Moreover, we prove the robustness of our proposed cryptosystem with the help of informal and formal security analysis through the AVISPA tool. In addition, performance evaluation and comparisons with existing security systems show that our proposed cryptosystem is efficient, lightweight, secure, and most suitable for mobile computing. [ABSTRACT FROM AUTHOR]

The modern world is rapidly changing towards a novel era of technology, where not only human beings but devices are also being connected to each other with the inherent ability of communication advancements. With the evolution of social media and Internet-based applications, a large amount of information flows through communication channels and discloses numerous vulnerabilities. Cisco Inc. forecasted that approximately 50 billion devices will be linked through the Internet by 2021 termed as the Internet of Things (IoT) across the world. Typically, IoT devices are designed to collect and share sensitive information which opens a new kind of challenge in the area of security and privacy. These devices are inefficient to perform present security-based algorithms such as RSA due to the limited number of resources associated with it. This paper presents an RSA algorithm based Efficient Improved Digital Signature Algorithm (RSAEDSA) for the IoT environment. The proposed algorithm is designed to provide a secure and efficient communication mechanism for IoT-connected devices. Meanwhile, it also addresses the limitations of traditional RSA algorithms in terms of resource usage, parameter optimization, etc. The analysis of the proposed RSAEDSA algorithm shows its effectiveness which highlights the improvements in the security measures and quality of service (QoS) in the IoT environment. The simulated results show the performance superiority of RSAEDSA over the traditional methods with respect to the QoS parameters. [ABSTRACT FROM AUTHOR]

The reptile search algorithm (RSA) is a dynamic and effective meta-heuristic algorithm inspired by the behavior of crocodiles in nature and the way of hunting prey. Unlike other crawler search algorithms, it uses four novel mechanisms to update the location of the solutions, such as walking at high or on the belly, and hunting in a coordinated or cooperative manner. In this algorithm, the total number of iterations is divided into four intervals, and different position-updating strategies are used to make the algorithm easily fall into the local optimum. Therefore, an improved reptile search algorithm based on a mathematical optimization accelerator (MOA) and elementary functions is proposed to improve its search efficiency and make it not easily fall into local optimum. MOA was used to realize the switching of RSA's four searching modes by introducing random perturbations of six elementary functions (sine function, cosine function, tangent function, arccosine function, hyperbolic secant function and hyperbolic cosecant function), four mechanisms are distinguished by random number instead of the original RSA algorithm's inherent four mechanisms by iteration number, which increases the randomness of the algorithm and avoids falling into local optimum. The random perturbations generated by elementary functions are added to the variation trend of parameter MOA to improve the optimization accuracy of the algorithm. To verify the effectiveness of the proposed algorithm, 30 benchmark functions in CEC2017 were used for carrying out simulation experiments, and the optimization performance was compared with BAT, PSO, ChOA, MRA and SSA. Finally, two practical engineering design problems are optimized. Simulation results show that the proposed sechRSA has strong global optimization ability. [ABSTRACT FROM AUTHOR]

This article proposes a new method to inject backdoors in RSA (the public-key cryptosystem invented by Rivest, Shamir, and Adleman) and other cryptographic primitives based on the integer factorization problem for balanced semi-primes. The method relies on mathematical congruences among the factors of the semi-primes based on a large prime number, which acts as a "designer key" or "escrow key". In particular, two different backdoors are proposed, one targeting a single semi-prime and the other one a pair of semi-primes. This article also describes the results of tests performed on a SageMath implementation of the backdoors. [ABSTRACT FROM AUTHOR]

Electronic commerce(E-commerce) transactions require secure communication to protect sensitive information such as credit card numbers, personal identification, and financial data from unauthorized access and fraud. Encryption using public key cryptography is essential to ensure secure electronic commerce transactions. RSA and Rabin cryptosystem algorithms are widely used public key cryptography techniques, and their security is based on the assumption that it is computationally infeasible to factorize the product of two large prime numbers into its constituent primes. However, existing variants of RSA and Rabin cryptosystems suffer from issues like high computational complexity, low speed, and vulnerability to factorization attacks. To overcome the issue, this article proposes a new method that introduces the concept of fake-modulus during encryption. The proposed method aims to increase the security of the Rabin cryptosystem by introducing a fake-modulus during encryption, which is used to confuse attackers who attempt to factorize the public key. The fake-modulus is added to the original modulus during encryption, and the attacker is unable to distinguish between the two. As a result, the attacker is unable to factorize the public key and cannot access the sensitive information transmitted during electronic commerce transactions. The proposed method's performance is evaluated using qualitative and quantitative measures. Qualitative measures such as visual analysis and histogram analysis are used to evaluate the proposed system's quality. To quantify the performance of the proposed method, the entropy of a number of occurrences for the pixels of cipher text and differential analysis of plaintext and cipher text is used. When the proposed method's complexity is compared to a recent variant of the Rabin cryptosystem, it can be seen that it is more complex to break the proposed method—represented as O (ɲ ×   τ)   which is higher than Rabin-P ( O (ɲ)) algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new scheme based on ephemeral elliptic curves over a finite ring with an RSA modulus. The new scheme is a variant of both the RSA and the KMOV cryptosystems and can be used for both signature and encryption. We study the security of the new scheme and show that it is immune to factorization attacks, discrete-logarithm-problem attacks, sum-of-two-squares attacks, sum-of-four-squares attacks, isomorphism attacks, and homomorphism attacks. Moreover, we show that the private exponents can be much smaller than the ordinary exponents in RSA and KMOV, which makes the decryption phase in the new scheme more efficient. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) networks are the most prone to internal as well as external attacks in addition to energy consumption problems. Conventional security solutions are not able to address these issues effectively due to the limited resources of sensor nodes participating in IoT communications. In this work, an Efficient and Secure Fog Based Routing Mechanism (ESFRM) is proposed to protect the network from faulty internal as well as external attacks. Every node participating in IoT communications calculates the comprehensive trust value of the next intermediate node which is the addition of direct trust, indirect trust and energy trust values before forwarding the data. This comprehensive trust value is then compared with the comprehensive threshold trust value to decide whether the particular node is a rogue node or a valid normal node. Further, an enhanced RSA (Rivest, Shamir, Adleman) algorithm is implemented to provide three levels of data security from Cluster Head (CH) to fog node, from fog node to cloud server and directly from CH to cloud server. For this purpose, an efficient CH selection technique is also proposed in this work. The proposed methodology is compared with the Secure Energy-efficient Fog-based Routing (SEFR) protocol and Trust-aware Secure Routing Protocol (TSRP). The evaluation results show that the proposed ESFRM outperforms the conventional schemes with respect to energy consumption, malicious node detection and transmission rate. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles have found applications in fields such as environmental monitoring and the military. Although the collected data in some of these application domains are sensitive, public channels are deployed during the communication process. Therefore, many protocols have been presented to preserve the confidentiality and integrity of the exchanged messages. However, numerous security and performance challenges have been noted in the majority of these protocols. In this paper, an elliptic curve cryptography (ECC) and symmetric key-based protocol is presented. The choice of ECC was informed by its relatively shorter key sizes compared to other asymmetric encryption algorithms such as the Rivest–Shamir–Adleman (RSA) algorithm. Security analysis showed that this protocol provides mutual authentication, session key agreement, untraceability, anonymity, forward key secrecy, backward key secrecy, and biometric privacy. In addition, it is robust against smart card loss, password guessing, known secret session temporary information (KSSTI), privileged insider, side-channeling, impersonation, denial-of-service (DoS), and man-in-the-middle (MitM) attacks. The comparative performance evaluation showed that it has relatively low computation, storage, and communication complexities. [ABSTRACT FROM AUTHOR]

Due to the improvement in power demand usage, the system causes more stress. Suitable placement of FACTS is introduced to improve power flows, stability, and power system security. An advanced optimal method has been introduced to resolve optimal power flow under various conditions. Five varied FACTS devices were positioned inside the power system to improve system safety at the least cost. Selecting the suitable location and size of FACTS device enabling high security and less cost was proposed using RSA. The objective functions were mitigated based on the RSA's inspiration to improve system security. The placement of the FACTS compensator was based on objective functions like LOSI, voltage deviation, real power loss, investment cost, sensitivity index, fuel costs, and constraints. The proposed model was validated under three conditions, namely generator outage, line outage, and both outage in IEEE 118 and IEEE 30 bus‐systems. In the IEEE 30 bus system, TCSC provides better security of 1.4 severity at normal conditions and 1.3 severity in contingency conditions. In the IEEE 118 bus system, UPFC has less severity of 2.4 at normal conditions, and STATCOM has the least severity of 3 at contingency conditions. The proposed model provides enhanced security in all circumstances and reduces overall costs. [ABSTRACT FROM AUTHOR]

Aiming at the quantum algorithm which can solve the problem of large integer decomposition and discrete logarithm in polynomial time, an anti-quantum computing key management scheme for clustered sensor networks is proposed in this paper. The lattice-based cryptosystem is used to achieve the anti-quantum performance of the key management scheme, and the security of the network is further improved through the mutual authentication of sensor network nodes. Due to the limited storage space of sensor nodes, this paper adopts the cluster management of wireless sensor networks, and most sensor nodes only need a small amount of storage space, thus reducing the deployment cost. Cluster management is suitable for medium and large-scale deployment of sensor networks. Because the data traffic is much larger than that of mutual authentication, the sensor nodes in wireless sensor networks use symmetric keys to communicate with each other after mutual authentication, which can effectively improve the communication efficiency in the case of frequent data communication. Experiments show that the authentication scheme based on lattice cryptosystem proposed in this paper will not improve with the continuous improvement of the security level, and its authentication scale will maintain a relatively stable state, while the algorithm scheme based on RSA will increase the authentication cost with the continuous improvement of the security level, so the scheme proposed in this paper is more suitable for application in the environment with high security level. This scheme can effectively reduce the cost of mutual authentication of sensor nodes, is conducive to the expansion of the network, and can ensure the security of authentication between sensor nodes even in the post-quantum era. [ABSTRACT FROM AUTHOR]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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.

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]