Secure Communication for Intelligent Enterprises

We design an algorithm to merge both RSA algorithm and Diffie-Hellman Algorithm of them to provide a user with even higher level of data security. Actually, our intent is to secure data of smaller as well as larger size by obtaining one randomly chosen key pair from set of RSA keys and one randomly chosen secret key using Diffie-Hellman algorithm and then applying RSA encryption to make even public components of Diffie-Hellman algorithm inaccessible for any eavesdropper freely. Encrypted exchange of public components of Diffie-Hellman part of the system makes it hidden from all other than intended users to see Diffie-Hellman generator and prime modulus. This will make our algorithm M*N times complex to break using even the latest version of Brute Force attack, where M and N are corresponding complexities imposed by the Diffie-Hellman and RSA algorithms respectively. Encryption algorithms play a main role in information security systems. On the other side, those algorithms consume a significant amount of computing resources such as CPU time, memory, and battery power. This paper provides evaluation of five of the most common encryption algorithms namely: AES (Rijndael), DES, 3DES, RC2, Blowfish. A comparison has been conducted with our proposed algorithm.

In today's technology, ever increasing number of electronics applications require secure communication, for example the Internet of things devices. Elliptic Curve Diffie Hellman (EC-DH) Algorithm has emerged as an attractive and effective public-key cryptosystem. Elliptic curves are widely used in various key exchange techniques that include the Diffie-Hellman Key agreement scheme. When contrasted with conventional cryptosystems like RSA, ECC offers equivalent security with smaller key sizes, which results in lower power consumption, speedier calculations, and also lower memory and transmission capacity (bandwidth) reserve. This is particularly valid and helpful for applications like IoT gadgets, which are regularly constrained regarding their CPU processing speed, power, and area. This work includes the software and hardware implementation of Diffie-Hellman, Elliptic Curve Diffie-Hellman (ECDH) Key agreement algorithm, and RSA algorithm. The proposed work also involves analysis of power, performance, area, and their comparisons thereof. The comparison is based on metrics obtained, after implementing the algorithms in synopsys using 90 nm UMC Faraday library. The ECDH algorithm is found to be better than others as far as power and area are concerned.

The majority of imaging techniques use symmetric and asymmetric cryptography algorithms to encrypt digital media. Most of the research works contributed in the literature focus primarily on the Advanced Encryption Standard (AES) algorithm for encryption and decryption. This paper propose an analysis for performing image encryption and decryption by hybridization of Elliptic Curve Cryptography (ECC) with Hill Cipher (HC), ECC with Advanced Encryption Standard (AES) and ElGamal with Double Playfair Cipher (DPC). This analysis is based on the following parameters: (i) Encryption and decryption time, (ii) entropy of encrypted image, (iii) loss in intensity of the decrypted image, (iv) Peak Signal to Noise Ratio (PSNR), (v) Number of Pixels Change Rate (NPCR), and (vi) Unified Average Changing Intensity (UACI). The hybrid process involves the speed and ease of implementation from symmetric algorithms, as well as improved security from asymmetric algorithms. ECC and ElGamal cryptosystems provide asymmetric key cryptography, while HC, AES, and DPC are symmetric key algorithms. ECC with AES are perfect for remote or private communications with smaller image sizes based on the amount of time needed for encryption and decryption. The metric measurement with test cases finds that ECC and HC have a good overall solution for image encryption.

Lately, image encryption has stand out as a highly urgent demand to provide high security for digital images against use and unauthorized distribution. A lot of existing researches use chaotic systems, symmetric or asymmetric schemes for image encryption, but cryptosystem based on one encryption technique only, faces many challenges like weak security and low complexity. Therefore, incorporating two or more different ciphering methods yields a secure and efficient algorithm to protect image information. In this work, a new image cryptosystem is suggested by joining zigzag scan technique, RSA algorithm and chaotic systems. These three security factors introduce Triple Incorporated Ciphering stages system (TIC). Initially, the plaintext image is divided into $8\times 8$ non-overlapping blocks, then the odd blocks are isolated from the even blocks. After that, a new modified zigzag scan in two different directions is adopted for shuffling pixels in the odd and even blocks. This operation effectively enhances the shuffling degree. Next, the RSA algorithm is utilized after combining the scrambled blocks in one matrix. Finally, chaotic systems are implemented on the resultant encrypted matrix to complete the ciphering process. The chaos is implemented in two steps; confusion and diffusion. Duffing map is exploited in the confusion stage, whereas L"u system is adopted on the shuffled matrix in the diffusion stage. The simulation results show the superiority of TIC in both security and attacks robustness compared to other cryptographic algorithms. Therefore, TIC can be exploited in real-time communication systems for secure image transmission.

