A novel security algorithm for text and image data using multi node cryptographic algorithm

This research paper is simply the gathering of recent developments in the field of Hybrid cryptography and its application in the designing of a hybrid security protocol for online transaction based on Hybrid cryptography. A new security protocol for on-line transaction can be designed using combination of both symmetric and asymmetric cryptographic techniques known as Hybrid cryptography. This protocol serves three very important cryptographic primitives - integrity, confidentiality and authentication. Each of the so called cryptographic primitive is provided or fulfilled by the particular symmetric or asymmetric cryptographic techniques. The symmetric cryptographic algorithms are fast as compared to asymmetric cryptographic algorithms, so when both symmetric and asymmetric algorithms are used in tandem or together in a proper way, then the result is very encouraging in terms of providing high security with fast speed. With the help of this survey paper, we tried to encapsulate all the developments introduce in the designing of new security protocol for On-line transaction and its importance is very much evident from the fact that Communication has a major impact on today's business. It is desired to communicate data with high security and in less amount of time. At present, various types of cryptographic algorithms provide high security to information on controlled networks. These algorithms are required to provide data security and users authenticity. A Hybrid security protocol has been designed for better security using a combination of both symmetric and asymmetric cryptographic algorithms.

In this paper we illustrate the importance of cryptography, symmetric and asymmetric cryptographic algorithms. Significance of RSA algorithm its merits and demerits were discussed. Finally we have proposed an enhanced and efficient RSA algorithm which is more secure and stronger then the existing RSA algorithm. Keywords: Algorithm; Security; Cipher; public key cryptography; asymmetric key; symmetric key, RSA;

As a collection of innovative technologies, blockchain has solved the problem of reliable transmission and exchange of information on untrusted networks. The underlying implementation is the basis for the reliability of blockchain, which consists of various cryptographic algorithms for the use of identity authentication and privacy protection of distributed ledgers. The cryptographic algorithm plays a vital role in the blockchain, which guarantees the confidentiality, integrity, verifiability and non-repudiation of the blockchain. In order to get the most suitable cryptographic algorithm for the blockchain system, this paper proposed a method using Fuzzy Analytic Hierarchy Process (FAHP) to evaluate and score the comprehensive performance of the three types of cryptographic algorithms applied in the blockchain, including symmetric cryptographic algorithms, asymmetric cryptographic algorithms and hash algorithms. This paper weighs the performance differences of cryptographic algorithms considering the aspects of security, operational efficiency, language and hardware support and resource consumption. Finally, three cryptographic algorithms are selected that are considered to be the most suitable ones for block-chain systems, namely ECDSA, sha256 and AES. This result is also consistent with the most commonly used cryptographic algorithms in the current blockchain development direction. Therefore, the reliability and practicability of the algorithm evaluation pro-posed in this paper has been proved.

In the network security system cryptography plays a vital role for the secure transmission of information. Cryptography is a process of integrating and transferring the data to the genuine users against any attacks. There are two types of Cryptographic algorithm: Symmetric and Asymmetric algorithms. In the symmetric type cryptography, single key is used for both encryption and decryption. Symmetric algorithms are fast and simple. Asymmetric cryptographic algorithm uses different keys such as public key to encrypt the message at sender and private key which is known only to receiver for decrypting the encrypted message. Asymmetric algorithms are more secure and difficult, to decrypt the message unless hacker acquires the knowledge of private key. A new Asymmetric algorithm with Error Detection and Correction mechanism is proposed that can reduce hardware, and improves decryption time and security. Proposed Asymmetric algorithm uses the few properties of: RSA, Diffie-Hellman and ElGamal Algorithms. Performance of asymmetric algorithms is compared with proposed algorithm, which is designed using Verilog HDL. Algorithms are synthesized, simulated, implemented using Vivado and targeted for Artix-7 XC7A100T-1CSG324Carchitecture.Chipscope Pro logic analyzer-Virtual Input Output core is binded to design for hardware debugging, to monitor and capture the output signals at selected specified state by applying random input stimuli at runtime in Nexys4 DDR FPGA Board.

