Encryption Key Generation Research Articles

An Image Encryption Scheme Based on Block Scrambling, Modified Zigzag Transformation and Key Generation Using Enhanced Logistic-Tent Map.

Nowadays, the images are transferred through open channels that are subject to potential attacks, so the exchange of image data requires additional security in many fields, such as medical, military, banking, etc. The security factors are essential in preventing the system from brute force and differential attacks. We propose an Enhanced Logistic Map (ELM) while using chaotic maps and simple encryption techniques, such as block scrambling, modified zigzag transformation for encryption phases, including permutation, diffusion, and key stream generation to withstand the attacks. The results of encryption are evaluated while using the histogram, correlation analysis, Number of Pixel Change Rate (NPCR), Unified Average Change Intensity (UACI), Peak-Signal-to-Noise Ratio (PSNR), and entropy. Our results demonstrate the security, reliability, efficiency, and flexibility of the proposed method.

Implementation of super H-antimagic total graph on establishing stream cipher

This paper is aimed to study the use of super (<em>a, d</em>)-<em>H</em> antimagic total graph on generating encryption keys that can be used to establish a stream cipher. Methodology to achieve this goal was undertaken in three steps. First of all the existence of super (<em>a, d</em>)-<em>H</em>-antimagic total labeling was proven. At the second step, the algorithm for utilizing the labeling to construct a key stream was developed, and finally, the mechanism for applying the key to establish a stream cipher was constructed. As the result, according to the security analysis, it can be shown that the developed cryptographic system achieve a good security.

An All-Digital Unified Physically Unclonable Function and True Random Number Generator Featuring Self-Calibrating Hierarchical Von Neumann Extraction in 14-nm Tri-gate CMOS

This paper describes a unified static/dynamic entropy generator based on a 512-b common entropy source (ES) array fabricated in 14-nm tri-gate CMOS with reconfigurable and adaptive post-processing circuits implemented on Arria 10 FPGA, targeted for flexible and secure privacy preserving mutual authentication on compact trusted mote platforms at the edge of internet of things. Several conditioning techniques that include temporal majority voting (TMV)-assisted ES array segregation with integrated bias tracking, three-way in-line self-calibration for tolerance to process–voltage–temperature variation, tri-level hierarchical Von Neumann (VN) extraction to maximize entropy harvesting, soft-dark bit masking for improving physically unclonable function (PUF) stability, and selective stress hardening to co-optimize the ES array for static-dynamic entropy with bias aware device aging enable simultaneous PUF and true random number generator (TRNG) operation with 1.48 and 0.56 Gb/s throughput, respectively, measured at 650 mV, 70 °C. The all-digital design with a compact layout footprint of 2114 $\mu \text{m}^{2}$ facilitates seamless integration in area constrained system-on-chips while achieving: 1) 25% area savings over conventional separate PUF and TRNG implementations; 2) cryptographic quality TRNG stream that passes all NIST randomness tests with 0.38 average p-value; 3) $1.6\times $ higher extractor performance at $9\times $ lower area with 750-gate hierarchical VN circuit over conventional light-weight entropy extractors; 4) 0.9996/0.99997 static/dynamic Shannon entropy indicating unbiased PUF/TRNG streams; 5) ultra-low energy consumption of 2.5 and 0.46 pJ/bit measured at 650 mV, 70 °C in TRNG and PUF modes; 6) 40% higher TRNG throughput with three-way self-calibration featuring coarse-grain column swap, fine-grain incremental ES substitution, and residual entropy recycling; 7) resistance to power injection attacks as measured by 64% higher performance over un-calibrated design in the presence 200-mV supply noise; 8) 2.8% PUF bit-error measured at 0.55–0.75 V, 25 °C–110 °C with 15-way TMV and soft dark-bit masking over a window of 100 cycles; 9) $14.8\times $ inter and intra-PUF hamming distance separation; and 10) 56% reduction in discarded ES cells with selective stress hardening to opportunistically reinforce/nullify pre-existing bias in PUF/TRNG candidate cells. To our knowledge, this is the first reported unified PUF-TRNG implementation enabling simultaneous generation of high-entropy chip-ID and encryption keys in real time.

Provide a New Encryption Algorithm for Medical Images and Evaluate the Proposed Algorithm

Introduction: In this paper, an encryption algorithm for the security of medical images is presented, which has extraordinary security. Given that the confidentiality of patient data is one of the priorities of medical informatics, the algorithm can be used to store and send medical image.Material and Methods: In this paper, the solutions of chaotic differential equations are used to generate encryption keys. This method is more than other methods used in encoding medical images, resistant to statistics attacks, low encryption and decryption time and very high key space. In the proposed algorithm, unlike other methods that use random key generation, this method uses the production of solutions of the chaotic differential equations in a given time period for generating a key. All simulations and coding are done in MATLAB software.Results: Chaotic Differential Equations have two very important features that make it possible to encode medical images. One is the unpredictability of the system's behavior and the other is a severe sensitivity to the initial condition.Conclusion: These two features make the method resistant to possible attacks to decode the concept of synchronization chaotic systems. Using the results of the method, medical information can be made safer than existing ones.

