Cryptographic Applications Research Articles

The effect of switching and cycle-to-cycle variations of RRAM on 4-bit encryption/decryption process

The resistive RAM (RRAM) based in-memory computation is a promising technology to overcome the Von-Neumann bottleneck to provide fast and efficient computation. The RRAM is the most appropriate choice for cryptographic applications like encryption/decryption in which the data is computed and stored in the memory itself which enhances the security. The variability issue of RRAM namely switching or device parameter variations and cycle-to-cycle variations deteriorates the functionality of RRAM based circuits. In this paper, the XOR gate with V/R-R logic and a 4-bit encryption/decryption process are implemented using the RRAM Stanford model integrated in the Cadence circuit simulator. The output voltage variations of XOR gate and the encryption/decryption by varying switching and cycle-to-cycle parameters are analyzed. The range of switching parameters of the model that provides the accurate outputs of XOR gate and encryption/decryption is determined.

Fractional Duals of the Poisson Process on Time Scales with Applications in Cryptography

Fractional Duals of the Poisson Process on Time Scales with Applications in Cryptography

A chip-integrated homodyne detection system with enhanced bandwidth performance for quantum applications

The rapid development of quantum technology has driven the need for high-performance quantum signal processing modules. Balanced homodyne detector (BHD) is one of the most promising options for practical quantum state measurement, providing substantial advantages of cost-effectiveness, no cooling requirement, and system compactness. However, due to the stringent requirements in BHD design, it typically suffers from a relatively small operating bandwidth which limits the overall speed of a quantum system. In this study, we propose comprehensive modelling for the BHD in quantum applications and enhance the performance of BHDs based on our modelling. Specifically, we utilise a photonic chip approach and optimise the electronic design to create the integrated BHD, which significantly boosts the 3 dB bandwidth to 4.75 GHz and achieves a shot-noise-limited bandwidth of 23 GHz. We demonstrate the capability of this setup to generate quantum random numbers at a rate of 240 Gbit s−1, highlighting its potential for ultra-high-speed quantum communication and quantum cryptography applications.

Pseudo-random number generation based on spatial chaotic map of Logistic type and its cryptographic application

The pseudo-random number generator (PRNG) based on chaos has been widely used in the fields of digital communication, cryptography and computer simulation. In this paper, we study a new PRNG based on spatial surface chaotic system (SSCS), which is constructed based on coupling mapping lattice (CML) and one-dimensional Logistic chaotic map. To verify the performance of this generator, we study its nonlinear dynamic properties, including the Lyapunov exponent, ergodicity and bifurcation phenomena. Moreover, we analyze the cryptographic properties such as key space, key sensitivity, correlation, histogram and information entropy, while performing NIST SP800-22 test and TestU01 test for the randomness of this system. Theoretical analysis and numerical simulation results show that the PRNG proposed in this paper has good complexity, ergodicity, sensitivity and randomness. Moreover, the key space can increase dynamically with the increase of encrypted data, especially suitable for the protection of big data such as multimedia, which is more advantageous than most existing chaotic mapping. The results of this paper will provide a new idea for the study of chaotic cryptography, and motivate the study of new discrete chaotic models with desirable statistical properties.

Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes

Chameleon-hash functions, introduced by Krawczyk and Rabin (NDSS’00), are trapdoor collision-resistant hash functions parametrized by a public key. If the corresponding secret key is known, arbitrary collisions for the hash function can be found efficiently. Chameleon-hash functions have prominent applications in the design of cryptographic primitives, such as lifting non-adaptively secure signatures to adaptively secure ones. Recently, this primitive also received a lot of attention as a building block in more complex cryptographic applications, ranging from editable blockchains to advanced signature and encryption schemes. We observe that, in latter applications, various different notions of collision-resistance are used, and it is not always clear if the respective notion really covers what seems intuitively required by the application. Therefore, we revisit existing collision-resistance notions in the literature, study their relations, and by means of selected applications discuss which practical impact different notions of collision-resistance might have. Moreover, we provide a stronger, and arguably more desirable, notion of collision-resistance than what is known from the literature (which we call full collision-resistance). Finally, we present a surprisingly simple, and efficient, black-box construction of chameleon-hash functions achieving this strong notion of full collision-resistance.

