Decryption Technique Research Articles

WSES: HIGH SECURED DATA ENCRYPTION AND AUTHENTICATION USING WEAVING, ROTATION AND FLIPPING

Data security is the very important part in the network data communication. Avoidance of the information hacking and steeling are very challenging part for network data communication. Now-a-days people are using many encryption and decryption techniques for data security. But all encryption and decryption techniques are having more time occupation or less security for the process. This paper proposed high level security approach to encryption and decryption for data security. Two levels of securities are used in this proposed method. First one is data encryption and the second one is hash value generation. The proposed Weaving based Superior Encryption Standard (WSES) uses a novel weaving based approach. The weaving array generation is done by Elementary Number Theory Notation (ENTN) method. The weaving array has multiple private keys for XOR encryption. After encryption the error value is extracted from the encrypted array and weaving array. This error value is sent to the other side. The novel approach for hash value generation uses the encrypted array. After encryption, the encrypted array is rotated into four degrees and each degree data are converted to vector format and arranged on by one under the vector. Finally a 2D Rotational Encryption Matrix (REM) is obtained. After this process a REM copy is converted to mirror flip and it is need as Flipped Matrix (FM). The FM is concatenated under the REM and converted to vector using the zigzag operation. Finally this process gives two bytes hash value from the vector. This proposed method executes very fast and provide high security. This method is much reliable to small size applications and also used for any type of data security.

Security Enhancement of Text Message Based on Matrix Approach Using Elliptical Curve Cryptosystem

The cryptosystem nowadays based on Elliptic Curve Cryptography (ECC) is becoming the trend in public key cryptography. Elliptic Curve Cryptography (ECC) was introduced by Victor Miller and Neil Kolbitz in 1986 is fast replacing the public key cryptosystem such as RSA, ElGamal Cryptosystems, etc., as ECC is more complex and thus it provides greater security and more efficient performance This paper presents the FPGA implementation of ECC by transforming the text message into an affine point called Pm(x, y) on the Elliptic Curve (EC), over the finite field GF (p). Each character in the text message is represented by its ASCII value. The ASCII value is mapped to the affine point. These affine points are later mapped again using Matrix Mapping method. Later these points are encoded using ElGamal encryption method. And the encoded message can be decrypted by ElGamal decryption technique and to get back the original message. The matrix obtained by ElGamal decryption is multiplied with the inverse of non-singular matrix, and de-mapping performed to get back the original ASCII Character and this ASCII character is converted back to the text message. The entire design is simulated, synthesized and implemented on FPGA.

English

This paper presents analysis of network data encryption and decryption techniques used in communication systems. In network communication systems, exchange of information mostly occurs on networked computers, mobile phones and other internet based electronic gadgets. Unsecured data that travels through different networks are open to many types of attack and can be read, altered or forged by anyone who has access to that data. To prevent such an attack, data encryption and decryption technique is employed. In order to visualize the effect and evaluate the performance of the encryption and decryption of each technique used in communication systems, Visual Basic simulation program that encrypt and decrypt data were developed, written and tested. Different data block sizes were captured and plotted against total time response taken during data encryption using Microsoft Excel. The graph result shows the superiority of RSA and AES algorithms over other algorithms in terms of the processing speed and time. DES has worm holes in its security mechanism whereas Blowfish, AES, and RSA do not have any. Further analysis was made based on the graph result obtained on each data encryption techniques

Multiple-image encryption by space multiplexing based on compressive sensing and the double-random phase-encoding technique.

In this paper, a new multiple-image encryption and decryption technique that utilizes the compressive sensing (CS) concept along with a double-random phase encryption (DRPE) has been proposed. The space multiplexing method is employed for integrating multiple-image data. The method, which results in a nonlinear encryption system, is able to overcome the vulnerability of classical DRPE. The CS technique and space multiplexing are able to provide additional key space in the proposed method. A numerical experiment of the proposed method is implemented and the results show that the proposed method has good accuracy and is more robust than classical DRPE. The proposed system is also employed against chosen-plaintext attacks and it is found that the inclusion of compressive sensing enhances robustness against the attacks.

Improved Data Sharing Security with Dual-MAC Address Verification and SHCS

For the easy and secure sharing of an unknown private data, an algorithm is developed. The proposed algorithm has improved the data sharing security with MAC address and SHCS verifications. This technique enables the sender to effectively assign a value for the commit phase.MAC address verification improved the security of authorized users at both the sender and receiver side. At the receiver side, the commit value verification is done. These features have provided an increased privacy preservation of the shared data. The usage of SHCS and MAC address in this new technique prevents hackers during the passage of private data. It is only possible in this new algorithm that more complex data can be shared with maximum security. My thesis examines the latest scheme in the literature, AIDA algorithm and proposes a new algorithm for improving the data sharing security. The new algorithm is created on top of SHCS algorithm with the help of MAC address verification. XOR encryption and decryption technique is used in my work. A Base64 encoder and decoder mechanism is added along with the encryption and decryption technique.