Provide a New Encryption Algorithm for Medical Images and Evaluate the Proposed Algorithm

Introduction : In this paper, an encryption algorithm for the security of medical images is presented, which has extraordinary security. Given that the confidentiality of patient data is one of the priorities of medical informatics, the algorithm can be used to store and send medical image. Material and Methods : In this paper, the solutions of chaotic differential equations are used to generate encryption keys. This method is more than other methods used in encoding medical images, resistant to statistics attacks, low encryption and decryption time and very high key space. In the proposed algorithm, unlike other methods that use random key generation, this method uses the production of solutions of the chaotic differential equations in a given time period for generating a key. All simulations and coding are done in MATLAB software. Results : Chaotic Differential Equations have two very important features that make it possible to encode medical images. One is the unpredictability of the system's behavior and the other is a severe sensitivity to the initial condition. Conclusion : These two features make the method resistant to possible attacks to decode the concept of synchronization chaotic systems. Using the results of the method, medical information can be made safer than existing ones.

A Study Medium-based safe File Management Security System on the cloud Environment

This study is a file management security system that encrypts and decrypts computer and cloud data by using Bluetooth based cryptographic module. It is a necessary solution in terms of abuse of personal information and protection of social and national information. We developed H/W and S/W for SFMS(: Safe File Management Security) related Bluetooth module in cloud environment and implemented firmware development, encryption key generation and issuance, client program for system mobile and key management system. In the terminal internal encryption and decryption, SFMS was developed to ensure high security that the hacking itself is not possible because key values exist separately for each file.

Enhanced Convergent Encryption Key Generation for Secured Data Deduplication in Cloud Storage

Data deduplication is broadlyfor maintaining asole copy of user’s data in cloud storage servers. Data Deduplication is a process of verify that whether the data are already stored in the cloud storage or not and maintain a single copy of data in the cloud. Deduplication is possible in cloud only with the use of convergent encryption (CE) technique. This technique is used to generate convergent encryption key from the user data which is to be uploaded to the cloud and the user’s data are encrypted with this convergent encryption key. This CE is exposed to different cryptography attacks. To maintain secure deduplication with convergent encryption in cloud, this paper proposes enhanced convergent encryption key generation technique. The paper introduces scheme with Key Generation and Management as a Service (KGMaaS) mechanism for generating and maintaining key for convergent encryption and deduplication process. Generation of convergent encryption key takes place in user’s side. In this process, a key is used for generating the convergent encryption key unlike existing method. Key used to generate convergent encryption key is received from KGMaaS. KGMaaS is assumed to be a trusted party for key generation and sharing. The proposed technique is analyst for security vulnerability, and it is ensure the security and efficient deduplication by procedure used in the overall data deduplication process.

Secure Array Synthesis in Multipath Channels

While conventional antenna array synthesis determines the beamforming weights that create a specified antenna radiation pattern, secure array synthesis formulates the beamforming weights that enhance security for wireless transmission of sensitive data. This paper focuses on creating beamformers that improve the generation of secret encryption keys based on bidirectional estimation of the reciprocal electromagnetic propagation channel between two radios. The technique uses semidefinite programming to determine the array weights that maximize the average secure key rate under a constraint on the total transmit power. The numerical implementation of the technique incorporates array mutual coupling, and the results demonstrate that the technique outperforms a conventional beamforming solution, with the improvement becoming significant for certain channel correlation conditions.

Nth Order Binary Encoding with Split-Protocol

To cope up with the Big Data explosion, the Nth Order Binary Encoding (NOBE) algorithm with the Split-protocol has been proposed. In the earlier papers, the application Split-protocol for security, reliability, availability, HPC have been demonstrated and implemented encoding. This technology will significantly reduce the network traffic, improve the transmission rate and augment the capacity for data storage. In addition to data compression, improving the privacy and security is an inherent benefit of the proposed method. It is possible to encode the data recursively up to N times and use a unique combination of NOBE's parameters to generate encryption keys for additional security and privacy for data on the flight or at a station. This paper describes the design and a preliminary demonstration of (NOBE) algorithm, serving as a foundation for application implementers. It also reports the outcomes of computable studies concerning the performance of the underlying implementation.

Statistical Tests for Random and Quantum Random Number Generators