Some classes of functions with low c-differential uniformity over finite fields

Multiplicative differential (and the corresponding [Formula: see text]-differential uniformity) was introduced by Ellingsen et al. in [[Formula: see text]-differentials, multiplicative uniformity and (almost) perfect [Formula: see text]-nonlinearity, IEEE Trans. Inf. Theory 66(9) (2020) 5781–5789], which has attracted lots of attention. Functions with low [Formula: see text]-differential uniformity over finite fields, especially the P[Formula: see text]N and AP[Formula: see text]N functions, have been widely investigated due to their applications in cryptography. In this paper, we first compute the [Formula: see text]-differential uniformity of two classes of permutation polynomials. For one of these, we explicitly determine the [Formula: see text]-DDT entries. For the second type of function, we give bounds for its [Formula: see text]-differential uniformity. Besides, several classes of P[Formula: see text]N or AP[Formula: see text]N functions are presented by employing some known functions and the (generalized) AGW criterion.

Modified genetic algorithms for generating S-boxes with high nonlinearity

This article discusses the use of modified genetic algorithms to generate S-boxes with high nonlinearity, which is critical for ensuring the security of cryptographic algorithms. S-boxes play a key role in providing resistance to cryptanalysis, in particular to linear and differential cryptanalysis attacks. In the course of the study, a series of experiments were conducted using a genetic algorithm modified by additional storage of the current population and the use of selection. This approach has significantly improved the efficiency of the algorithm compared to the classical genetic algorithm. The best results were achieved with the minimum number of instances in the population and the optimal number of mutations. It was found that the algorithm finds S-blocks with a probability of 99% with a nonlinearity of 104, which demonstrates its high efficiency. The results of the study showed that the modified algorithm is able to provide stable generation of S-boxes with the required attack resistance properties. The proposed method also proved to be flexible in parameter settings, which allows it to be adapted for various cryptographic applications. The paper also discusses the possibilities of further improving the algorithm, including the study of other mutation and selection methods, as well as parameter optimization to achieve even better results. Additionally, the possibility of using distributed computing to increase the speed of S-boxes generation is considered. The results of the study indicate the prospects of the proposed approach for creating attack-resistant cryptographic systems. This study considered the use of genetic algorithms to generate S-boxes with high nonlinearity. The proposed approach was based on the use of an objective function with optimal parameters, which allowed achieving high efficiency in generating bioactive S-blocks. The proposed algorithm showed high stability and efficiency in generating S-boxes with nonlinearity, which is confirmed by a 99% probability of achieving the goal. These results indicate the prospects of using genetic algorithms in cryptographic applications that require high resistance to attacks. In future research, it is planned to further improve the algorithm by exploring other methods of mutation and selection, as well as optimizing parameters to achieve even better results. In addition, it is possible to use distributed computing to further speed up the process of generating S-boxes.

A Closer Look at the Statistical Behavior of a Chaotic System with Message Inclusion for Cryptographic Applications

One technique, especially in chaos-based cryptographic applications, is to include the message in the evolution of the dynamical system. This paper aims to find out if and to what extent the statistical behavior of the chaotic system is affected by the message inclusion in its dynamic evolution. The study is illustrated by the dynamical system described by the logistic map in cryptographic applications based on images. The evaluation of the statistical behavior was performed on an original scheme proposed. The Monte Carlo analysis of the applied Kolmogorov–Smirnov statistical test revealed that the dynamical system in the processing scheme with message inclusion does not modify its proper statistical behavior (revealed by definition relation). This was possible due to the proposed scheme designed. Namely, this scheme contains a decision switch which, supported by an appropriate choice of the magnitude of the scaling factor, ensures that the values of the dynamical system are maintained in the definition domain. The proposed framework for analyzing the statistical properties and for preserving the dynamical system behavior is one main contribution of this research. The message inclusion scheme also provides an enhancement with cryptographic mixing functions applied internally; the statistical behavior of the dynamical system is also analyzed in this case. Thus, the paper contributes to the theoretical complex characterization of the dynamical system considering also the message inclusion case.

