Cryptographic Applications Research Articles

FPGA based implementation of a perturbed Chen oscillator for secure embedded cryptosystems

This paper introduces an enhancement to the Chen chaotic system by incorporating a constant perturbation term d\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$d$$\\end{document} to one of the state variables, aiming to improve the performance of pseudo-random number generators (PRNGs). The perturbation significantly enhances the system's chaotic properties, resulting in superior randomness and increased security. An FPGA-based realization of a perturbed Chen oscillator (PCO)-derived PRNG is presented, tailored for embedded cryptosystems and implemented on a Nexys 4 FPGA card featuring the XILINX Artix-7 XC7A100T-1CSG324C integrated chip. The Xilinx-based system generator (XSG) tool is utilized to generate a digital version of the new oscillator, minimizing resource utilization. Experimental results demonstrate that the PCO-generated data successfully passes the NIST and TestU01 test suites. Additionally, statistical tests with key sensitivity are performed, validating the suitability of the designed PRNG for cryptographic applications. This establishes the PCO as a straightforward and efficient tool for multimedia security.

Singularity, Observability, and Independence: Unveiling Lorenz’s Cryptographic Potential

The key findings of this study include a detailed examination of the Lorenz system’s observability, revealing that it maintains high observability compared to other chaotic systems, thus supporting its potential use in cryptographic applications. We also investigated the singularity manifolds, identifying regions where observability might be compromised, but overall demonstrating that the system remains reliable across various states. Additionally, statistical tests confirm that the Lorenz system exhibits strong statistical independence in its outputs, further validating its suitability for encryption purposes. These findings collectively underscore the Lorenz system’s potential to enhance cryptographic security and contribute significantly to the field of secure communications. By providing a thorough analysis of its key properties, this study positions the Lorenz system as a promising candidate for advanced encryption technologies.

Application of Attribute-Based Encryption in Military Internet of Things Environment.

The Military Internet of Things (MIoT) has emerged as a new research area in military intelligence. The MIoT frequently has to constitute a federation-capable IoT environment when the military needs to interact with other institutions and organizations or carry out joint missions as part of a coalition such as in NATO. One of the main challenges of deploying the MIoT in such an environment is to acquire, analyze, and merge vast amounts of data from many different IoT devices and disseminate them in a secure, reliable, and context-dependent manner. This challenge is one of the main challenges in a federated environment and forms the basis for establishing trusting relationships and secure communication between IoT devices belonging to different partners. In this work, we focus on the problem of fulfillment of the data-centric security paradigm, i.e., ensuring the secure management of data along the path from its origin to the recipients and implementing fine-grained access control mechanisms. This problem can be solved using innovative solutions such as applying attribute-based encryption (ABE). In this work, we present a comprehensive solution for secure data dissemination in a federated MIoT environment, enabling the use of distributed registry technology (Hyperledger Fabric), a message broker (Apache Kafka), and data processing microservices implemented using the Kafka Streams API library. We designed and implemented ABE cryptography data access control methods using a combination of pairings-based elliptic curve cryptography and lightweight cryptography and confirmed their suitability for the federations of military networks. Experimental studies indicate that the proposed cryptographic scheme is viable for the number of attributes typically assumed to be used in battlefield networks, offering a good trade-off between security and performance for modern cryptographic applications.

Metalens array for quantum random number

Quantum random number generation (QRNG) leveraging intrinsic quantum uncertainty has attracted significant interest in the field of integrated photonic architecture, with applications in quantum cryptography, tests of quantum nonlocality, and beyond. The demand for compact, low-energy consumption, robust, fast, and cost-effective QRNGs integrated into photonic chips is highlighted, whereas most previous works focused on bulk optics. Here, based on the metalens array entangled source, we experimentally realized a miniaturized, high-dimensional quantum random number generator via a meta-device without post-randomness extraction. Specifically, the device has a high-density output with 100 channels per square millimeter. This chip-scale quantum randomness source can obtain random number arrays without post-randomness extraction and enable compact integration for quantum applications needing secure keys or randomness. Our approach demonstrates potential in secure key generation and randomness for quantum applications.

Dynamic group fuzzy extractor

The group fuzzy extractor allows group users to extract and reproduce group cryptographic keys from their individual non-uniform random sources. It can be easily used in group-oriented cryptographic applications. However, current group fuzzy extractors are not dynamic, i.e. they spend a large cost when dealing with user revocation. In this work, we propose the formal definition and construction of dynamic group fuzzy extractor (DGFE) to address this issue. For the revocation, DGFE allows unrevoked group users to reproduce updated group keys from the existing group help data. Meanwhile, it prevents any revoked group user from generating new group keys using the previously authorized individual help data. We propose a DGFE construction based on the revocable group signature. Furthermore, we give formal proofs of reusability, anonymity and traceability of our construction.

Matryoshka multistability: Coexistence of an infinite number of exactly self-similar nested attractors in a fractal phase space

