Encryption-decryption Algorithm Research Articles

Super Encryption of the Hill Cipher Method and the AES Method for Security of Employee Salary Data

Data security is a security system that is needed to protect data in systems, networks and other digital components. In a unit or agency such as the South Binjai sub-district office, the management of employee salary data is done digitally, namely via a computer. However, in this increasingly sophisticated digital era, it can cause many irresponsible individuals to easily wiretapping the company's data so that it can be easily accessed by other parties, as well as employee salary data which contains a lot of data. important. In order to avoid unwanted things such as theft of personal data by irresponsible persons, a security system is needed that can maintain the confidentiality of data and secure data. Therefore, in this case, a security system is needed that can maintain the confidentiality of data and secure employee salary data. With that there are many algorithms that can be used in securing employee salary data. And the algorithm used is hill cipher and AES algorithm. The hill cipher algorithm is an encryption-decryption algorithm that uses a transformation matrix. The AES algorithm is a symmetric block ciphertext that can encrypt and decrypt information. The use of these two algorithms can further strengthen the security of employee salary data. From the results of the trials carried out, the sample data used containing employee salary data was successfully secured with both hill cipher and AES algorithms.

An Enhanced Security Model for Protecting Data Transmission and Communication in Recent IoT Integrated Healthcare Industry Using Machine Learning Algorithm

Different kinds of security need to be applied to various application-centric IoT networks. Safety is one of the most important aspects to be considered regarding user, device, and data. The healthcare industry is a special IoT network fully connected with medical/healthcare IoT devices. The data generated from the IoT devices are transmitted or shared from one hospital to another through the Internet. Healthcare data has more private, medical, and insurance information that intruders can use on the Internet. The intruders misbehave with the patient or the general public registered in the healthcare industry. Some intruders blackmail the patient based on their private/personal information. Healthcare industries and their research team are trying to create a security framework to safeguard the data to avoid these malicious activities. This paper aims to secure and analyze healthcare IoT data using the Support Vector Machine algorithm. It learns the entire dataset, classifies it, and calls the encryption-decryption algorithms (RSA) to secure private data. The proposed SVM and the RSA algorithm are implemented in Python, and the results are verified. The performance of the proposed SVM-RSA is evaluated by comparing its results with the other algorithms.

A Symmetric Key-Based Cryptographic Transaction on Cryptocurrency Data

Cryptocurrency data communications are very demanding issues in current high-speed online currency transactions. Here, a key-based AES (Advanced Encryption Standard) encryption-decryption algorithm is used to impose more security levels on cryptocurrency data communications. For this, the sender first creates a key and sends it to the intended receiver through a secured and trusted channel. Then by that key one can easily encrypt the cryptocurrency data using the AES encryption algorithm and produced the ciphertext and then send it to the destination. On the receiver’s end, the decryption process of AES is performed by using the same shared secret key that retrieved the plaintext from the received ciphertext. The security of the proposed process depends on the shared secret key and the algorithm AES and it can be applied for any financial data transactions securely. This can be used in all kinds of cryptocurrency data communication with a higher level of security.

A Fast Text-to-Image Encryption-Decryption Algorithm for Secure Network Communication

Data security is the science of protecting data in information technology, including authentication, data encryption, data decryption, data recovery, and user protection. To protect data from unauthorized disclosure and modification, a secure algorithm should be used. Many techniques have been proposed to encrypt text to an image. Most past studies used RGB layers to encrypt text to an image. In this paper, a Text-to-Image Encryption-Decryption (TTIED) algorithm based on Cyan, Magenta, Yellow, Key/Black (CMYK) mode is proposed to improve security, capacity, and processing time. The results show that the capacity increased from one to four times compared to RGB mode. Security was also improved due to a decrease in the probability of an adversary discovering keys. The processing time ranged between 0.001 ms (668 characters) and 31 s (25 million characters), depending on the length of the text. The compression rate for the encrypted file was decreased compared to WinRAR. In this study, Arabic and English texts were encrypted and decrypted.

A Two-Dimensional mKdV Linear Map and Its Application in Digital Image Cryptography

