Key Bits Research Articles

Hiding and Data Safety Techniques in Bmp Image with LSB and RPrime RSA Algorithm

Image is a form of visual data or information that is often used today. Sending data or information can be done in various ways and anyone. However, not all contents of existing information are public. It is not uncommon that information is misused by irresponsible parties. For this reason, security is needed for confidential information. This image security can be done with Steganography Technique. Steganography technique is a method for hiding information in an image. The method used is the LSB (Least Significant Bit) method. Where every bit lowest in the image media bytes will be replaced with the message bits that will be inserted. The bit used is the last bit of the RGB binary. The goal is that the message sent by the sender cannot be known by a third party, and can arrive safely to the recipient of the message. To make the confidentiality of messages more secure, it is necessary to hide the existence of messages to overcome the weaknesses of the LSB method used, so the authors combine them with the RSA RPrime algorithm (Rivest Shamir Adleman) for the encryption and decryption process. The security of the RSA RPrime algorithm lies in the level of difficulty in factoring non prime numbers into prime factors. The longer the key bits, the more difficult it is to solve because of the difficulty of factoring these two very large numbers. The results showed the test using a document file 2.93 MB with cover image size of 5760 x 3840 pixels, where in the larger the file inserted, then the time of encryption and decryption process is also long.

Security of Image File with Tiny Encryption Algorithm And Modified Significant Bit Pseudo Random Number Generator

One of the negative impacts of the development of the era of digital technology on communication media today is the damage and loss of information data. Access to communication media is a means of delivering information that is vulnerable to manipulation. Therefore, cryptography is used to keep the information confidential. Cryptography is an art in encoding messages into other forms so that the message cannot be read by unauthorized parties. Tiny Encryption Algorithm (TEA) algorithm is a symmetric cryptographic algorithm in which the key is divided into four subsections and uses 128 key bits and operates 64 bits of data blocks and then divided into two blocks into 32 bits during the encryption process. In order to make the encryption stronger, it is combined with steganography where the steganography method used is Least Significant Bit (LSB) which has the function of inserting data into the last bit of other data. Linear Congruential Generator (LCG) is a random number generator in the LSB method where its function is as a flow of inputting data that has been encrypted randomly into another data as a cover so that the combination of these methods becomes Modified Least Significant Bit Pseudo Random Number Generator. The combination of cryptography and steganography is able to create a security in sending a confidential message to be safer.

Implementation Gifford Method For Digital Image Security

Rapid development of digital image technology secret causes images require security aspect. Reviews These digital secret image can be encrypted using cryptographic methods. After being encrypted, the image is randomized, so that if it is Obtained by an unauthorized party, the image has no meaning. The cryptographic algorithm used in this study is Gifford method. The Gifford method is a stream cipher, a symmetry encryption algorithm that transforms the data character by character. Gifford has 8 registers filled with key bits. The processes performed by the Gifford method are the Output Function process, the 1-bit Sticky Shift Right process, the 1-bit Left Shift process, the XOR operation and the shift register operation to the right. The decryption process must use the same key as the encryption process in order to Obtain the original image.

Algebraic Analysis of a Simplified Encryption Algorithm GOST R 34.12-2015

In January 2016, a new standard for symmetric block encryption was established in the Russian Federation. The standard contains two encryption algorithms: Magma and Kuznyechik. In this paper we propose to consider the possibility of applying the algebraic analysis method to these ciphers. To do this, we use the simplified algorithms Magma ⊕ and S-KN2. To solve sets of nonlinear Boolean equations, we choose two different approaches: a reduction and solving of the Boolean satisfiability problem (by using the CryptoMiniSat solver) and an extended linearization method (XL). In our research, we suggest using a security assessment approach that identifies the resistance of block ciphers to algebraic cryptanalysis. The algebraic analysis of an eight-round Magma (68 key bits were fixed) with the CryptoMiniSat solver demanded four known text pairs and took 3029.56 s to complete (the search took 416.31 s). The algebraic analysis of a five-round Magma cipher with weakened S-boxes required seven known text pairs and took 1135.61 s (the search took 3.36 s). The algebraic analysis of a five-round Magma cipher with disabled S-blocks (equivalent value substitution) led to getting only one solution for five known text pairs in 501.18 s (the search took 4.92 s). The complexity of the XL algebraic analysis of a four-round S-KN2 cipher with three text pairs was 236.33 s (took 1.191 Gb RAM).

