Encryption and Decryption Application on Images with Hybrid Algorithm Vigenere and RSA

The colour of the fish skin is one of the important factors to determine the freshness of a fish. There are potential to use the fish images as an alternative to determining the fish freshness. However, the freshness relationship of the fish skin image to the Red, Green, Blue (RGB) colour channel needs to be elucidated to achieve an accurate interpretation of fish freshness. The objective of this study is to determine the freshness of the fish samples using QIM assessment and to extract the RGB colour value from fish skin images. Finally, to establish the relationship between the QIM scores ranging from 1 (fresh) to 3 (spoiled) and RGB value for freshness indicator using fish images. The effects of temperature, environment, and storage method have been shown to play an important role in determining the rate of deterioration towards the quality and freshness level in fish. From this study, a freshness indicator based on the Quality Index Method (QIM) and RGB value for Queenfish and Threadfin were created. Based on the QIM score, Threadfin was easier to deteriorate as compared to Queenfish from its leaner body type properties. Different fish would reflect different freshness reading as Threadfin is in a fresh state when it possesses a QIM score of 1 with RGB values to range between of 143 to 172. As deterioration progresses, the QIM score is at 3 and the RGB values are ranging from 132 to 161. While Queenfish is found to be in a fresh state when it acquires QIM score of 1 and the RGB values are in the range of 148 to 170. It starts to spoil when the QIM score is at 3 and the RGB values are ranging from 154 to 184.

Developing thiosulfate (S2O32-) sensors with silver nanoparticles (AgNPs) for analysis of aqueous solutions with the interference of other anions remains challenging. In this study, we propose a new strategy for excellent selective colorimetric detection of S2O32-. The nonmorphological transition of AgNPs leading to a color change from yellow to brown is verified by UV-vis, TEM, DLS, SEM, and XPS analyses. The sensor exhibits high sensitivity with detection limits of 1.0 μM by naked-eye determination and 0.2 μM by UV-vis spectroscopy analysis. The linear relationship (R2 = 0.998) between the (A0 - A)/A0 values and S2O32- concentrations from 0.2 μM to 2.0 μM indicates that the fabricated AgNPs-based colorimetric sensor can be employed for quantitative assay of S2O32-. Colorimetric responses are also monitored using the built-in camera of a smartphone. The sensor shows a linear response to S2O32- in 0-20.0 μM solutions under the optimized conditions and is thus more suitable for rapid on-site tests than other detection methods. A smartphone application (app) is downloaded under Android or IOS platforms to measure the RGB (red, green, blue) values of the colorimetric sensor after exposure to the analyte. Following data processing, the RGB values are converted into concentration values by using preloaded calibration curves. Confirmatory analysis indicates that the proposed S2O32- colorimetric sensor exhibits feasibility and sensitivity for S2O32- detection in real environmental samples.

Post-harvest activities, namely sorting and grading, are usually done by the visual method by looking at the color or the size of the fruit. Technological advancements by using computer assistance make harvesting and detecting the ripening process of tomatoes easier. The purpose of this research is to apply the Hue, Intensity, Saturation (HIS) color transformation method to detect the ripeness of vegetable tomatoes and determine the accuracy of the HIS and Red, Green, Blue (RGB) methods. In this research, some samples of tomatoes' RGB values were taken through image processing by ripening level, between unripe, under-ripe, and ripe. After the RGB value is obtained, it will be converted into HIS using means, variance, and range color feature extraction. In classifying this research using the K-Nearest Neighbour (KNN) and Support Vector Machine (SVM) method. With the results, the accuracy of the KNN method is better than SVM with an average of 87.80% and 74.38%. The result of this research indicates that the more accurate method is HIS with an average of 89.65% compared to the RGB method with an average of 89.35% and the CIElab method with an average of 84.41%. This is because it is easier for HIS to identify objects with different hues by providing a threshold value in the range of hue values (spectral wavelengths) that surround the object.

The RC-5 algorithm is an algorithm with the encryption method using the symmetric method and processing in the form of a cipher block, the same keywords are used for the encryption and decryption processes. The testing and analysis phase consists of a). Testing the execution time of the key generation process (set up key) b). Testing the success of the encryption and decryption process on the client-server integration method c). Testing the success of the encryption and decryption process using the file operation method d). Comparison of overhead/file size before and after passing through the system. The testing phase and execution time analysis are carried out when using the file operation method where the test will be divided into 3 parts, namely the execution time for the key setup process, the encryption process, and the decryption process. Testing the success of the encryption and decryption process on the client-server integration method is divided into 2 parts, namely testing the encryption process and the decryption process. In testing the encryption process, the characters that will be sent to the server will be encrypted first with a key to becoming a ciphertext in the form of integer data. The test results obtained are 1). The execution time for key generation (set up key) is very fast, around 9-10 ns. 2). In the encryption and decryption process, the execution time depends on the size of the plaintext file. The larger the plaintext file size, the longer the execution time. Where for a file with a size of 1 kb requires an execution time of 50.6 ms in the encryption process. 3). There is no difference between the size of the file before entering encryption and after decryption. Where for files with a size of 500 bytes before entering the encryption process, a file of 500 bytes will be generated from the decryption process.