Quantum Computing Applications in Cryptography: Enhancing Security and Identifying Vulnerabilities

Quantum Computing Applications in Cryptography: Enhancing Security and Identifying Vulnerabilities

FPGA Acceleration of AES Algorithm for High-Performance Cryptographic Applications

This research paper presents the FPGA implementation of the AES-128 Algorithm as an accelerator tailored for high-performance cryptographic applications. Leveraging the capabilities of the Virtex-7 evaluation kit, the AES algorithm is meticulously coded using Xilinx Vivado software. The results of the implementation reveal a resource-efficient design, utilizing 588 Look-Up Tables (LUTs) and 353 Flip Flops. This implementation showcases the efficacy of FPGA technology, specifically the Virtex-7 device, in achieving a fine balance between algorithmic complexity and resource utilization for cryptographic acceleration. The abstract underscores the significance of this research in advancing the field of hardware-accelerated cryptographic applications, offering a scalable solution with promising resource efficiency on the FPGA platform.

An efficient high throughput BCH module for multi-bits error correction mechanism on hardware platform

The bose-chaudhuri-hocquenghem (BCH) codes are a cyclic error correction codes (ECC) class. The BCH is constructed by using a polynomial over the Galois field. The BCH codes can detect and correct the multi-bits with an easy decoding mechanism. The BCH codes are used in most of the storage device's cryptography, disk drives, and satellite applications. This manuscript presents an efficient high-throughput BCH module with an encoding and decoding mechanism for multi-bit corrections. The BCH code of (15, k) is used to construct the encoder and decoder architectures. The BCH encoder decoder (ED) module with single error correction (SEC), double error correction (DEC), and triple-error correction (TEC) are discussed in detail. The BCH encoder module uses a linear feedback shift register (LFSR). The BCH decoder with SEC and DEC is constructed using the syndrome generator module (SGM) and chien search module (CSM). The BCH decoder with TEC is designed using SGM, inversion-based berlekamp-massey-algorithm (BMA), and CSMs. The BCH-ED module with SEC, DEC, and TEC utilizes <1 % chip area on Artix-7 FPGA. The BCH-ED with SEC, DEC, and TEC achieves a throughput of 7.13 Gbps, 1.2 Gbps, and 0.803 Gbps, respectively. Lastly, the BCH module is compared with existing BCH approaches with better improvement in chip area, frequency, and throughput parameters.

A Plasmonic Optoelectronic Resistive Random-Access Memory for In-Sensor Color Image Cryptography.

The optoelectronic resistive random-access memory (RRAM) with the integrated function of perception, storage and intrinsic randomness displays promising applications in the hardware level in-sensor image cryptography. In this work, 2D hexagonal boron nitride based optoelectronic RRAM is fabricated with semitransparent noble metal (Ag or Au) as top electrodes, which can simultaneous capture color image and generate physically unclonable function (PUF) key for in-sensor color image cryptography. Surface plasmons of noble metals enable the strong light absorption to realize an efficient modulation of filament growth at nanoscale. Resistive switching curves show that the optical stimuli can impede the filament aggregation and promote the filament annihilation, which originates from photothermal effects and photogenerated hot electrons in localized surface plasmon resonance of noble metals. By selecting noble metals, the optoelectronic RRAM array can respond to distinct wavelengthsand mimic the biological dichromatic cone cells to perform the color perception. Due to the intrinsic and high-quality randomness, the optoelectronic RRAM can produce a PUF key in every exposure cycle, which can be applied in the reconfigurable cryptography. The findings demonstrate an effective strategy to build optoelectronic RRAM for in-sensor color image cryptography applications.

Failing to Hash Into Supersingular Isogeny Graphs