Machine learning inference has become an essential task for embedded edge devices requiring the deployment of costly deep neural network accelerators onto extremely resource-constrained hardware. Although many optimization strategies have been proposed to improve the efficiency of standalone accelerators, the optimization for end-to-end performance of a computing device with heterogeneous cores is still challenging and often overlooked, especially for low power devices. In this paper, we propose a unified reconfigurable architecture, referred as Neural CPU (NCPU), for low-cost embedded systems. The proposed architecture is built on a binary neural network accelerator with the capability to emulate an in-order RISC-V CPU pipeline. The NCPU supports flexible programmability of RISC-V and maintains data locally to avoid costly core-to-core data transfer. A two-core NCPU SoC is designed and fabricated in a 65nm CMOS process. Compared with the conventional heterogeneous architecture, a single NCPU achieves 35% area reduction and 12% energy saving at 0.4V, which is suitable for low power and low-cost embedded edge devices. The NCPU design also features the capability of smooth switching between general-purpose CPU operation and a binary neural network inference to realize full utilization of the cores. The implemented two-core NCPU SoC achieves an end-to-end performance speed-up of 43% or an equivalent 74% energy saving based on use cases of real-time image classification and motion detection.

Due to the large number of light weight, low power devices in the future Internet, an efficient distributed multiple access protocol that can support a small fixed number of machines with continuous traffic along with a large variable number of devices with sporadic traffic is needed. The traffic in the future Internet has fundamentally different requirements: first, the accessing devices are of low power, which limit the transmission range; secondly, the delay is very stringent; thirdly, the number of active devices is time varying. In this paper, we propose a finite projective plane (FPP) based multiple access protocol (FISH) to meet such requirements. A low power node can transmit the replicas of a data packet in multiple time slots to achieve the same range of transmission as a high power node at one time. The initialization time slot of a frame allows for the estimation of the number of active nodes and the adjustment of the size of the frame to maximize the throughput. The interference cancellation and conflict resolution scheme of the FISH protocol is based on the theory of FPP. By using the property that the union of the sets of the FPP sharing one common point is a complete set, we are able to extract each of the individual user signals. One distinguishing feature of the FISH protocol is the amplification of the signal-to-noise ratio (SNR), which can either extend the transmission range or improve the bit error rate without sacrificing the throughput. In the performance evaluation, we demonstrate that the throughput is identical to the Slotted Aloha, while the SNR is magnified m times, where m is the order of the FPP. The proposed FISH protocol is of great use in the machine-to-machine communications as well as traditional cellular and satellite systems.

In this paper a extensive survey of FDSOI based FET Devices is done for low power application. FD-SOI FET has lots of advantages because of the oxide thickness, Buried Oxide (BOX) layers which helps to prevent from leakage power problem, the structure of FDSOI FET help to boost the researchers to focus on Nano-scale devices. Nowadays people interested in portable and low power devices. Scaling in threshold voltage gives better low power results and the threshold voltage of FD-SOI is 0.3642V [35] which is low compare to conventional MOSFET. Subthreshold swing makes an important role in making low power devices for low power devices Subthreshold Swing must be low, In FDSOI the Subthreshold swing value range between 65-80 [49]. They need devices with low cost, low power, and lower thermal resistance. For these kinds of applications, FD-SOI technology is more efficient.

The Classic Diffie-Hellman (CDH) algorithm encounters several security problems. The algorithm security depends on the complexity of solving the discrete logarithm and the integer factorization problem. The security also depends on the length of bits keys used. In this paper, we proposed a hybrid algorithm, the combination of Modified Diffie Hellman (MDH) with the Rivest, Shamir, and Adelman (RSA) algorithm. The MDH will not use primitive root (g). Instead, it will use two prime numbers (P and Q) for key exchange. It reduces the possibility of a man-in-the-middle attack. Furthermore, the MDH has an authentication mechanism. If both shared keys are equal, the communication will continue. Otherwise, it will stop because it is compromised. Also, the RSA algorithm will use the two prime numbers generated by MDH (P and Q). The RSA algorithm will perform the encryption and decryption message. The Diffie Hellman (DH) and the RSA Algorithms are the basis of several security standards and services on the internet, especially TLS and SSL. If the security of both algorithms is compromised, such systems will collapse. In this proposal, the combined cryptography system aims to achieve secret message exchange; it uses random prime numbers after multiplication and eventually shared with the other end of a communication. The proposed algorithm secretly generate a value so that the security level increases