Cryptography is the science and study of protecting data in computer and communication systems from unauthorized disclosure and modification. An ordinary difference equation (a map) can be used in encryption–decryption algorithms. In particular, the Arnold’s cat and the sine-Gordon linear maps can be used in cryptographic algorithms for encoding digital images. In this article, a two-dimensional linear mKdV map derived from an ordinary difference mKdV equation will be used in a cryptographic encoding algorithm. The proposed encoding algorithm will be compared with those generated using sine-Gordon and Arnold’s cat maps via the correlations between adjacent pixels in the encrypted image and the uniformity of the pixel distribution. Note that the mKdV map is derived from the partial discrete mKdV equation with Consistency Around the Cube (CAC) properties, whereas the sine-Gordon map is derived from the partial discrete sine-Gordon equation, which does not have CAC properties.

FPGA Implementation of Improved Security Approach for Medical Image Encryption and Decryption

Securing medical images is a great challenge to protect medical privacy. An image encryption model founded on a complex chaos-based Pseudorandom Number Generator (PRNG) and Modified Advanced Encryption Standard (MAES) is put forward in this paper. Our work consists of the following three main points. First, we propose the use of a complex PRNG based on two different chaotic systems which are the 2D Logistic map in a complex set and Henon’s system in the key generation procedure. Second, in the MAES 128 bits, the subbytes’ operation is performed using four different S-boxes for more complexity. Third, both shift-rows’ and mix-columns’ transformations are eliminated and replaced with a random permutation method which increases the complexity. More importantly, only four rounds of encryption are performed in a loop that reduces significantly the execution time. The overall system is implemented on the Altera Cyclone III board, which is completed with an SD card interface for medical image storage and a VGA interface for image display. The HPS software runs on μClinux and is used to control the FPGA encryption-decryption algorithm and image transmission. Experimental findings prove that the propounded map used has a keyspace sufficiently large and the proposed image encryption algorithm augments the entropy of the ciphered image compared to the AES standard and reduces the complexity time by 97%. The power consumption of the system is 136.87 mw and the throughput is 1.34 Gbit/s. The proposed technique is compared to recent image cryptosystems including hardware performances and different security analysis properties, such as randomness, sensitivity, and correlation of the encrypted images and results prove that our cryptographic algorithm is faster, more efficient, and can resist any kind of attacks.

10 Clock-Periods Pipelined Implementation of AES-128 Encryption-Decryption Algorithm up to 28 Gbit/s Real Throughput by Xilinx Zynq UltraScale+ MPSoC ZCU102 Platform

The security of communication and computer systems is an increasingly important issue, nowadays pervading all areas of human activity (e.g., credit cards, website encryption, medical data, etc.). Furthermore, the development of high-speed and light-weight implementations of the encryption algorithms is fundamental to improve and widespread their application in low-cost, low-power and portable systems. In this scientific article, a high-speed implementation of the AES-128 algorithm is reported, developed for a short-range and high-frequency communication system, called Wireless Connector; a Xilinx ZCU102 Field Programmable Gate Array (FPGA) platform represents the core of this communication system since manages all the base-band operations, including the encryption/decryption of the data packets. Specifically, a pipelined implementation of the Advanced Encryption Standard (AES) algorithm has been developed, allowing simultaneous processing of distinct rounds on multiple successive plaintext packets for each clock period and thus obtaining higher data throughput. The proposed encryption system supports 220 MHz maximum operating frequency, ensuring encryption and decryption times both equal to only 10 clock periods. Thanks to the pipelined approach and optimized solutions for the Substitute Bytes operation, the proposed implementation can process and provide the encrypted packets each clock period, thus obtaining a maximum data throughput higher than 28 Gbit/s. Also, the simulation results demonstrate that the proposed architecture is very efficient in using hardware resources, requiring only 1631 Configurable Logic Blocks (CLBs) for the encryption block and 3464 CLBs for the decryption one.

Image based Steganography in Cryptography implementing different Encryption-Decryption Algorithm

Steganography is data hidden within data. Steganography is an encryption technique that can be used along with cryptography as an extra-secure method in which to protect data. Steganography techniques can be applied to images, a video file or an audio file. Steganography is the practice of concealing a file, message, image, or video within another file, message, image, or video. The first recorded use of the term was in 1499 by Johannes Trithemius in his Steganographia, a treatise on cryptography and steganography, disguised as a book on magic. The advantage of steganography over cryptography alone is that the intended secret message does not attract attention to itself as an object of scrutiny. Plainly visible encrypted messages, no matter how unbreakable they are, arouse interest and may in themselves be incriminating in countries in which encryption is illegal. Whereas cryptography is the practice of protecting the contents of a message alone, steganography is concerned both with concealing the fact that a secret message is being sent and its contents. Steganography includes the concealment of information within computer files. In digital steganography, electronic communications may include steganographic coding inside of a transport layer, such as a document file, image file, program or protocol.