Abstract An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of ‘hard supersingular curves’ that is equations for supersingular curves for which computing the endomorphism ring is as difficult as it is for random supersingular curves. A related open problem is to produce a hash function to the vertices of the supersingular $\ell $-isogeny graph, which does not reveal the endomorphism ring, or a path to a curve of known endomorphism ring. Such a hash function would open up interesting cryptographic applications. In this paper, we document a number of (thus far) failed attempts to solve this problem, in the hope that we may spur further research, and shed light on the challenges and obstacles to this endeavour. The mathematical approaches contained in this article include: (i) iterative root-finding for the supersingular polynomial; (ii) gcd’s of specialized modular polynomials; (iii) using division polynomials to create small systems of equations; (iv) taking random walks in the isogeny graph of abelian surfaces, and applying Kummer surfaces and (v) using quantum random walks.

Cryptographic Application of Elliptic Curve Generated through Centered Hexadecagonal Numbers

Background/Objectives: Elliptic Curve Cryptography (ECC) is a public-key encryption method that is similar to RSA. ECC uses the mathematical concept of elliptic curves to achieve the same level of security with significantly smaller keys, whereas RSA's security depends on large prime numbers. Elliptic curves and their applications in cryptography will be discussed in this paper. The elliptic curve is formed by the extension of a Diophantine pair of Centered Hexadecagonal numbers to a Diophantine triple with property D(8). Method: The Diffie–Hellman key exchange, named for Whitfield Diffie and Martin Hellman, was developed by Ralph Merkle and is a mathematical technique for safely transferring cryptographic keys over a public channel. Based on the Diffie–Hellman key exchange, the ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography. The generation of keys, encryption and decryption are the three main operations of the ElGamal cryptosystem. Findings: Given the relative modesty of our objectives, the fundamental algebraic and geometric characteristics of elliptic curves shall be delineated. Then the behaviour of elliptic curves modulo p: ultimately, there is a fairly strong analogy between the structure of the points on an elliptic curve modulo p and the integers modulo n will be studied. In the end, elliptic curve ElGamal encryption analogues of Diffie–Hellman key exchange will be created. Novelty: Elliptic curves are encountered in a multitude of mathematical contexts and have a varied and fascinating history. Elliptic curves are very significant in number theory and are a focus of much recent work. The earlier research works in Elliptic Curve Cryptography has concentrated on computer algorithms and pairing – based algorithms. In this paper, the concept of polygonal numbers and its extension from Diophantine pair to triples is encountered, thus forming an elliptic curve and perform the encryption-decryption process. MSC Classification Number: 11D09, 11D99,11T71,11G05. Keywords: Elliptic curves, Cryptography, Encryption, Decryption, Centered polygonal numbers

The boomerang uniformity of three classes of permutation polynomials over 𝔽2n

Permutation polynomials with low boomerang uniformity have wide applications in cryptography. In this paper, by utilizing the Weil sums technique and solving some certain equations over [Formula: see text], we determine the boomerang uniformity of these permutation polynomials: (1) [Formula: see text], where [Formula: see text], [Formula: see text] with [Formula: see text]; (2) [Formula: see text], where [Formula: see text], [Formula: see text] with [Formula: see text]; (3) [Formula: see text], where [Formula: see text], [Formula: see text] with [Formula: see text]. The results show that the boomerang uniformity of [Formula: see text], [Formula: see text] and [Formula: see text] can attain [Formula: see text].

Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors

We put forward two natural generalizations of predicate encryption (PE), dubbed multi-key and multi-input PE. More in details, our contributions are threefold.Definitions. We formalize security of multi-key PE and multi-input PE following the standard indistinguishability paradigm, and modeling security both against malicious senders (i.e., corruption of encryption keys) and malicious receivers (i.e., collusions).Constructions. We construct adaptively secure multi-key and multi-input PE supporting the conjunction of poly-many arbitrary single-input predicates, assuming the sub-exponential hardness of the learning with errors (LWE) problem.Applications. We show that multi-key and multi-input PE for expressive enough predicates suffices for interesting cryptographic applications, including non-interactive multi-party computation (NI-MPC) and matchmaking encryption (ME). In particular, plugging in our constructions of multi-key and multi-input PE, under the sub-exponential LWE assumption, we obtain the first ME supporting arbitrary policies with unbounded collusions, as well as robust (resp. non-robust) NI-MPC for so-called all-or-nothing functions satisfying a non-trivial notion of reusability and supporting a constant (resp. polynomial) number of parties. Prior to our work, both of these applications required much heavier tools such as indistinguishability obfuscation or compact functional encryption.