This paper presents a few aspects regarding the testing of two random number generators. The importance of the quality of a generator is according to the type of application used. The outputs of these generators may be used in cryptographic applications to generate encryption keys. Random number generators used in cryptographic applications must meet certain requirements, and the most important is that their outputs must be unpredictable in the absence of knowledge of the inputs. This paper presents the analysis of a few statistical tests performed on two random number generators: a classic-software, and a quantum-hardware. These tests may be considered to determine if a generator is adequate to be used in particular cryptographic applications.

Enhanced Security Using Biometrics and Elliptic Curve Cryptography

Biometric Systems are systems which acquire, process, analyze and match Biometric credentials with those that are present in the Database providing Verification and Validation.Nowadays, simple biometrics like fingerprints and face recognition can be replicated with some effort. This compromises the level of security. However, combining two or more features like Fingerprint and Face as an authentication parameter, we can group together the features which will significantly increase the level of security as it will be much harder for unauthorized people to replicate both fingerprint and facial characteristics of a user. This paper discusses the systems which provide secure verification to incorporate the method with Elliptical Curve cryptographyusing Genetic Algorithm. Elliptic Curve Cryptography is based on a curve which is generated such that a line passing through any two points of the curve will surely pass through a third point somewhere along the curve. Points generated using Elliptic Curve cannot be regenerated by reversing the algorithm. This makes it very secure to generate encryption keys.

A Robust Chaos-Based Image Cryptosystem with an Improved Key Generator and Plain Image Sensitivity Mechanism

In this paper, we propose an effective gray image cryptosystem containing Arnold cat map for pixel permutation and an improved Logistic map for the generation of encryption keys to be used for pixel modification. Firstly, a new chaotic map is designed to show better performance than the standard one in terms of key space range, complexity and uniformity. Generated secret key is not only sensitive to the control parameters and initial condition of the improved map but also strongly depend on the plain image characteristic which provides an effective resistance against statistical and differential attacks. Additionally, to get higher encryption strength of the cryptosystem, both confusion and diffusion processes are performed with different keys in every iterations. Theoretical analysis and simulation results confirm that the proposed algorithm has superior security and effectively encrypts and decrypts the gray images as well.

SEDEA: State Estimation-Based Dynamic Encryption and Authentication in Smart Grid

A state estimation-based dynamic encryption and authentication (SEDEA) approach is proposed to protect the communication between the control center (CC) and remote terminal units (RTUs) in the smart grid, including the measurements reported from RTUs and the commands sent from the CC. The measurements of power systems are selected to generate encryption keys, which are measured on the RTUs, and estimated on CC using state estimation. With the changes of the power system, each RTU updates its key regularly, and the CC estimates the new keys of all RTUs dynamically and synchronously. The pairs of keys between the CC and each RTU are applied to ensure the confidentiality and integrity of their communication. The advantages of SEDEA could be summarized as follows. First, high security—the keys are difficult to predict and steal, since the power measurements, used to generate the keys, are constantly changing and unpredictable, and would never be exchanged in the network. Second, easy implementation—all measuring equipment on RTU and state estimation on the CC are the legacy of the current power system. And the encryption functions applied in SEDEA are simple and low cost for current devices in the power system, such as XOR, hash, and rounding. Thus, SEDEA is considered as a high-security, inherent and light-weight scheme for Smart Grid. In the experiments, we conduct SEDEA on the four-bus system to show the whole process step by step, including state estimation, key generation, and error correction. And the simulations on the IEEE 39-bus system to analyze the computation cost, error correction, and security of SEDEA.

Impact of Propagation on the Vulnerability of Channel-Based Key Establishment

When generating encryption keys using the reciprocal propagation channel, the secure key rate bounding the number of bits that can be generated securely differs from the available key rate that ignores the presence of an eavesdropper. To explore the impact of propagation on this difference, this work formulates a model for computing the secure and available key rates for a multiuser scenario involving two legitimate nodes and a passive eavesdropper. Application of the model to a variety of different propagation conditions demonstrates that the secure and available key rates differ appreciably when the $K$ -factor is large or when the separation between the eavesdropper and one of the legitimate nodes is small.

Fault model of electromagnetic attacks targeting ring oscillator-based true random number generators