A Multi-Purpose Voice Controlled System on Android Platform

This paper describes a method which helps in making Android operating system based mobile phone detect a voice command and perform the operation accordingly. We also introduce a new secured backup and restore approach for messages from the SMS logs, which helps to reduce the effort in saving and restoring them manually. Our approach is minimize time in efficient way for backup and restoring the data in the phone using android platform. We have used our own optimized and secured encryption and decryption technique to store and retrieve messages. It can also check the nearest ATM’s, Hospitals etc, by sending and comparing the GPS location of the mobile phone to that stored in the database .

Implementation of Tangent and Cotangent rules to Provide Security in E-communication

In the data communication, the intriguing issue to provide data security and these led to comprise the many areas including the impregnable medium and trusted third party to maintain a database and various types of encryption techniques. These are main inducement of researchers in this area to protect the data from unauthorized users for malicious purpose. Therefore there are requires the different types of encryption and decryption techniques to secure the data. In the proposed paper, there are used the Tangent and Cotangent rules to generate the cipher and decipher at sending and receiving ends respectively. At the sending side, take the message alphabets which message want to communicate through electronic communication and find the corresponding values of alphabets from standard alphabetical table and apply the rules of Tangent. Find the corresponding values of Tangent of a particular alphabet and use this value as cipher at sending end. At the receiving end, there are taking the value of Cotangent of those particular receiving alphabets. Finally, get the value of same alphabets. This paper provides an algorithm as well as validates the proposed mechanism through UML Diagram.

A New Framework for Encryption and Authentication of Multimedia Data

The multiple Huffman table (MHT) based encryption technique for multimedia encryption gained much popularity, due to its simplicity, less complexity and good compression performance. At the same time, it is proved that the MHT based encryption system is vulnerable to several types of attacks. In this paper, the security issues of the MHT based encryption system are analyzed. On the basis of analysis, the paper proposes a modified version of MHT based encryption system, with minimal impact on its simplicity and compression performance. It is proposed to perform blockwise shuffling of the transformed image (in DCT domain) based on a chaotic map prior to the MHT stage, so that an attacker cannot retrieve the key because of the changes in the spatial arrangement caused by the blockwise shuffling in the transform domain. Moreover, to ensure copyright protection as well as traitor tracing, it is proposed to incorporate joint fingerprinting and decryption (JFD) technique at the receiver stage. The system is subjected to the known forms of attacks and it has been proved that the proposed system is able to resist the same with minimal level of increase in the system complexity.

Image Steganography combined with Cryptography

Steganography is the science of invisible communication. Apart from the sender and intended recipient no one suspects the existence of the message. Using Steganography, information can be hidden in various mediums known as carriers. The carriers can be images, audio files, video files and text files. Image Steganography is a technique of using an image file as a carrier. Cryptography protects the information by applying the encryption and decryption techniques, so that the secret message can be understood only by the right person.This paper proposes a method, which combines the techniques of Steganography and cryptography, to hide the secret data in an image. In the first phase, the sender will embed the secret data in an image by using the Least Significant Bit (LSB) technique. The embedded image will be encrypted by using an encryption algorithm. At final, the encrypted image will be decrypted and the hidden data will be retrieved by supplying the valid secret key by the receiver. The process includes the phases of Data embedding, Image Encryption and recovery of both original image and secret data from the encrypted image.

CAM: Cloud-Assisted Privacy Preserving Mobile Health Monitoring

Cloud-assisted mobile health (mHealth) monitoring, which applies the prevailing mobile communications and cloud computing technologies to provide feedback decision support, has been considered as a revolutionary approach to improving the quality of healthcare service while lowering the healthcare cost. Unfortunately, it also poses a serious risk on both clients' privacy and intellectual property of monitoring service providers, which could deter the wide adoption of mHealth technology. This paper is to address this important problem and design a cloud-assisted privacy preserving mobile health monitoring system to protect the privacy of the involved parties and their data. Moreover, the outsourcing decryption technique and a newly proposed key private proxy reencryption are adapted to shift the computational complexity of the involved parties to the cloud without compromising clients' privacy and service providers' intellectual property. Finally, our security and performance analysis demonstrates the effectiveness of our proposed design.

A Bespoke Technique for Secret Messaging