Multistability, and its special types such as megastability and extreme multistability, is an important phenomenon in modern nonlinear science that provides several possible practical applications. In this paper, we propose a new special type of multistability when the infinite number of exactly self-similar attractors nested inside each other coexist in a system. We called it matryoshka multistability due to its resemblance to the famous Russian wooden doll. We theoretically explain and experimentally confirm the properties of a new type of multistable behavior using two representative examples based on the Chua and Sprott Case J chaotic systems. In addition, we construct an adaptive controller for synchronizing two Chua-type matryoshka multistable systems when the amplitude of the master system is of arbitrary scale. The proposed type of multistability can find several applications in chaotic communication, cryptography, and data compression.

Memory architecture to mitigate side channel attacks for cryptographic application using loop cut technique

Cryptography is crucial in embedded systems for safeguarding sensitive information, maintaining data integrity, and facilitating secure communication. L1 cache memory enhances overall performance by temporarily storing cryptographic keys. Post-quantum cryptography (PQC) focuses on creating algorithms that stay secure even against quantum computing threats. However, PQC doesn't fully protect against side-channel attacks (SCA). As IoT devices like wearable health monitors and industrial sensors become more widespread, the demand for lightweight cryptography increases to balance security with resource constraints. Yet, lightweight cryptography can face challenges, including reduced security and increased susceptibility to SCA due to smaller key sizes. Attackers can exploit power consumption patterns through side-channel attacks (SCA), such as Power Analysis, to extract these secret keys. Once a key is compromised, encrypted data becomes vulnerable. In cloud computing cache side-channel attacks take advantage of multiple virtual machines running simultaneously on the same hardware, enabling them to extract sensitive information from encryption processes. Although many SRAM cells have been designed in the literature, none offer complete security against SCA. This paper presents a new architecture for secure cache memory using a proposed 10T SRAM cell that secures all three cell operations (read, write, and hold) against SCA attacks. Additionally, this architecture also prevents half selection issue in cache memory. The security measure of proposed-10T cell is 97.19 % which is highest among all other cells and reliability measure is 82.03 %.The cell also offers highest hold stability of 421 mV along with good read stability and write ability of 220 mV and 334 mV respectively. The leakage of Proposed-10T cell is also less i.e., 13.56 pA. The Performance and Security Factor (PSF) is computed for all considered cells, encompassing various performance and security metrics. The normalized PSF (PSF)N of the Proposed-10T cell is 2.17, the highest among all cells considered for comparison. Therefore, the Proposed-10T cell architecture is fully secure against SCA and achieves better performance during cell operations.

Majorisation‐minimisation algorithm for optimal state discrimination in quantum communications

AbstractDesigning optimal measurement operators for quantum state discrimination (QSD) is an important problem in quantum communications and cryptography applications. Prior works have demonstrated that optimal quantum measurement operators can be obtained by solving a convex semidefinite program (SDP). However, solving the SDP can represent a high computational burden for many real‐time quantum communication systems. To address this issue, a majorisation‐minimisation (MM)‐based algorithm, called Quantum Majorisation‐Minimisation (QMM) is proposed for solving the QSD problem. In QMM, the authors reparametrise the original objective, then tightly upper‐bound it at any given iterate, and obtain the next iterate as a closed‐form solution to the upper‐bound minimisation problem. Our numerical simulations demonstrate that the proposed QMM algorithm significantly outperforms the state‐of‐the‐art SDP algorithm in terms of speed, while maintaining comparable performance for solving QSD problems in quantum communication applications.

Representations of group actions and their applications in cryptography

Cryptographic group actions provide a flexible framework that allows the instantiation of several primitives, ranging from key exchange protocols to PRFs and digital signatures. The security of such constructions is based on the intractability of some computational problems. For example, given the group action (G,X,⋆), the weak unpredictability assumption (Alamati et al. (2020) [1]) requires that, given random xi's in X, no probabilistic polynomial time algorithm can compute, on input {(xi,g⋆xi)}i=1,…,Q and y, the set element g⋆y.In this work, we study such assumptions, aided by the definition of group action representations and a new metric, the q-linear dimension, that estimates the “linearity” of a group action, or in other words, how much it is far from being linear. We show that under some hypotheses on the group action representation, and if the q-linear dimension is polynomial in the security parameter, then the weak unpredictability and other related assumptions cannot hold. This technique is applied to some actions from cryptography, like the ones arising from the equivalence of linear codes, as a result, we obtain the impossibility of using such actions for the instantiation of certain primitives.As an additional result, some bounds on the q-linear dimension are given for classical groups, such as Sn, GL(Fn) and the cyclic group Zn acting on itself.

Applications of Fourier transforms in engineering

The Fourier transform was proposed by Fourier in 1807. Fourier transform is a method of analyzing signals, which can analyze the components of the signal or synthesize the signal using these components. Many waveforms can be used as signal components, such as sine waves, square waves, sawtooth waves, etc. The Fourier transform uses sine waves as components of the signal. Due to its excellent properties, the Fourier transform has a wide range of applications in physics, number theory, combinatorial mathematics, signal processing, probability, statistics, cryptography, acoustics, optics, and other fields. This paper focuses on the study of fractional-order Fourier transform in the engineering field, for the equipment of the tiny fault diagnosis method, and according to some existing diagnostic methods, put forward the idea of diagnostic method enhancement.

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.