The Process of Encryption and Decryption is performed by using Symmetric key cryptography and public key cryptography for Secure Communication. In this paper, we studied that how the process of Encryption and Decryption is perform in case ofSymmetric key and public key cryptography using AES and DES algorithms and modified RSA algorithm.

During quality control audits for dispensed medications, tablet coloration is frequently checked along with the subjectivity of pharmacists in pharmacies. This study developed an objective method for evaluating tablet coloration using color difference values derived by analyzing tablet images. We took photographs of the test tablets and imported these images into ImageJ to obtain the RGB (red, green, blue) color code chart values. Next, the RGB values were used in the CIE2000 calculator to calculate the color difference between each reference tablet that was immediately removed from packaging. We induced color changes in telmisartan (TEL) tablets of 19 products as test tablets by contacting them with the levodopa–carbidopa (LEV) tablet, and the color difference values for these tablets were calculated. Subsequently, the same tablets were evaluated by 10 clinically experienced pharmacists, auditing the acceptance of the coloring of these tablets. The receiver operating characteristic curve analysis between the color difference values and acceptable evaluation by pharmacists indicated a cutoff color difference value of 2.08, with an area under the curve of 0.756 as acceptable. After storing TEL tablets in one-dose packaging with LEV tablets for 1 month at room temperature in care facilities, 36％ of the tablets showed color difference values exceeding the cutoff threshold. Using color difference values in objective tablet coloration evaluation suggests its applicability in assessing tablet coloration in clinical settings.

RSA has two keys, namely public key and secret key. RSA bases its encryption and decryption process on the concepts of prime numbers and modulo arithmetic. Both encryption and decryption keys are integers. The encryption key is not kept secret and given to the public (so called the public key), but the key for decryption is confidential (private key). To find the decryption key, it is done by factoring an integer into its prime factors. Therefore to strengthen the security of the RSA algorithm it is necessary to process the key making by factoring an integer into its prime factors in general. Because this is so common, a key modification to the RSA algorithm needs to be done. Modifications are carried out by using another algorithm that uses random numbers. By entering random numbers, it is considered able to eliminate the possibility of an attacker guessing the results by knowing the algorithm. One of these algorithms is the Blum Blum Shub Algorithm (BBS) algorithm. The purpose of using the Blum Blum Shub (BBS) algorithm is to make the key more difficult to guess, making it difficult for cryptanalysts to read the message or information. Based on the results of the above analysis that the RSA algorithm can be used for key formation by using the Blum Blum Shub algorithm as a key used in the RSA algorithm

The computational complexity study of algorithms is highly germane to the design and development of high-speed computing devices. The whole essence of computation is principally influenced by efficiency of algorithms; this is more so the case with the algorithms whose solution space explodes exponentially. Cryptographic algorithms are good examples of such algorithms. The goal of this study is to compare the computational speeds of RSA and ElGamal cryptographic algorithms by carrying out a survey of works done so far by researchers. This study has therefore examined some of the results of the studies already done and highlighted which of the RSA and ElGamal algorithms performed better under given parameters. It is expected that this study would spur further investigation of the behaviour of cryptographic structures in order to ascertain their complexity and impact on the field of theoretical computer science. The experimental results of many of the papers reviewed showed that RSA cryptographic algorithm performs better as regards to energy usage, time complexity and space complexity of text, image and audio data during encryption process while some studies showed that ElGamal performs better in terms of time complexity during decryption process.

In this paper, fault detection scheme is introduced to improve the security and reliability of the NTRU in realistic environments, such as operating over a network. As the NTRU will be working in real networks, which have their own set of transient errors, handling such errors in analyzing the NTRU becomes a must. A single transient error occurring during the NTRU encryption (or decryption) process will likely result in a large number of errors in the encrypted/decrypted data. Such faults must be detected before sending data to avoid the transmission and use of erroneous data. Concurrent fault detection is important not only to protect the encryption/decryption process from random faults, but it will also protect the decryption circuitry from an attacker who may maliciously inject faults in order to find the secret key. We first describe the effects that faults may have on NTRU security while operating over a network by analyzing the propagation of such faults to the outputs. We then present two fault detection schemes: The first is a redundancy-based scheme while the second uses an error detection code. The latter present fault detection schemes by using an error detecting code, using one parity bit. We will add the parity bits to the polynomials and disable the device output when any of these parity checks are violated. This fault detection scheme has more than 99% coverage fault detection in the encryption process and in the first part in the decryption process. In the second part in the decryptionprocess, it has more than 67 % coverage fault detection. We can increase this ratio to high fault detection by adjusting the choices of the parameters of the NTRU network security system.