A new 2D-HELS hyperchaotic map and its application on image encryption using RNA operation and dynamic confusion

Chaotic systems are commonly being researched for applications in cryptography. In this study, a novel chaotic two-dimensional hyperchaotic exponential adjusted Logistic and sine map (2D-HELS) is derived from the well-known two-dimensional Logistic map and Sine maps. The resulting chaotic system is demonstrated with the help of bifurcation diagram, chaos trajectories, Lyapunov exponent, sample entropy, permutation entropy, and 0–1 test. A new image encryption algorithm (IEA) is proposed utilizing the 2D-HELS to ensure the essential characteristics of a good cryptographic structure “permutation-diffusion”. The IEA utilizes dynamic confusion strategy and RNA operation to achieve a highly secure cipher-image. Theoretical analysis and simulation results are compared with some recently developed cryptosystems. It demonstrates that the 2D-HELS-IEA has splendid achievement in well-known security indicators. Hence, the 2D-HELS-IEA is highly secure as a conclusion.

Performance Evaluation of Genetic Algorithm-Driven Blockchain Encryption for EHR Management and Validation

In the realm of electronic health record (EHR) management, ensuring robust security and validation mechanisms is paramount due to the sensitive nature of healthcare data. This research focuses on the performance evaluation of a genetic algorithm-driven blockchain encryption approach for enhancing EHR security and validation. The proposed method leverages genetic algorithms to optimize encryption parameters within a blockchain framework, aiming to safeguard patient privacy and prevent unauthorized access. By integrating advanced cryptographic techniques like Elliptic Curve Cryptography (ECC) and Keyed-Hash Message Authentication Code (HMAC)-based authentication, along with machine learning for data classification. The evaluation of the approach holds significant promise in advancing secure EHR management practices, addressing critical challenges in data privacy and integrity within healthcare environments. Finally, as a result, this study presents a comparative analysis of cryptographic systems genetic algorithm-driven blockchain encryption (GADBE)+ECC and GADBE+ Advanced Encryption Standard (AES), focusing on the scaling of encryption and decryption times relative to key sizes and data volumes. Results show that both systems exhibit increasing times with larger key sizes and data sizes. ECC consistently demonstrates superior speed over AES, with decryption times ranging from 0.4 to 3.5 seconds for key sizes from 128 to 512 bits, indicating potential performance advantages of ECC in cryptographic applications.

Binary and ternary leading-systematic LCD codes from special functions

Linear complementary dual codes (LCD codes for short) are an important subclass of linear codes which have nice applications in communication systems, cryptography, consumer electronics and information protection. In the literature, it has been proved that an [n,k,d] Euclidean LCD code over Fq with q>3 exists if there is an [n,k,d] linear code over Fq, where q is a prime power. However, the existence of binary and ternary Euclidean LCD codes has not been totally characterized. Hence it is interesting to construct binary and ternary Euclidean LCD codes with new parameters. In this paper, we construct new families of binary and ternary leading-systematic Euclidean LCD codes from some special functions including semibent functions, quadratic functions, almost bent functions, and planar functions. These LCD codes are not constructed directly from such functions, but come from some self-orthogonal codes constructed with such functions. Compared with known binary and ternary LCD codes, the LCD codes in this paper have new parameters.

Thinking about the application of commercial cryptography in intelligent connected vehicles

As an important part of intelligent transportation, the information security of connected vehicles has become increasingly prominent. As a key technology to ensure the information security of networked vehicles, commercial cryptography plays an important role in vehicle identity authentication, data encryption and secure communication. In this paper, the status quo, challenges and future development trend of commercial cryptography application in connected vehicles are discussed, and some suggestions are put forward to strengthen technology research and development, standardization and industry cooperation. By continuously optimizing the application strategy of commercial cryptography, the information security level of connected vehicles can be effectively improved, providing strong support for the security development of the industry.