Search

In this paper, we propose a centralized SDN network architecture under a smart factory for the problems under the traditional industrial IoT architecture and carry out the security analysis of industrial IoT to improve the performance of the smart factory network. Briefly describing the industrial SDN network architecture, combined with the design of a blockchain system for smart factories, the hash algorithm and asymmetric encryption algorithm are introduced to anonymize and protect the data. For traditional SDN, propose a blockchain-based SDN and analyze the probability of state transfer between SDNs. In order to solve the security problem at the SDN control level, the blockchain-based distributed SDN control model is proposed, and the PBFT consensus algorithm is introduced to realize the blockchain consensus-based multi-controller decision-making model. Add the MD5 algorithm and compare its performance with the SHA256 algorithm. Set up Adder modules with different bit widths and CSA Tree modules with different bases to calculate the encryption time of the RSA algorithm for various combinations. Set up simulation experiments to compare different malicious nodes and the average trust value of the consensus mechanism proposed in this paper for abnormal nodes in an SDN multi-controller. From the results, it can be seen that the computational speed of the RSA system is the fastest for the system implemented by Montgomery’s algorithm in base 16 and bit width 32 bits, and the time to complete the encryption process of 1024 bits once is only 0.97 ms. However, when the number of nodes is controlled in [0~5000], the rejection rate of abnormal nodes by the PBFT consensus algorithm in this paper basically maintains at about 92%. The consensus node designed and proposed in this paper is able to reject error nodes effectively and effectively secure the SDN smart factory network architecture.

With the deepening of digital development, the security protection of databases becomes more important while carrying out the digital transformation of party-building work in colleges and universities. In this study, for the database security in the party building work in colleges and universities, the protection framework of database security protection and the database hierarchical protection system based on the party building work in colleges and universities are constructed according to the needs of data hierarchical security protection. Then, on the basis of the intrusion tolerance mechanism, a database security monitoring system is established using a voting algorithm, and a multilevel information access control method is proposed for hierarchical protection. On this basis, an encryption protection mechanism based on the RSA algorithm is proposed for the sensitive information in the database of university party-building work. Through the empirical analysis of the security mechanism of counterattack protection of the university party building database, it is known that the security of the system in this paper and the probability of normal operation are both greater than 99%, and the likelihood of danger is 0.000002%. In the application of party building work, the data security of the three kinds of business is still maintained above 99.6%. The encryption time consumed is not more than 525ms, which shows that the database hierarchical protection security mechanism system constructed in this paper can meet the requirements of database security in the party building work in colleges and universities and provide a reliable guarantee for the security of the party building work database.

Ghost imaging technology has been widely used in the field of optical image encryption owing to its unique non-local imaging characteristics. However, there are some problems such as long encryption and decrypting time, poor reliability and large number of keys. To solve these problems, this paper proposed a computational ghost imaging encryption scheme based on RSA algorithm and wavelet transform. Firstly, the representation relationship between measurement matrix and random integer sequence is established to reduce the transmission of key quantity. Secondly, RSA encryption algorithm is used to improve the security of the system. Finally, using wavelet decomposition for packet transmission. In addition, the cake cutting matrix is used as the measurement matrix to reduce the sampling times and improve the quality of reconstructed images. The simulation results show that the encryption system has strong information transmission security and good robustness. It provides some reference for image encryption and information security transmission.

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.

Modular exponentiation is crucial for secure data exchange in cryptography, especially for resource-constrained Internet of Things (IoT) devices. These devices often rely on third-party servers to handle computationally intensive tasks like modular exponentiation. However, existing outsourcing solutions for the RSA algorithm may have security vulnerabilities. This work identifies a critical flaw in a recent outsourcing protocol for RSA proposed by Hu et al. We demonstrate how this flaw compromises the security of the entire RSA system. Subsequently, we propose a robust solution that strengthens the RSA algorithm and mitigates the identified vulnerability. Furthermore, our solution remains resilient against existing lattice-based attacks. The proposed fix offers a more secure and efficient way for IoT devices to leverage the power of third-party servers while maintaining data integrity and confidentiality. An extensive performance evaluation confirms that our solution offers comparable efficiency while significantly enhancing security compared to existing approaches.

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.