Since the existing RSA Algorithm needs long key sizes, requires big memory spaces and also a long execution time, it seems necessary to make some changes or taking some necessary precautions during the implementation of RSA in order to provide maximum security level. In this paper, three experiments were developed in order to examine the execution time of the processes of encryption and decryption and comparing the results together to elicit the improved points and discussing them. Moreover, some programming techniques will be used in order to speed up the process of encryption or decryption. The results indicate that the execution time of encryption process was improved by 14% in experiment 3 by using some techniques to speed up the process, the decryption process was improved as well by 22%.

RSA algorithm is one type of algorithms in public-key cryptographic systems where the private keys are kept secret and the public keys can be disseminated. Beaufort Cipher algorithm is a type of classical symmetric algorithm. Meanwhile, the RSA-CRT is one variant of RSA cryptosystem. The RSA-CRT is not efficient for encrypting large files such as image files, since it uses modular exponentiation, which is slow, and the resulting ciphertext would be very much larger than the message. To avoid this problem, a hybrid cryptosystem scheme using RSA-CRT and Beaufort algorithm is designed to encrypt images. Beaufort Cipher algorithm is used for encryption and decryption of digital images, while RSA-CRT algorithm for decryption and decryption of beaufort cipher keys. The results showed that the size of the image (*.BMP) files and the encrypted image files are the same.

A novel image encryption scheme using both pixel level and bit level permutation with chaotic map

An image encryption technology based on multi-dimension chaotic system, spatiotemporal chaotic theory and traditional symmetric encryption algorithm is presented. The scrambling transformation was completed with multi-dimension chaotic system first. Then spatiotemporal chaotic theory was used to deal with gray transformation for each pixel. DES Algorithm was applied to implement image encryption at last. Theoretical analyses and simulated experiment show that the proposed image encryption scheme provides perfect results, larger key space and higher security, so this encryption system has excellent performance against many kinds of attacks.

In the digital age of today, organizations look up to secure, scalable, and efficient encryption techniques ensuring the protection of multimedia data and confidential communication. This paper offers a comparative study on symmetric cryptographic algorithms—DES, AES, and Blowfish—evaluated for their performance in image encryption and decryption. The analysis considers key size, rounds, encryption/ decryption speed, and overall security, demonstrating how these algorithms safeguard image data from unauthorized access. Experimental surveys highlight the strengths of AES in robustness, Blowfish in speed and flexibility, and DES in legacy use, but with vulnerabilities. The system-level evaluation provides insights into how cryptographic algorithms can be applied in real-world applications such as military communication, medical imaging, and secure internet transmission. Overall, the study demonstrates the critical role of encryption algorithms in enhancing confidentiality, maintaining integrity, and enabling secure multimedia communication—making it appropriate for environments seeking modernized image security frameworks.Overall, the solution demonstrates the power of Blowfish as a secure and performance-optimized algorithm—making it appropriate for systems seeking modernized encryption capabilities

Information is the currency of democracy, impregnability of the same during transfer and storage has become a challenge in the field of data communication. One of the most efficient solutions to this ever growing problem is cryptography. The cynosure of this paper is the modified encryption and decryption of images using RSA Algorithm and its subsequent application on an image file. It involves splitting of the image so as to procure encrypt-able split files; and finally retrieval of the original image by applying decryption mechanisms. At the end, an efficient approach is established for keeping the image safe.

In day-to-day life, information plays a major role. The value of those information becomes higher. So, we need to protect the information from intruders who try to get the secret information. In protecting those information, data compression deals a lot. Compression techniques are of two types which includes lossy and lossless compression. Steganography is the process which is used to protect the information by encrypting the compressed image with secret data and then extract the secret data from the compressed image by decryption. This paper utilizes an reversible data hiding (RDH) algorithm to boost the efficiency of encryption and decryption of the cover image by implementing the steganographic technique. RDH helps to accomplish the reason for picture content security. The encrypted data has been embedded within the cover image using the least significant bit (LSB). The proposed model has been evaluated based on criteria like savings percentage (SP%), compression time (CT), compression ratio (CR), mean squared error (MSE), and peak signal-to-noise ratio (PSNR). In comparison to previous systems that use the RSA algorithm, this technique has improved performance and system methodology.