A Lightweight Cryptographic Algorithm using Pseudo Stream Cipher and Trigonometric Technique with Dynamic Key

IoT (Internet of things) equipments is used heavily, but they are poor in security issue and security can be pierced. Also the message that the IoT device transmit is the main cause for their security lapse. that the IoT devices send may lead to the breach of users’ privacy. To make the communication secure between IoT nodes and servers, a lightweight cryptographic algorithm using pseudo stream and trigonometric function with dynamic key is proposed. This algorithm works in different phases, the first is mutual authentication followed by key synchronization and then a trigonometry function for encryption and decryption, with updation of key after specific time period. The algorithm assures that the IoT node will not be overloaded and the security is enhanced by reducing the chance of cryptanalysis. The mutual authentication, session key synchronization and updation of session key are completed through several encrypted communication. Here, the key length and update cycle are variable to prevent attack. We compare the security and performance for mutual authentication, with some light weight authentication scheme and performance of encryption algorithm are compared to other algorithm like Hill Cipher, RC4, RSA. According to analysis the proposed mutual authentication and secret key for session synchronization can provide more security features with low over head of communication which is suitable for protect communication security of IoT with limited resource and power. The encryption decryption algorithm provides better performance. Trigonometric concept is used in the design of encryption decryption algorithm.

Attribute based honey encryption algorithm for securing big data: Hadoop distributed file system perspective.

Hadoop has become a promising platform to reliably process and store big data. It provides flexible and low cost services to huge data through Hadoop Distributed File System (HDFS) storage. Unfortunately, absence of any inherent security mechanism in Hadoop increases the possibility of malicious attacks on the data processed or stored through Hadoop. In this scenario, securing the data stored in HDFS becomes a challenging task. Hence, researchers and practitioners have intensified their efforts in working on mechanisms that would protect user’s information collated in HDFS. This has led to the development of numerous encryption-decryption algorithms but their performance decreases as the file size increases. In the present study, the authors have enlisted a methodology to solve the issue of data security in Hadoop storage. The authors have integrated Attribute Based Encryption with the honey encryption on Hadoop, i.e., Attribute Based Honey Encryption (ABHE). This approach works on files that are encoded inside the HDFS and decoded inside the Mapper. In addition, the authors have evaluated the proposed ABHE algorithm by performing encryption-decryption on different sizes of files and have compared the same with existing ones including AES and AES with OTP algorithms. The ABHE algorithm shows considerable improvement in performance during the encryption-decryption of files.

A Cross Layer Design and Flower Pollination Optimization Algorithm for Secured Energy Efficient Framework in Wireless Sensor Network

One of the fast-growing, tremendous and highly demanding networks from various emerging applications like military, healthcare industry, airport and forests is wireless sensor network. These applications are incorporated into the cloud in order to utilize various energy resources, high performance computing and massive storage structure. Many challenges should be resolved in sensor cloud environment like security, continuous data transmission, power management and energy efficiency. Some of the earlier research works anticipated data compression method for energy conservation and encryption decryption algorithms for secured data transmission. Compressing different data from various sources is difficult which degrades the performance of the data transmission and encryption decryption has taken more computational time and complexity which raises the need for energy efficiently and secured data transmission schemes. Hence, this paper is motivated to solve the major issues in sensor cloud, energy efficiency, data security and maintenance and thereby improving the quality of service (QoS). A secured energy efficient framework (SEEF) is designed for secured data transmission and maintenance which comprises of various phases like a cross layer designed for power and traffic management, node and route investigation for security and dynamic optimal routing for improving the QoS using flower pollination algorithm. A smart duty cycle scheduling protocol (SDCS) is proposed to increase the lifetime of the network by avoiding data redundancy, transmission conflicts, traffic conflicts and energy reduction in the network. The end to end delay is reduced by reducing the interval between the packets and packet delivery ratio is improved by avoiding packet loss. SEEF is simulated in NS2 simulator and the results are verified. The performance shows that the throughput and packet delivery ratio is improved up to 0.57 MB/s and 96% respectively. The end to end delay and the energy consumed is reduced to 0.69 s and 0.076 J respectively. From the comparison it is identified that SEEF can increase the overall performance in sensor cloud.