The communication of digital assets on the internet infrastructure is increasing in its volume with threats on its security with regard to active and passive attacks of eavesdroppers. This concern has opened up the research channel to improve the techniques of secure and reliable communication protecting intellectual property rights and message security. Constant efforts of researchers in this area to achieve communication at faster rate maintaining security of digital assets, is giving improved techniques to achieve the goal. The efforts made here in this work are in the direction to enhance level of security in making faster reliable and secure communication. In spite of continued efforts, still as on today, it is challenging to hide the communication from eavesdropper. The disciplines of Cryptography, Steganography and Digital Watermarking are still popular areas of research. They are continuously digging to find robust and effective algorithms to protect digital communications and digital assets. It is very true that if the complexity in algorithm is increased, higher security level can be achieved. In the reviewed work, Researchers have developed algorithms for text encryption and embedment in digital watermarking using LSB at cost of time. The proposed work is targeted to maintain the tradeoff between the complexity level of algorithm and security level of message considering the time factor. The proposed work has evolved with two algorithms: AMEADT (ASCII Message Encryption and Decryption Technique) to protect secret message and AMEAET (ASCII Message Embedment and Extraction Technique) to embed encrypted text to digital image. The implementation of these algorithms has resulted in justifying higher level of security with comparatively lower level of complexity of algorithm.

Low Complex Crypto based Channel Coding with Turbo Code

novel encryption system to increase security in a three tier manner without any additional complexity is proposed in this paper. The encryption block here is a Shrinking generator which is a Linear Feedback Shift Register (LFSR) based stream cipher system in which controlled randomness provides security. The channel coding technique used is Turbo code that performs very well and provides results near Shannon's Limit. The design of interleaver used in turbo code provides security while channel coding. Puncturing pattern designed for channel coding further increases the security of the system and improves the code rate also. Security of the system is achieved by hiding the keys used in code generation and puncturing from unintended users. For an intended user, performance of the channel coding system is further improved by using Soft Input Decryption (SID) technique. The hardware complexity of the proposed Shrinking Generator Based Cipher (SGBC) is compared with joint coding cryptographic schemes available in literature. Improved Linear Consistency Attack is mounted to analyze the security of the proposed system and the results show that a significant increase in security could be achieved without any additional increase in complexity.

An Efficient Multimedia DRM Technique using Secure Arithmetic Coding

The digital rights management (DRM) techniques are very important in the fields of multimedia security. The major areas of multimedia data security includes secrecy, ownership protection and traitor tracing. Even though, a number of encryption techniques were developed for multimedia encryption, most of them are vulnerable to several types of attacks. Hence, an encryption system having better security with minimal level of system complexity is an important requirement in multimedia security. In this paper, the cryptanalysis of two arithmetic coding based encryption techniques (randomized arithmetic coding(RAC) and chaotic binary arithmetic coding(CBAC))were proposed and proved that these schemes are vulnerable to known-plaintext attack. Then, a modified secure arithmetic coding based encryption system by providing block-wise shuffling of DCT matrix prior to the CBAC stage (block-shuffled CBAC)is proposed to improve the overall security of the system. In order to provide content protection after decryption for the proposed scheme, the joint fingerprinting and decryption (JFD) technique is provided at the receiver stage. Finally, this idea of image encryption has been extended to video (H.264 coding standard). Here, the work is based on a correlation preserving sorting algorithm whereby a comparable compression performance is obtained in addition to the high level of security. The proposed systems are tested against various types of attacks and it has been proved that these methods are able to withstand various types of attacks with good compression performance and minimal level of increase in system complexity.

Fully phase multiple-image encryption based on superposition principle and the digital holographic technique

We propose an optoelectronic image encryption and decryption technique based on coherent superposition principle and digital holography. With the help of a chaotic random phase mask (CRPM) that is generated by using logistic map, a real-valued primary image is encoded into a phase-only version and then recorded as an encoded hologram. As for multiple-image encryption, only one digital hologram is to be transmitted as the encrypted result by using the multiplexing technique changing the reference wave angle. The bifurcation parameters, the initial values for the logistic maps, the number of the removed elements and the reference wave parameters are kept and transmitted as private keys. Both the encryption and decryption processes can be implemented in opto-digital manner or fully digital manner. Simulation results are given for testing the feasibility of the proposed approach.

Studying Security Issues in HPC (Super Computer) Environment