A Key Selected S-Box Mechanism and Its Investigation in Modern Block Cipher Design

The block cipher is an important means to provide data confidentiality in reality, and the S-box is an essential part in most of modern block cipher designs. In 1973, Feistel used a key selected S-box mechanism in his early block cipher designs, whose idea is to let each S-box have two different states and use a key bit to select which of the two states is to be used in an encryption or decryption operation. However, this key selected S-box mechanism has not got much attention in modern block cipher design with the DES block cipher published in 1977. In this paper, we revisit Feistel’s key selected S-box mechanism, give a generalised version of Feistel’s key selected S-box mechanism, compare it with existing close notions, and design the LBC example cipher to demonstrate that the generalised key selected S-box mechanism can be advantageous over the ordinary S-box mechanism in modern block cipher design for improving security and/or performance without intensifying computational effort and space in some application environments.

Links between Division Property and Other Cube Attack Variants

A theoretically reliable key-recovery attack should evaluate not only the non-randomness for the correct key guess but also the randomness for the wrong ones as well. The former has always been the main focus but the absence of the latter can also cause self-contradicted results. In fact, the theoretic discussion of wrong key guesses is overlooked in quite some existing key-recovery attacks, especially the previous cube attack variants based on pure experiments. In this paper, we draw links between the division property and several variants of the cube attack. In addition to the zero-sum property, we further prove that the bias phenomenon, the non-randomness widely utilized in dynamic cube attacks and cube testers, can also be reflected by the division property. Based on such links, we are able to provide several results: Firstly, we give a dynamic cube key-recovery attack on full Grain-128. Compared with Dinur et al.’s original one, this attack is supported by a theoretical analysis of the bias based on a more elaborate assumption. Our attack can recover 3 key bits with a complexity 297.86 and evaluated success probability 99.83%. Thus, the overall complexity for recovering full 128 key bits is 2125. Secondly, now that the bias phenomenon can be efficiently and elaborately evaluated, we further derive new secure bounds for Grain-like primitives (namely Grain-128, Grain-128a, Grain-V1, Plantlet) against both the zero-sum and bias cube testers. Our secure bounds indicate that 256 initialization rounds are not able to guarantee Grain-128 to resist bias-based cube testers. This is an efficient tool for newly designed stream ciphers for determining the number of initialization rounds. Thirdly, we improve Wang et al.’s relaxed term enumeration technique proposed in CRYPTO 2018 and extend their results on Kreyvium and ACORN by 1 and 13 rounds (reaching 892 and 763 rounds) with complexities 2121.19 and 2125.54 respectively. To our knowledge, our results are the current best key-recovery attacks on these two primitives.

Spectral analysis of ZUC-256

In this paper we develop a number of generic techniques and algorithms in spectral analysis of large linear approximations for use in cryptanalysis. We apply the developed tools for cryptanalysis of ZUC-256 and give a distinguishing attack with complexity around 2236. Although the attack is only 220 times faster than exhaustive key search, the result indicates that ZUC-256 does not provide a source with full 256-bit entropy in the generated keystream, which would be expected from a 256-bit key. To the best of our knowledge, this is the first known academic attack on full ZUC-256 with a computational complexity that is below exhaustive key search.

SMT Solver-Based Cryptanalysis of Block Ciphers

Satisfiability modulo theories (SMT) is a powerful framework for solving constraint satisfaction problem expressed in first-order logic and mainly used for software and hardware verification. In this article, we demonstrate the power of SMT solvers in cryptanalysis. We propose an algorithm for cryptanalysis of block ciphers using SMT solvers. In the cryptanalytic attack, we represent a block cipher in terms of Boolean equations and convert them into a suitable format (i.e. SMT-LIB). Finally, we use SMT solvers to find the key. An important feature of our attack is that it requires a few plaintext-ciphertext pairs to recover the secret key. We use the propose algorithm to demonstrate the cryptanalysis of International Data Encryption Algorithm (IDEA). We use various serial and parallel SMT solvers to apply known plaintext attack on IDEA and compare their performances. SMT solver can recover full key for three round of IDEA and 32 unknown key bits for full IDEA cipher, assuming 96 key bits are known. Furthermore, we compare our results with existing attacks on IDEA.