Symmetric Key Encryption Based on Rotation-Translation Equation

In this paper, an improved encryption algorithm based on numerical methods and rotation–translation equation is proposed. We develop the new encryption-decryption algorithm by using the concept of symmetric key instead of public key. Symmetric key algorithms use the same key for both encryption and decryption. Most symmetric key encryption algorithms use either block ciphers or stream ciphers. Our goal in this work is to improve an existing encryption algorithm by using a faster convergent iterative method, providing secure convergence of the corresponding numerical scheme, and improved security by a using rotation–translation formula.

A Novel Cancelable FaceHashing Technique Based on Non-Invertible Transformation With Encryption and Decryption Template

A novel cancelable FaceHashing technique based on non-invertible transformation with encryption and decryption template has been proposed in this paper. The proposed system has four components: face preprocessing, feature extraction, cancelable feature extraction followed by the classification, and encryption/decryption of cancelable face feature templates. During face preprocessing, the facial region of interest has been extracted out to speed the process for evaluating discriminant features. In feature extraction, some optimization techniques such as Sparse Representation Coding, Coordinate descent, and Block coordinates descent have been employed on facial descriptors to obtain the best representative of those descriptors. The representative descriptors are further arranged in a spatial pyramid matching structure to extract more discriminant and distinctive feature vectors. To preserve them, the existing BioHashing technique has been modified and extended to some higher levels of security attacks and the modified BioHashing technique computes a cancelable feature vector by the combined effect of the facial feature vector and the assigned token correspond to each user. The elements of computed cancelable feature vector are in a numeric form that has been employed to perform both verifications as well as identification task in online while the original facial feature vectors are kept offline either in hard drive or disc. Then, to enhance more security levels and also to preserve the cancelable face features, an RSA based encryption-decryption algorithm has been introduced. The proposed system has been tested using four benchmark face databases: CASIA-FACE-v5, IITK, CVL, and FERET, and performance are obtained as correct recognition rate and equal error rate. The performance are compared to the state-of-the-art methods for the superiority of the proposed feature extraction technique and individual performance analysis has been performed at all the security levels of the proposed Cancelable FaceHashing Technique. These comparisons show the superiority of the proposed system.

The Implementationof Digital Text Coding Algorithm Through A Three Dimensional Mapping Derived From Generalized ΔΔ-mKdV Equation Using Mathematica

Encryption-decryption algorithm using a mapping can be done for encoding a digital text, such as two dimensional mapping ΔΔ-sine Gordon equation. In this article, we will be given an encryption-decryption algorithm to a digital text through a three dimensional mapping that derived from the generalized ΔΔ-mKdV equation. Implementation of Encryption-decryption algorithm in this article using MATHEMATICA.

Developing an Algorithm for Securing the Biometric Data Template in the Database

In the current technology advancement, biometric template provides a dependable solution to the problem of user verification in an identity control system. The template is saved in the database during the enrollment and compared with query information in the verification stage. Serious security and privacy concerns can arise, if raw, unprotected data template is saved in the database. An attacker can hack the template information in the database to gain illicit access. A novel approach of encryption-decryption algorithm utilizing a design pattern of Model View Template (MVT) is developed to secure the biometric data template. The model manages information logically, the view shows the visualization of the data, and the template addresses the data migration into pattern object. The established algorithm is based on the cryptographic module of the Fernet key instance. The Fernet keys are combined to generate a multiFernet key to produce two encrypted files (byte and text file). These files are incorporated with Twilio message and securely preserved in the database. In the event where an attacker tries to access the biometric data template in the database, the system alerts the user and stops the attacker from unauthorized access, and cross-verify the impersonator based on the validation of the ownership. Thus, helps inform the users and the authority of, how secure the individual biometric data template is, and provided a high level of the security pertaining the individual data privacy.

Разработка и исследование параллельной модели алгоритмов пчелиных колоний для решения задач криптоанализа