HPC has evolved from being a buzzword to becoming one of the most exciting areas in the field of Information Technology & Computer Science. Organizations are increasingly looking to HPC to improve operational efficiency, reduce expenditure over time and improve the computational power. Using Super Computers hosted on a particular location and connected with the Internet can reduce the installation of computational power and making it centralise. However, centralise system has some advantages and disadvantages over the distributed system, but we avoid discussing those issues and focusing more on the HPC systems. HPC can also be used to build web and file server and for applications of cloud computing. Due to cluster type architecture and high processing speed, we have experienced that it works far better and handles the loads in much more efficient manner then series of desktop with normal configuration connected together for application of cloud computing and network applications. In this paper we have discussed on issues re lated to security of data and information on the context of HPC. Data and information are vanurable to security and safety. It is the purpose of this paper to present some practical security issues related to High Performance Computing Environment. Based on our observation on security requirements of HPC we have discuss some existing security technologies used in HPC. When observed to various literatures, we found that the existing techniques are not enough. We have discussed, some of the key issues relating to this context. Lastly, we have made an approach to find an appropriate solution using Blowfish encryption and decryption algorithm. We hope that, with our proposed concepts, HPC applications to perform better and in safer way. At the end, we have proposed a modified blow fish algorithmic technique by attaching random number generator algorithm to make the encryption decryption technique more appropriate for our own HPC environment.

Privacy Preserving Association Rule Mining in Vertically Partitioned Databases

Data mining techniques are useful to discover hidden patterns from the large databases. Association rule mining is one of the important data mining techniques to discover relationships between items or item sets. In many organizations the database may exist in centralized or in distributed environment. In distributed environment, database may be partitioned in different ways such as horizontally partitioned, vertically partitioned and mixed mode which consists of both horizontal and vertical partitioning methods. The sites in the distributed environment interested to find association rules by participating themselves in the mining process without disclosing their individual private data/information. In this paper, a new model is proposed to find association rules by satisfying the privacy constraints for vertically partitioned databases at n number of sites along with data miner. This model adopts cryptography techniques such as encryption, decryption techniques and scalar product technique to find association rules efficiently and securely for vertically partitioned databases.

Design of a Handheld Terminal which Has Encryption and Decryption Function

In this paper, a handheld terminal is designed which has encryption and decryption function to solve the problems of relatively lower security level of the traditional terminal equipment’s transmission data in electrical communication. This handheld terminal not only can implement the screct key update and recovery, load switch controlling, charge adding, parameter setting, data reading function and so on , but also through introducing advanced encryption and decryption techniques and using security unit,, , can ensure that the transmission data was not altered in the communication and transmission data’s integrity and confidentiality was not destroyed. This handheld terminal has great practical value.

A Virtual Optical Encryption Software System for Image Security

In this paper, a virtual optical encryption open source software system for image security is proposed. Our system makes it possible to encrypt and decrypt images based on the optical theorem, which includes the virtual optical image encryption technique (VOIET), the data hiding technique (DHT), the data extraction technique (DET), and the virtual optical image decryption technique (VOIDT). The optical theorem is based the digitized double-random-phase algorithm, which is called the virtual optical theorem. In the system, secret data can be embedded into the encrypted image data without distortion. The comparison of data hiding capacity and reconstructed image quality is performed in the experiment. Our system is designed and implemented by the open source software, which is called the Virtual Optical Image Encryption System (VOIES) and released on the Open Source Software Foundry (OSSF).

Encryption/Decryption Using Genetic Algorithms: A Modern Cryptography Approach

In electronic applications the most important factors are security, integrity, privacy and non-repudiation, confidentiality, and authentication services. This paper deals with the privacy of data transmitted over the network. I propose a new approach for data security using the concepts of genetic algorithms to encrypt and decrypt data streams. Such approaches comprise higher security. An example for this modern cryptography is reported in which several characters are encrypted and decrypted. The results show that the proposed technique achieved low snooping rates as compared to other simple character level encryption and decryption techniques.

Image encryption using the fractional wavelet transform

In this paper a technique for the coding of digital images is developed using Fractional Wavelet Transform (FWT) and random phase masks (RPMs). The digital image to encrypt is transformed with the FWT, after the coefficients resulting from the FWT (Approximation, Details: Horizontal, vertical and diagonal) are multiplied each one by different RPMs (statistically independent) and these latest results is applied an Inverse Wavelet Transform (IWT), obtaining the encrypted digital image. The decryption technique is the same encryption technique in reverse sense. This technique provides immediate advantages security compared to conventional techniques, in this technique the mother wavelet family and fractional orders associated with the FWT are additional keys that make access difficult to information to an unauthorized person (besides the RPMs used), thereby the level of encryption security is extraordinarily increased. In this work the mathematical support for the use of the FWT in the computational algorithm for the encryption is also developed.