Securing Cyber-Physical Social Interactions on Wrist-Worn Devices

Since ancient Greece, handshaking has been commonly practiced between two people as a friendly gesture to express trust and respect, or form a mutual agreement. In this article, we show that such physical contact can be used to bootstrap secure cyber contact between the smart devices worn by users. The key observation is that during handshaking, although belonged to two different users, the two hands involved in the shaking events are often rigidly connected, and therefore exhibit very similar motion patterns. We propose a novel key generation system, which harvests motion data during user handshaking from the wrist-worn smart devices such as smartwatches or fitness bands, and exploits the matching motion patterns to generate symmetric keys on both parties. The generated keys can be then used to establish a secure communication channel for exchanging data between devices. This provides a much more natural and user-friendly alternative for many applications, e.g., exchanging/sharing contact details, friending on social networks, or even making payments, since it doesn’t involve extra bespoke hardware, nor require the users to perform pre-defined gestures. We implement the proposed key generation system on off-the-shelf smartwatches, and extensive evaluation shows that it can reliably generate 128-bit symmetric keys just after around 1s of handshaking (with success rate >99%), and is resilient to different types of attacks including impersonate mimicking attacks, impersonate passive attacks, or eavesdropping attacks. Specifically, for real-time impersonate mimicking attacks, in our experiments, the Equal Error Rate (EER) is only 1.6% on average. We also show that the proposed key generation system can be extremely lightweight and is able to run in-situ on the resource-constrained smartwatches without incurring excessive resource consumption.

Image encryption using a combination of Grain‐128a algorithm and Zaslavsky chaotic map

Encryption is a very important way to secure data in storage and communication, and it is a process of encoding messages or information in such a manner that only authorised persons can access it. Different techniques are used to protect confidential image data against illicit access. In image encryption using chaotic systems, most authors use or design algorithms to generate the initial parameters' values from the secret key. However, as the key size depends on the number of these parameters, the used algorithms show little sensitivity to small changes in the key. To enhance both security and sensitivity in the choice of the initial parameters, this work combines the use of the Grain-128a stream cipher algorithm with two-dimensional Zaslavsky chaotic map. Firstly, the Grain-128a algorithm is applied to generate the required parameters of Zaslavsky's chaotic map from a fixed length 256-bit secret key. Secondly, the sequences generated by the chaotic map are used to encrypt the image using a bit confusion and diffusion process. The simulation results on greyscale, colour, binary, indexed, and medical images together with the scores obtained in the evaluation of the algorithm show that the proposed method is very sure and effective in encrypting images of any size and any type.

Real-Time Data Aggregation and Analysis: A New Era Machine Learning

Logs are a key bit of leeway and play a vital role in organizations, for the quickest and most productive approach to transform machine data into performance. Log management is a powerful method that incorporates both analysis and event correlation which gives the underlying driver of any security infringement, that may not be able to figure out, even after going through hours. Machine-generated data are more complicated, unstructured and difficult to analyze. However, it is significant to analyze and optimize the execution of a machine. Splunk is an emerging trend for Machine Learning, which amend data analysis to the next level. Splunk makes simple to tackle the intensity of machine learning to enhance the security and operations by searching, analyzing and visualizing the logs generated from networks, applications, devices, etc. This paper proposes, how the logs are overseen by Splunk to produce real-time perceptions.

A differential fault attack on the WG family of stream ciphers

WG-l ($$l=7,8,16,29$$) are the well-known Welch–Gong (WG) stream cipher family with different key length bits. The first version named WG (WG-29) stream cipher was introduced in eSTREAM project as a cipher suitable for hardware implementations. The other variants are proposed for different applications from RFID to fast communications. This paper presents an extensive fault analysis on the WG family. Fault attacks are powerful cryptanalytic tools to analyse cryptosystems, which are not vulnerable to other known cryptographic attacks. The security model used to analyse the WG ciphers applies random faults, which are allowed to be injected by an adversary. The adversary has no control over the fault locations and their values. For each WG-l stream cipher, an adversary needs to observe a specific number of keystream bits before they are able to recover the secret key. To recover the secret key of WG-8, the adversary needs to inject about six random faults and compute the secret key with data and time complexities about $$2^{15.78}$$ bits and $$2^{24}$$, respectively. The adversary can recover the secret key of WG-7, WG-16 and WG-29 ciphers with time complexities $$2^{22}$$, $$2^{42}$$ and $$2^{64}$$, respectively. The attacks have been verified experimentally.