Data security is very important as it is easy to exchange data today.
 Cryptographic techniques are needed as data security techniques. Combining two cryptographic algorithms is a solution for a better level of security. The Advanced Encryption Standard (AES) cryptographic algorithm requires low computational power and is the best symmetric algorithm. The LUC algorithm is an asymmetric algorithm that was developed from the RSA algorithm and has advantages in a better level of security and processing speed. In this research, two symmetric and asymmetric cryptographic algorithms will be combined in a hybrid scheme, namely the AES and LUC algorithms to improve data security. the AES algorithm will encrypt and decrypt messages, while the LUC algorithm performs encryption and decryption of the AES key. The results showed that the combination of the two AES and LUC algorithms was successful. However, the computational time needed by the two algorithms to perform the encryption and decryption process increases. The simulation results of the brute force attack performed show that the LUC algorithm can still be attacked. The greater the value of E (the public key of the LUC algorithm), the longer it takes for the brute force attack to be successful. The value of E is also directly proportional to the computational time required by the LUC. So it can be concluded that the AES algorithm is less precise when combined with the LUC algorithm.

A novel reconfigurable cipher coprocessor (RCP) is designed with supporting both symmetric and asymmetric algorithms. First, a memory-sharing S-box is proposed to provide a reconfigurable S-box with reduced hardware resources. Then, arbitrary permutation unit, reconfigurable arithmetic operation unit, and shift unit are designed. All the operation units are combined with control module, configuration registers, data interconnect bus, and other parts to form a RCP coprocessor, which can implement different cryptographic algorithms by changing the configuration to adapt different application scenarios. The reconfigurable cipher coprocessor that can realize DES, 3DES, AES, IDEA, RC6, and RSA algorithms is integrated with a 32-bit CPU, 32K SRAM, and other peripherals. The simulation results show that the RCP has advantages in resource usage and flexibility with a relevant performance.KeywordsReconfigurable cipher coprocessorIntegrated circuitSymmetric cryptographic algorithmsAsymmetric cryptographic algorithms

One way to keep digital information secure is by using cryptographic techniques. With respect to its keys, cryptography generally is divided into two types: symmetric and asymmetric. Symmetric cryptography algorithm uses the same key in both encryption and decryption while asymmetric uses different keys for each of these processes. Asymmetric cryptography algorithm is known to be ineffective to encrypt big messages since it takes more CPU time to do the computation and the resulting ciphertext is usually much bigger than the original message. To eliminate these problems, in this research, we combine Rabin-p cryptosystem, an asymmetric cryptography algorithm, and affine cipher, a symmetric cryptography algorithm, in a hybrid scheme in order to secure messages from unwanted parties. The affine cipher is used for message encryption while Rabin-p is used for affine cipher’s key encryption. The result of this research is a hybrid cryptography scheme that can encrypt and decrypt message in the form of *.pdf files and be able to restore the message without losing integrity.

With the fast progression of digital data exchange information security has become an important issue in data communication. Encryption algorithms play an important role in information security system. These algorithms use techniques to enhance the data confidentiality and privacy by making the information indecipherable which can be only be decoded or decrypted by party those possesses the associated key. But at the same time, these algorithms consume a significant amount of computing resources such as CPU time, memory, and battery power. So we need to evaluate the performance of different cryptographic algorithms to find out best algorithm to use in future. This paper provides evaluation of both symmetric (AES, DES, Blowfish) as well as asymmetric (RSA) cryptographic algorithms by taking different types of files like Binary, text and image files. A comparison has been conducted for these encryption algorithms using evaluation parameters such as encryption time, decryption time and throughput. Simulation results are given to demonstrate the effectiveness of each.