Many side channels including power consumption, electromagnetic emanation, optical radiation, and even sound have been studied since the first publication of a side channel attack at the end of the 1990s. Most of these channels can be relatively easily used for an overall analysis of the cryptographic system (implementation of efficient passive attacks) or for injection of faults. Until recently, only the optical channel allowed both analysis of locally leaked information and precise injection of faults (single-bit errors). Recent works showed that the near-field electromagnetic channel enables similar results to be obtained. Like the optical channel, the near-field electromagnetic channel allows both active and passive attacks, which, in addition, can be theoretically non-invasive and contactless. However, the cost of the attack bench that is needed to exploit the near-field electromagnetic channel is less than that of an optical channel. Recently, we showed that it is possible to use the near-field electromagnetic channel to perform an efficient active attack targeting the true random number generator (TRNG) based on ring oscillators. In cryptography, TRNGs are chiefly used to generate encryption keys and other critical security parameters, so the proposed active attack could have serious consequences for the security of the whole cryptographic system. Here, we present the coupling of a passive attack and an active attack. The proposed coupled attack first uses a spectral differential analysis of the TRNG electromagnetic radiation to obtain valuable information on the position of ring oscillators and their frequency range. This information is then used to tune the electromagnetic harmonic signal to temporarily synchronize the ring oscillators. In this paper, we propose a fault model of the entropy extractor which shows that the behavior of the ring oscillators changes, and that it occurs additional and unwanted “fake rising edges” of the clock signal which disturb the flip-flops involved in such TRNGs. The effectiveness of our proposed coupled attack questions the use of ring oscillators in the design of TRNGs.

Optical Signal Processing and Stealth Transmission for Privacy

Optical encryption, key generation, and optical stealth transmission techniques for protecting the privacy of communication in optical networks are proposed and summarized. The signal processing methods based on fiber components provide ways to encrypt data and generate encryption keys at the speed of data transmission in optical fibers. Private and confidential communication is achieved without compromising the capacity and bandwidth of the optical network. Optical stealth transmission can hide the signal in plain sight. Because an eavesdropper can neither read the data nor detect the existence of the transmitted signal, optical stealth transmission provides a higher level of privacy. A hybrid system which includes both the public channels and stealth channels can effectively provide anonymous communication and defend against traffic analysis.

EAP-Swift: An Efficient Authentication and Key Generation Mechanism for Resource Constrained WSNs

Technological advances within the area of wireless sensor technology allow WSNs to be used in a increasing number of measurement scenarios. As new application areas are emerging, such as infrastructure monitoring and smart cities, the need for sensor mobility handling requires efficient and secure authentication protocols. This paper presents EAP-Swift, a novel EAP based authentication protocol with a focus on lightweight processing and faster response. It supports end-to-end session encryption key generation and mutual authentication. By utilizing lightweight hashing algorithms, the challenge-response authentication mechanism uses only two round trips to the AAA server for the complete authentication procedure leading to the reduction of latency by 33% compared to the baseline protocols. Further, using extensive experimentation, we validate that the authentication time can be kept below 250 ms and the power consumption can be kept below 15 mJ. Furthermore, we show that a battery lifetime of more than four years can be achieved when running the system on a regular button cell battery. Finally, the protocol was verified in terms of security using the AVISPA tool.

Design of Application Layer Services for Security Automation via a Web Service Approach

N-tier application design has become very common in the IT industry. Each individual layer, such as the application and data layer has its own main functionality. This design is very helpful in securing the application from unauthorized access and in protecting it from attacks to the data layer. The data layer is the core of a company's business, as all the important information of the company will be stored in the data layer and normally will be located in a secured off- line server with limited local network access. The application layer acts as the medium to exchange data between the client layer and the data layer over a network. As such, the application layer has been increasingly targeted for intrusion and attacks. This paper will introduce a method to minimize the security risks in the n-tier application design. The method introduced in this paper will mainly focus on how to secure the application layer from various attacks such as Denial of Services (DoS) attack and spoofing attacks. This is achieved through data protection such as random encryption key generation, data encryption etc. and so forth at both the client application and the application layer. 

Implementation and Analysis of Ring Oscillator PUFs on 60 nm Altera Cyclone FPGAs

ABSTRACTRing Oscillator (RO) physically unclonable functions (PUFs) on field programmable gate arrays (FPGAs) have drawn much attention in recent years. Making each FPGA uniquely identifiable, they allow for protection of intellectual property (IP) or generation of secret encryption keys. Their implementation has been widely discussed, but most experiments have been conducted on Xilinx platforms. In this paper, we report the statistical results from an analysis spanning 20 Cyclone IV FPGAs with 60 nm technology. We parameterize the RO length, placement, ambient temperature, and non-PUF switching activity and discuss the observed effects on PUF quality.

Dynamic Key Generation During a Communication Instance Over GSM

The use of mobile phones became vital in our everyday life. This emergence has led many companies to allow new activities which were previously running strictly over the Internet to run over the mobile network such as the electronic payment. These circumstances make the security of mobile communication a priority to preserve the authentication, confidentiality and integrity of data sent between subscribers and mobile network. In this paper, we propose a dynamic key generation for the A5 GSM encryption algorithm to enforce the security and protect the transferred data. The improvement we made here is the generation and use of multiple encryption keys during a single phone communication, which makes it much harder for a cryptanalyst to eavesdrop on a phone conversation. Note that our algorithm can be implemented over any GSM generation GSM/3G/4G.