Linear Cryptanalysis of Reduced-Round Simon Using Super Rounds

We present attacks on 21-rounds of Simon 32/64, 21-rounds of Simon 48/96, 25-rounds of Simon 64/128, 35-rounds of Simon 96/144 and 43-rounds of Simon 128/256, often with direct recovery of the full master key without repeating the attack over multiple rounds. These attacks result from the observation that, after four rounds of encryption, one bit of the left half of the state of 32/64 Simon depends on only 17 key bits (19 key bits for the other variants of Simon). Further, linear cryptanalysis requires the guessing of only 16 bits, the size of a single round key of Simon 32/64. We partition the key into smaller strings by focusing on one bit of state at a time, decreasing the cost of the exhaustive search of linear cryptanalysis to 16 bits at a time for Simon 32/64. We also present other example linear cryptanalysis, experimentally verified on 8, 10 and 12 rounds for Simon 32/64.

Improved quantum key distribution based on Lucas-valued orbital angular momentum states

We propose an improved quantum key distribution (QKD) protocol based on orbital angular momentum (OAM) entangled states. Three Lucas-valued OAM entangled photons are generated by two cascaded spontaneous parameter down-conversion processes. Two photons are detained and detected by Alice, while the other is transmitted to Bob and then detected. A new scheme is designed to sift the original key bits. Compared to existing protocols, we believe our protocol greatly improves coding efficiency and is verifiable. The analysis results show that our protocol is immune to the photon-number-splitting attack, the intercept-resend attack and the classical information leakage. This work provides an efficient path to high-dimensional QKD systems.

An IC-level countermeasure against laser fault injection attack by information leakage sensing based on laser-induced opto-electric bulk current density

Laser fault injection (LFI) attacks on cryptographic processor ICs are a critical threat to information systems. This paper proposes an IC-level integrated countermeasure employing an information leakage sensor against an LFI attack. Distributed bulk current sensors monitor abnormal bulk current density caused by laser irradiation for LFI. Time-interleaved sensor operation and sensitivity tuning can obtain partial secret key leakage bit information with small layout area penalty. Based on the leakage information, the secret key can be securely updated to realize high-availability resilient systems. The test chip was designed and fabricated in a 0.18 μm standard CMOS, integrating a 128-bit advanced encryption standard cryptographic processor with the proposed information leakage sensor. This evaluation successfully demonstrated bulk current density and leakage bit monitoring.

Proving the biases of Salsa and ChaCha in differential attack

Salsa and ChaCha are two of the most famous stream ciphers in recent times. Most of the attacks available so far against these two ciphers are differential attacks, where a difference is given as an input in the initial state of the cipher and in the output some correlation is investigated. This correlation works as a distinguisher. All the key recovery attacks against these ciphers are based on these observed distinguishers. However, the distinguisher in the differential attack was purely an experimental observation, and the reason for this bias was unknown so far. In this paper, we provide a full theoretical proof of both the observed distinguishers for Salsa and ChaCha. In the key recovery attack, the idea of probabilistically neutral bit also plays a vital role. Here, we also theoretically explain the reason of a particular key bit of Salsa to be probabilistically neutral. This is the first attempt to provide a theoretical justification of the idea of differential key recovery attack against these two ciphers.

INT-RUP Secure Lightweight Parallel AE Modes