Introduction. The research area of “natural calculation” is now widely used for the solution to optimization NP-complete problems including combinatorial tasks of cryptanalysis. A quick overview of the publications devoted to the application of the natural (bioinspired) methods for cryptanalysis is provided. The main work objective is to investigate a possibility of applying bee colony algorithms to the realization of block cipher cryptanalysis. Materials and Methods . The known bee colony techniques belonging to a relatively new class of the bioinspired optimization methods that simulate the processes occurring in wildlife are applied to solve this optimization problem. The description and the block diagram of the bee colony algorithm for the solution to a cryptanalysis task are provided; basic operations performed in parallel at the global level are noted. In the following, a set of independent operators allowing for the concurrent execution is defined. For this purpose, information-logical flowgraphs of the algorithm with the input control and information links are built, as well as matrices of succession, logical incompatibility, and independence are formed. This matrix of independence allows the definition of a set of algorithm operators admitting parallel execution. At that, the dimensionality of the maximal internally stable sets defines the maximum number of the processors used for the algorithm implementation. Research Results . Theoretical estimates of time complexity of the bee colony algorithm are given as the key data. Besides, the problem solution is provided: to find the required smallest number of processors of the homogeneous parallel computing systems with distributed memory, and a uniform plan for the implementation of operators for them, for the cryptanalysis algorithm based on the constructed information-logical graph data-logical graph, and for the preset time. The assessment of the wanted smallest number of processors for the cryptanalysis algorithm implementation, and the evaluation of the total time of the algorithm realization are given. Discussion and Conclusions. The basic research results are: the development of the bee colony algorithm used for the cryptanalysis task solution; the description of its flowchart and the principal par-allel executed stages; the construction of a matrix of independence; the evaluation of the number of processors for the algorithm imple-mentation. It should be noted (and it was observed in the previous works) that the distinctive feature of applying the bioinspired meth-ods of cryptanalysis is the applicability of the encryption-decryption algorithm as a criterion function for the evaluation of the key ac-ceptability defined by the bioinspired method operations. Thus, it can be affirmed that when using the bioinspired methods, the secret key definition process depends not so much on the complexity of the encryption transformations, as on the bioinspired method itself which should provide a sufficient diversity of the key generation

Development of a Novel Algorithm to Provide Efficiency and Security

high security, steganography process is combined with cryptographic encryption decryption algorithm such that if any one detect the presence of secret information still it is not understandable. Also there are many encryption/ decryption and steganography algorithm but there is always a competition to develop such an algorithm which is not only fast but also secure too. The proposed architecture first encrypts the secret text with proposed encryption algorithm and then hides it behind another text file through steganography algorithm.

Secured Wireless Power Transmission Using Radio Frequency Signal

Anything we transmit without protection is being raid by the intruders. Hence it is necessary to impart security to the signal transmitted. In this paper we present the concept of giving security to the transmitted power signal which is to be received by a receiver in a wireless medium. The present techniques of wireless power transmission consists of a pair of strongly magnetically coupled resonators that allow power transmission of tens of watts over a few meters, but anything without security becomes unreliable. With the goal in achieving security to the power signal, we introduce the concept of encryption decryption algorithm using RF module.

Double-Moduli Gaussian Encryption/Decryption with Primary Residues and Secret Controls

In this paper an encryption-decryption algorithm based on two moduli is described: one in the real field of integers and another in the field of complex integers. Also the proper selection of cryptographic system parameters is described. Several numeric illustrations explain step-by-step how to precondition a plaintext, how to select secret control parameters, how to ensure feasibility of all private keys and how to avoid ambiguity in the process of information recovery. The proposed cryptographic system is faster than most of known public key cryptosystems, since it requires a small number of multiplications and additions, and does not require exponentiations for its implementation.

Application of the Central Encryption System in the Dynamic Secret Sharing Scheme (II)

Based on the simple introduction of the multi-teeth encryption-decryption algorithm (Shang, 2010, P.1500-1502.), a dynamic secret sharing scheme based on the multi-teeth central encryption system is proposed in this article. In this research, for any K system members , they respectively select the positive integer in the set of distributed randomly, and , and is opened. By P , any l (or more) could reconstruct the shared secret key, and . The result indicates that the scheme proposed in this article has good characteristics of security and encryption.