The security issue is one of the most critical aspects of the message. Cryptography is a science based on a mathematical technique for security-related information with confidentiality, data integrity, and authentication. A hybrid cryptosystem works by combining symmetric and asymmetric algorithms. The purpose of using zig – zag algorithm and RSA algorithm is to cover the weakness of symmetric and asymmetric algorithm. Zig-zag Cipher is one of the classical cryptographic algorithms that use the technique of transposition. The method of inversion is utilizing the character permutation. The RSA algorithm is an asymmetric cryptographic algorithm that has used most frequently, and this is due to the reliability. The length of RSA keys in bits can be set, with the longer the bits, the more difficult to solve because of the difficulty of factoring the two huge numbers, but this has an impact on the more extended the decryption process. This research used to encrypt the message by zig-zag algorithm while the RSA algorithm encrypts the key of the zig-zag algorithm. The results of this research are the bigger size of the file, then the higher the size of the ciphertext. Based on the graph of the plaintext length against the processing time obtained the results of the length of the plaintext is directly proportional to the time and form of the linear graph. Encryption and decryption processes require different time durations. The encryption process takes longer time than decryption process.

Employing scrambled alpha-numeric randomization and RSA algorithm to ensure enhanced encryption in electronic medical records

In this paper, we propose a new register file architecture called the register file extension for multi-word and long-word operation (RFEMLO) to accelerate both symmetric and asymmetric cryptographic algorithms. Based on the idea that most of cryptographic algorithms heavily use multi-word or long-word operations, RFEMLO allows multiple contiguous registers to be specified as a single operand. RFEMLO can be applied to a general purpose processor by providing an instruction set extension and an additional functional unit. To evaluate the performance of RFEMLO, we use Simplescalar/ARM 3.0 (with gcc 2.95.2) and run detailed simulations on various cryptographic algorithms. The simulation results show that we could achieve 83% and 138% performance gain in both symmetric and asymmetric ciphers by applying RFEMLO to a conventional superscalar processor.

Due to the promising application of collecting information from remote or inaccessible location, wireless sensor networks pose big challenge for data routing to maximize the communication with more energy efficient. Literature presents different cluster-based energy aware routing protocol for maximizing the life time of sensor nodes. Accordingly, an energy efficient clustering mechanism, based on artificial bee colony algorithm and factional calculus is proposed in this paper to maximize the network energy and life time of nodes by optimally selecting cluster-head. The hybrid optimization algorithm called, multi-objective fractional artificial bee colony is developed to control the convergence rate of ABC with the newly designed fitness function which considered three objectives like, energy consumption, distance travelled and delays to minimize the overall objective. The performance of the proposed FABC-based cluster head selection is compared with LEACH, PSO and ABC-based routing using life time, and energy. The results proved that the proposed FABC maximizes the energy as well as life time of nodes as compared with existing protocols.

The importance of wireless sensors is increasing day by day due to their large demand. Sensor networks are facing some issues in which battery lifetime of sensor node is critical. It depends on the nature and application of the wireless sensor network and its different parameters (sampling frequency, transmission frequency, processing power and transmission power). In this paper, we propose a new and realistic model to show the effect of energy consumption on a lifetime of wireless sensor nodes. After analyzing the model behavior, we are able to find out the sensitive parameters that are highly effective for lifetime of sensor nodes.

In this paper, we propose a new asymmetric cryptographic algorithm (HOOD CRYPT) based on the Elliptical Curve Cryptographic approach. The algorithm describes how an orthogonal frequency division multiplexing (OFDM) based RF wireless system can be encrypted using planner matrix Elliptical Curve Cryptography (ECC). The newly described asymmetric algorithm can be applied to the OFDM transmission scheme in the design of more robust and secure cryptography in portable wireless devices. An analysis of the proposed algorithm is made using the discrete logarithm approach. Two methods, namely, Pollard's rho Attack and Index Calculus are investigated with respect to the new algorithm. We found that our method makes it even more difficult to break the ECC encryption.

In this paper, we propose a new asymmetric cryptographic algorithm (HOOD CRYPT) based on the Elliptical Curve Cryptographic approach. The algorithm describes how an orthogonal frequency division multiplexing (OFDM) based RF wireless system can be encrypted using planner matrix Elliptical Curve Cryptography (ECC). The newly described asymmetric algorithm can be applied to the OFDM transmission scheme in the design of more robust and secure cryptography in portable wireless devices. An analysis of the proposed algorithm is made using the discrete logarithm approach. Two methods, namely, Pollard's rho Attack and Index Calculus are investigated with respect to the new algorithm. We found that our method makes it even more difficult to break the ECC encryption.