Owing to the growing demand for lightweight cryptographic solutions, NIST has initiated a standardization process for lightweight cryptographic algorithms. Specific to authenticated encryption (AE), the NIST draft demands that the scheme should have one primary member that has key length of 128 bits, and it should be secure for at least 250 − 1 byte queries and 2112 computations. Popular (lightweight) modes, such as OCB, OTR, CLOC, SILC, JAMBU, COFB, SAEB, Beetle, SUNDAE etc., require at least 128-bit primitives to meet the NIST criteria, as all of them are just birthday bound secure. Furthermore, most of them are sequential, and they either use a two pass mode or they do not offer any security when the adversary has access to unverified plaintext (RUP model). In this paper, we propose two new designs for lightweight AE modes, called LOCUS and LOTUS, structurally similar to OCB and OTR, respectively. These modes achieve notably higher AE security bounds with lighter primitives (only a 64-bit tweakable block cipher). Especially, they satisfy the NIST requirements: secure as long as the data complexity is less than 264 bytes and time complexity is less than 2128, even when instantiated with a primitive with 64-bit block and 128-bit key. Both these modes are fully parallelizable and provide full integrity security under the RUP model. We use TweGIFT-64[4,16,16,4] (also referred as TweGIFT-64), a tweakable variant of the GIFT block cipher, to instantiate our AE modes. TweGIFT-64-LOCUS and TweGIFT-64-LOTUS are significantly light in hardware implementation. To justify, we provide our FPGA based implementation results, which demonstrate that TweGIFT-64-LOCUS consumes only 257 slices and 690 LUTs, while TweGIFT-64-LOTUS consumes only 255 slices and 664 LUTs.

Secure ear biometrics using circular kernel principal component analysis, Chebyshev transform hashing and Bose–Chaudhuri–Hocquenghem error-correcting codes

Ear biometrics has generated an increased interest in the domain of biometric identification systems due to its robustness and covert acquisition potential. The external structure of the human ear has a bilateral symmetry structure. Here, we analyse ear biometrics based on ear symmetry features. We apply iterative closest point and kernel principal component analysis with circular kernel for feature extraction while using a circular kernel function, combined with empirical mode decomposition into intrinsic mode functions perceptual hashing using and fast Chebyshev transform, and a secure authentication approach that exploits the discrete logarithm problem and Bose–Chaudhuri–Hocquenghem error-correcting codes to generate 128-bit crypto keys. We evaluate the proposed ear biometric cryptosecurity system using our data set of ear images acquired from 103 persons. Our results show that the ear biometric-based authentication achieved an equal error rate of 0.13 and true positive rate TPR of 0.85.

Quantum Key Distribution with On‐Chip Dissipative Kerr Soliton

AbstractQuantum key distribution (QKD) can distribute symmetric key bits between remote legitimate users with the guarantee of quantum mechanics principles. For practical applications, there is increasing attention to integrating the source, detectors, and modulators on a photonic chip. Here, the Kerr dissipative soliton is introduced in a microresonator as the light source for GHz QKD systems, and the proof‐of‐principle experiment demonstrates the parallel QKD can be achieved using coherent comb lines from the soliton. The performance of parallel QKD is also verified by using the off‐the‐shelf wavelength division modules and the on‐chip soliton source. Since the on‐chip soliton can provide hundreds of carriers covering the C and L bands, the results exhibit the feasibility to achieve ultra‐high rate secure key bits through massively parallel QKD, especially when incorporated with the thriving photonic integrated circuit technology.

Generalized Spatial Modulation With Multi-Index Modulation

In this letter, we propose a novel scheme extending index dimension with two distinct signal constellations, named as generalized spatial modulation with multi-index modulation (GSM-MIM). Through this scheme, which exploits the spatial domain and index domain, more extra information bits are transmitted by the spatial indexes as compared with the traditional GSM system. More specifically, with the aid of a vector index bit, a transmitted spatial vector (TSV) is derived by combining two spatial vectors, one of which is obtained by mapping $M$ -ary pulse amplitude modulation ( $M$ -PAM) symbol on an antenna index (AI) vector with the aid of both a key index bit and a group of AI bits, and the other one of which is obtained by mapping $L$ -quadrature amplitude modulation ( $L$ -QAM) symbol on another AI vector with another group of AI bits. Furthermore, the modified $M$ -PAM ( $M$ -MoPAM) is designed for increasing the squared minimum Euclidean distance (SMED) between the TSVs, the average bit error probability (ABEP) and the SMED are provided and analyzed. Finally, simulation results using Monte Carlo demonstrate that the GSM-MIM scheme has a significantly lower bit error ratio (BER) than other MIMO schemes.