This article presents a performance comparison of two known public key cryptography techniques namely RSA (Rivest–Shamir–Adleman) and El-Gamal algorithms to encrypt/decrypt the speech signals during transferring over open networks. Specifically, this work is divided into two stages. The first stage is enciphering-deciphering the input speech file by employing the RSA method. The second stage is enciphering-deciphering the same input speech file by employing the El-Gamal method. Then, a comparative analysis is performed to test the performance of both cryptosystems using diverse experimental and statistical analyses for the ciphering and deciphering procedures like some known speech quality measures: histogram, spectrogram, correlation, differential, speed performance and noise effect analyses. The analyses outcomes reveal that the RSA and El-Gamal approaches are efficient and adequate for providing high degree of security, confidentiality and reliability. Additionally, the outcomes indicate that the RSA speech cryptosystem outperforms its counterpart the El-Gamal speech cryptosystem in most of ciphering/deciphering speech performance metrics.

Network safety has become an important issue in recent years. Encryption has been developed as a solution and plays an important role in the security of information systems. Many methods are required to secure the shared data. The advanced internet, networking firms, health information and the cloud applications have significantly increased our data every minute. The current work focuses on cryptography to provide the protection for sensitive data that exchanged between personal users, companies, organizations, or in the cloud applications and others during the transfer of data across the network. Firstly, Data sent from sender to network receiver must be encrypted using the cryptographic algorithm. Secondly, the recipient shows the original data using the decryption technique. This paper presents three encrypting algorithms such as AES, RSA and hybrid algorithms, and their efficiency is compared based on the analysis of the time. Results of the experiments show that the hybrid algorithm is better in term of security.

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, (zj)j≥0, that can calculate the modular inverse of a given pair of integers (a,n), i.e., a−1;mod,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 (zj)j≥0 and demonstrate that all solutions of the problem belong to a specific set, I, that only contains the minimum values of (zj)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.

This paper proposes a secure offline electronic (e-) payment scheme by adopting Schnorr's untraceable blind signature (BS). Thereby, to satisfy the essential security requirements of e-payment systems, it requires much more simple computations and becomes more practical than many existing schemes. Other considerations are: to prevent the forgery of e-coin, the Bank is only the lawful entity to produce the valid e-coin; and others can verify its correctness. To confirm no swindling, the e-coin owner also sticks her private signing key with the e-coin before spending it as the payment. Hence, through the commitment with challenge-response of Schnorr's BS, the merchant can verify the spent e-coin, and the trusted authority can identify the dishonest spender if multiple spending occurs. Moreover, it embeds three distinct information of date, namely expiration, deposit, and transaction dates with every e-coin. Thereby, it minimizes the size of the Bank's database, correctly calculates the interest of the e-coin, and helps in arbiter if multiple spending, respectively. Finally, it evaluates the performance and analyzes essential security requirements of the proposed scheme, plus studies a comparison with existing ones.

Network safety has become an important issue in recent years. Encryption has been developed as a solution and plays an important role in the security of information systems. Many methods are required to secure the shared data. The advanced internet, networking firms, health information and the cloud applications have significantly increased our data every minute. The current work focuses on cryptography to provide the protection for sensitive data that exchanged between personal users, companies, organizations, or in the cloud applications and others during the transfer of data across the network. Firstly, Data sent from sender to network receiver must be encrypted using the cryptographic algorithm. Secondly, the recipient shows the original data using the decryption technique. This paper presents three encrypting algorithms such as AES, RSA and hybrid algorithms, and their efficiency is compared based on the analysis of the time. Results of the experiments show that the hybrid algorithm is better in term of security.

As can be seen all around us, social media sites such as Facebook, Twitter, YouTube and Flickr and other became more importance grow rapidly in the last few years. This growth in social media sites has led to increase of information generated and circulated between individuals, this information significance in the companies and institutions works and also for individuals, for this it is important to analyze and classify data by determining keywords and main sentences which lead companies to manage their works more better with present and possibly clients. However, social media data may be contain various types of unwanted and maleficent spammer or hacker actions. So, there is a critical need in the social media network and society, industry for social media security. In this paper, we choose Apriori method for mining and classifying social media data and take a Facebook to be a case study for social media data then after classifying and mining data applying RSA algorithm which is most popular and easer to implement secure data and use it usefully in the company’s work.