This research leads to the designing of the main color detector Red, Green Blue (RGB) which is applied to the detection of fruit ripeness. The purpose of this research is to help fruit farmers who wants to ensure the maturity condition of the fruits to be harvested. This research uses a scientific approach with the scientific concept of the Closest Pair Point algorithm and the use of the TS3200 color sensor. Closest Pair Point Algorithm is an algorithm that solves the problem of finding the shortest distance between a set of points in a two-dimensional plane. The TCS3200 color sensor is a converter programmed to convert color into a frequency composed of a silicon photodiode configuration and a current-to-frequency converter in a single monolithic CMOS IC. The output of this sensor is a square wave (duty cycle 50%) frequency which is directly proportional to the light intensity (irradiance). The results of the censorship process in the form of RGB numeric values ??will be compared with the original RGB values ??of the maturity provisions of a type of fruit, so that it can provide a resume for determining whether the fruit is ripe or not. The accuracy values ??obtained range between 73,87% - 93,12%.

In modern edge scenarios, the security of sensor networks plays a pivotal role in ensuring the safe communication of IoT data. Therefore, deploying encryption algorithms among edge devices is of paramount importance. However, most existing research predominantly emphasizes the efficiency of data transmission while often overlooking critical aspects of data integrity and confidentiality. The communication between sensor nodes and from sensors to end nodes necessitates additional robust security measures.This paper presents an enhanced approach to the RSA and AES algorithms, tailored for deployment on low-energy IoT devices commonly found in edge environments. The improved AES algorithm transitions from a single-threaded encryption and decryption process to a three-threaded design, reducing the ten-round operation to seven rounds to enhance both speed and energy efficiency. The enhanced RSA algorithm replaces the traditional dual-prime system with a triple-prime system, increasing the number of primes while reducing the bit length of each prime. This modification optimizes computational efficiency and strengthens security.Furthermore, we investigate the feasibility of integrating the RSA and AES algorithms and propose a novel RSA-AES hybrid algorithm MRA. This fusion approach leverages the strengths of both algorithms, encrypting the AES key using the improved RSA algorithm to bolster data security while maintaining efficient transmission.Performance evaluations of the RSA-AES hybrid algorithm demonstrate its exceptional capability in securing data transmission within edge scenarios,and the security of this hybrid algorithm is analyzed. The experimental results highlight that this algorithm not only ensures robust data security but also achieves high transmission efficiency, offering a reliable and practical solution for secure communication in edge environments.

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%.

A new LabVIEW simulation design was applied to provide a comparison study among several types of the most common symmetric and asymmetric encryption algorithms. Also, the comparison with advanced encryption package program was made. The results showed that the new LabVIEW simulation design had advantages in several points, where the evaluated time required for the encryption and decryption processes will be lesser than it values using advanced encryption package program.In this work, the symmetric encryption algorithms were used: AES (Advanced Encryption Standard), DES (Data Encryption Standard), 3DES (Triple Data Encryption Standard) and RC2 (Rivest Cipher) algorithms, while the asymmetric encryption algorithm used was the RSA (Rivest-Shamir-Aldeman) algorithm. The comparison had been achieved using different sizes of text files with different key sizes. The final results proved that the LabVIEW simulation design is better than the Advanced Encryption Package because it increased the algorithm’s performance by 65% in terms of speed and throughput, and for the algorithms’ comparison, the final results showed the effectiveness of AES algorithm over the other algorithms in terms of speed and throughput for the encryption and decryption processes.

DNA Cryptography is one of new algortihm in cryptography that is used to encrypt the data by converting the DNA code into binary code. Encryption process is expected to produce a random and unreadable ciphertext. This research aims to determine the result of encryption frequency analysis of the ciphertext obtained from the encryption process using DNA Cryptography and Digraph Transformation algorithm. The formation of a symmetric key is carried out for the encryption and decryption process in DNA Cryptography, and modular arithmetic in Digraph Transformation algorithm. The encryption process produces ciphertext in the form of letters and symbols because if involves the use of an ASCII table. Frequency analysis is done by comparing the frequency of occurence of letters in the ciphertext with frequency of occurence of letters in English. The conclusion for this research is that the ciphertext looks random, not easy to read, and hard to guess. For the future work, researcher can change the choice of binary code combinatory in DNA Cryptographic algorithms, increase the character vocabulary in the Digraph Transformation algorithm, and use various languages to code.

Security of sensitive information at the time of transmission over public channels is one of the critical issues in digital society. The DNA-based cryptography technique is a new paradigm in the cryptography field that is used to protect data during transmission. In this paper we introduce the asymmetric DNA cryptography technique for encrypting and decrypting plain-texts. This technique is based on the concept of data dependency, dynamic encoding and asymmetric cryptosystem (i.e. RSA algorithm). The asymmetric cryptosystem is used solely to initiate the encryption and decryption processes that are completely conducted using DNA computing. The basic idea is to create a dynamic DNA table based on the plaintext, using multi-level security, data dependency and generating 14 dynamic round keys. The proposed technique is implemented using the JAVA platform and its efficiency is examined in terms of avalanche property. The evaluation process proves that the proposed technique outperforms the RSA algorithm in terms of avalanche property.