In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that require multiple computations of modulo multiplicative inverses. In this paper, we describe the modulo operation and we recollect the main approaches to computing the modulus. Then, given a and n positive integers, we present the sequence (zj)j≥0, where zj=zj−1+aβj−n, a

The small Qubit quantum algorithm attack to RSA was proposed,the need Qubit of the first quantum register from 2L to L1,it can be reduced to 2 Qubit,the overall space complexity denoted (L1,L),where 2L1≥r,r is the period of decomposed.Because of the reduce of the first quantum register,it reduces the algorithm’s complexity and success rates,and use the binary look-up table method to compute the modular exponentiation,it enhances the computing speed.The improved algorithm’s quantum circuit complexity is T=O(2L2).It have a significant improvement on the time complexity and space complexity.Although the success rate is reduced,the overall success solution time is still lower than the Shor algorithm and the current major improvements Shor algorithm.Completed a simulation experiment.Respectively use the 11、10、9 Qubit decomposing the quantum circuit 119.The new algorithm explore the reality of using a universal quantum computer device to decipher the public key cryptography.

Several ways to perform data encryption have been found, and one of the functions involved in standard algorithms such as RSA is the modular exponentiation. Basically, the RSA algorithm uses some properties of modular arithmetic to cipher and decipher plain text, with a certain performance dependence on text lengths. The growth in computing capacity has created the need to use robust systems that can perform calculations with significantly large numbers and the formulation of procedures focused on improving the speed to achieve it. One of these is the M-ary algorithm for the execution of the modular exponential function. This paper describes an implementation of this algorithm in reprogrammable hardware (FPGA) to evaluate its performance. The first section of this work introduces the M-ary algorithm. The second section uses block description for implementation understanding. The third section shows the results in time diagrams, and finally, the last section conclusions.

The small Qubit quantum algorithm attack to RSA was proposed,the need Qubit of the first quantum register from 2L to L1,it can be reduced to 2 Qubit,the overall space complexity denoted (L1,L),where 2L1≥r,r is the period of decomposed.Because of the reduce of the first quantum register,it reduces the algorithm’s complexity and success rates,and use the binary look-up table method to compute the modular exponentiation,it enhances the computing speed.The improved algorithm’s quantum circuit complexity is T=O(2L2).It have a significant improvement on the time complexity and space complexity.Although the success rate is reduced,the overall success solution time is still lower than the Shor algorithm and the current major improvements Shor algorithm.Completed a simulation experiment.Respectively use the 11、10、9 Qubit decomposing the quantum circuit 119.The new algorithm explore the reality of using a universal quantum computer device to decipher the public key cryptography.

This paper aims to provide security of data in the Cloud using Multiplicative Homomorphic Approach. Encryption process is done with RSA algorithm. In this RSA algorithm, Shor’s algorithm is used for generating Public key Component, which enhances the security. Shor’s algorithm plays as important role in generating public key. Plain Text Message is encrypted with Public Key to generate Cipher Text and for decryption Chinese Remainder Theorem (CRT) is used to speed up the computations. By doing so, it shows how the CRT representation of numbers in Zn can be used to perform modular exponentiation about much more efficiently using three extra values pre-computed from the prime factors of n. Hence, security is enhanced in the cloud provider.

This paper describes basic principles of data protection using the RSA algorithm, as well as algorithms for its calculation. The RSA algorithm is implemented on FPGA integrated circuit EP4CE115F29C7, family Cyclone IV, Altera. Four modules of Montgomery algorithm are designed using VHDL. Synthesis and simulation are done using Quartus II software and ModelSim. The modules are analyzed for different key lengths (16 to 1024) in terms of the number of logic elements, the maximum frequency and speed.

Due to the unified protocol specification, encryption, and firewalls and other security measures at present, communication within the network environment are in good usability and security in heterogeneous network environment. However, in order to guarantee the availability, safety of the communication between heterogeneous networks has been reduced. Based on the study of heterogeneous networks through the issues and the status quo on the symmetric key cryptography, asymmetric key cryptosystem in-depth research, an encryption algorithm based on the RSA algorithm and improved DES algorithm was proposed. Finally, the use of case study shows that the algorithm has good security.