Cryptographic Applications Research Articles

Custom TTA Operations for Accelerating the Ascon Encryption Algorithm

Lightweight cryptography is becoming increasingly important in modern applications, especially in resource-constrained environments such as Internet of Things (IoT) devices, embedded systems and mobile platforms. The Ascon encryption algorithm is a modern, secure and efficient cryptographic scheme that meets the demands of low-power devices. However, some steps of the algorithm are computationally intensive, leading to performance issues. In this study, custom operations are proposed to accelerate the Ascon encryption algorithm on Transport-Triggered Architecture (TTA) processors. In order to make more efficient use of hardware resources, the custom operations are designed to have low complexity and high efficiency. The OpenASIP tool was employed to integrate the operations into a general purpose 64-bit TTA processor. The resulting application-specific core was implemented in Hardware Description Language (HDL) and synthesised for FPGA. The performance gain is analysed for different transport bus configurations. The results obtained show that the Ascon-AEAD128 encryption and decryption phases are accelerated by 38% to 50%. When evaluated together with the synthesis results, a significant performance gain was achieved with a very reasonable increase in hardware resources. The study also emphasises that the TTA is a suitable method for accelerating cryptographic applications that require low power consumption and high efficiency.

On novel Hexa-compound combination synchronization over nineteen n-dimensional category-B chaotic systems and electronic circuit schematic

Abstract Synchronization of chaotic models involving multiple drives and responses has numerous practical applications in cryptography and information processing. Existing research on synchronizing multiple chaotic systems is currently limited to twelve components. This study introduces a novel higher-order synchronization method, hexa compound combination, that synchronizes an assembly of nineteen n-dimensional chaotic models. Well-known synchronization methods, such as double compound, triple compound, and quad compound, serve as particular instances of this new strategy. Thus, our research significantly advances the understanding of multi-leveled chaos synchronization. In addition, we also present a non-uniformly conservative system classified into a rare category B, analyze its dynamic properties, and utilize it for achieving the proposed synchronization. Numerical results are provided through graphical representations to illustrate the efficacy of the new synchronization approach by comparing it with other techniques. Furthermore, we emulate the corresponding virtual schematic circuit of the newly designed system to evaluate its real-world applicability and utility.

Application of Classical and Genomic Cryptography on Textual Dataset

Cryptology is one of the methods used when sharing confidential or private data over any communication network that poses a security risk. It is applied to restrict access, minimize or completely prevent dangerous situations. Cryptographic algorithms use a combination of mathematical operations and applications to protect information. It strives to ensure the confidentiality, integrity, availability and non-repudiation of information. In other words, it aims to keep data safe against all kinds of threats. However, the performance of these objectives depends on various factors. These factors include the file format used, the volume and complexity of the data. Additionally, the key system and application platform (software and hardware) also affect performance. These variables determine the effectiveness of cryptographic algorithms. In fact, existing cryptographic algorithms may be inadequate or ineffective in the face of new requirements. Therefore, new techniques need to be designed to meet such needs. This study, one of the new generation cryptographic techniques, includes a symmetric key genomics (DNA)-based application. The aim is to test the suitability of genomic encryption on artificial data sets (100 and 500 KB, 1 and 5 MB) generated from the content named "Siyasetname" in the Turkish textual data type. The usability of the genomic encryption technique, which has not been applied before in Turkish data sets, was tested by comparing it with classical algorithms such as AES (symmetric) and ECDH (asymmetric). Performance criteria are determined as encoding and decoding times (seconds), memory consumption (MB) and processor usage (%), which are accepted in the literature for textual data type. It is supported by different indicators according to dimensions and more successful outcomes compared to similar studies in the literature. These findings suggest that DNA/genomic encryption techniques can be considered as an alternative solution to cryptographic requirements.

A Framework for Generating S-Box Circuits with Boyer–Peralta Algorithm-Based Heuristics, and Its Applications to AES, SNOW3G, and Saturnin

In many lightweight cryptography applications, low area and latency are required for efficient implementation. The gate count in the cipher and the circuit depth must be low to minimize these two metrics. Many optimization strategies have been developed for the linear layer, led by the Boyer–Peralta (BP) algorithm. The Advanced Encryption Standard (AES) has been a focus of extensive research in this area. However, while the linear layer uses only XOR gates, the S-box, which is an essential nonlinear component in symmetric cryptography, uses various gate types, making optimization challenging, particularly as the bit size increases.In this paper, we propose a new framework for a heuristic search to optimize the circuit depth or XOR gate count of S-box circuits. Existing S-box circuit optimization studies have divided the nonlinear and linear layers of the S-box, optimizing each separately, but limitations still exist in optimizing large S-box circuits. To extend the optimization target from individual internal components to the entire S-box circuit, we extract the XOR information of each node in the target circuit and reconstruct the nodes based on nonlinear gates. Next, we extend the BP algorithm-based heuristics to address nonlinear gates and incorporate this into the framework. It is noteworthy that the effects of our framework occur while maintaining the AND gate count and AND depth without any increase.To demonstrate the effectiveness of the proposed framework, we apply it to the AES, SNOW3G, and Saturnin S-box circuits. Our results include depth improvements by about 40% and 11% compared to the existing AES S-box [BP10] and Saturnin super S-box [CDL+20] circuits, respectively. We implement a new circuit for the SNOW3G S-box, which has not previously been developed, and apply our framework to reduce its depth. We expect the proposed framework to contribute to the design and implementation of various symmetric-key cryptography solutions.

Hybrid Population-Based Hill Climbing Algorithm for Generating Highly Nonlinear S-boxes

This paper introduces the hybrid population-based hill-climbing (HPHC) algorithm, a novel approach for generating cryptographically strong S-boxes that combines the efficiency of hill climbing with the exploration capabilities of population-based methods. The algorithm achieves consistent generation of 8-bit S-boxes with a nonlinearity of 104, a critical threshold for cryptographic applications. Our approach demonstrates remarkable efficiency, requiring only 49,277 evaluations on average to generate such S-boxes, representing a 600-fold improvement over traditional simulated annealing methods and a 15-fold improvement over recent genetic algorithm variants. We present comprehensive experimental results from extensive parameter space exploration, revealing that minimal populations (often single-individual) combined with moderate mutation rates achieve optimal performance. This paper provides detailed analysis of algorithm behavior, parameter sensitivity, and performance characteristics, supported by rigorous statistical evaluation. We demonstrate that population size should approximate available thread count for optimal parallel execution despite smaller populations being theoretically more efficient. The HPHC algorithm maintains high reliability across diverse parameter settings while requiring minimal computational resources, making it particularly suitable for practical cryptographic applications.

On random sampling of supersingular elliptic curves

AbstractWe consider the problem of sampling random supersingular elliptic curves over finite fields of cryptographic size (SRS problem). The currently best-known method combines the reduction of a suitable complex multiplication (CM) elliptic curve and a random walk over some supersingular isogeny graph. Unfortunately, this method is not suitable when the endomorphism ring of the generated curve needs to be hidden, like in some cryptographic applications. This motivates a stricter version of the SRS problem, requiring that the sampling algorithm gives no information about the endomorphism ring of the output curve (cSRS problem). In this work we formally define the SRS and cSRS problems, which are both of theoretical interest. We discuss the relevance of the two problems for cryptographic applications, and we provide a self-contained survey of the known approaches to solve them. Those for the cSRS problem have exponential complexity in the characteristic of the base finite field (since they require computing and finding roots of polynomials of large degree), leaving the problem open. In the second part of the paper, we propose and analyse some alternative techniques—based either on the Hasse invariant or division polynomials—and we explain the reasons why they do not readily lead to efficient cSRS algorithms, but they may open promising research directions.

General phase-covariant quantum cloning

Phase-covariant quantum cloning has important applications in quantum cryptography. This paper proposes the unitary transformation of the optimal 1 → 2 general phase covariant quantum cloning in two dimensions and obtains the maximal fidelity of copies. In addition, an experimental scheme is designed to implement this unitary transformation using linear optical elements, and the scheme is feasible under the present experimental technology.

To the logical foundations of random number generator construction

Abstract This study explores fundamental aspects of probability theory within the framework of constructing random sequences or random number generators. We propose an interpretation of probability spaces and operations on formal events through the theory of formal languages, utilizing string manipulation techniques. As part of the research, we present a direct implementation of the discussed concepts in the form of a program that generates random numbers of the required type by processing signals from a sound card. Additionally, the problem of primality testing, which is particularly relevant to practical cryptographic applications, is addressed. We critically examine common misconceptions regarding the properties of Carmichael numbers and the application of Fermat’s Little Theorem. Furthermore, we propose an efficient primality testing algorithm.

Enhancing security and randomness in cryptography and non-cryptographic applications with ORNA algorithm

Abstract In this paper, we advocate for using PRNGs to generate long sequences of statistically random numbers, also known as pseudorandom numbers. It has several practical applications, including cryptography, weather-based stimulation, procedural environment noise generation in games and casinos, and scientific simulations of real-world problems, like city traffic systems that use it to stimulate cars. One distinctive feature of our approach is the PRNG algorithm we propose; this algorithm has successfully produced statistically sound long-term sequences. The properties of the PRNG are assessed using several statistical methods. Our work presents the Oscillating Random Number Algorithm (ORNA), a new kind of random number generator, and examines both the statistical tests proposed by NIST and the results that ORNA has generated. The following also describes the several preceding algorithms developed, including the Mersenne Twister Algorithm (MT19937) and the Permuted Congruential Algorithm (PCG128), and compares ORNA’s graphical efficiency to theirs. In this work, we compared ORNA to MT19937 and PCG128, and found that ORNA excels according to all 16 statistical tests. ORNA has three primary benefits, namely, superior statistical performance, quicker code execution, and simpler code implementation due to the algorithm’s reduced complexity.

Exploration and Development of Quantum Computing Algorithms for Optimization, Cryptography, and Machine Learning Applications

Quantum computing, with its potential to revolutionize computation, relies fundamentally on the development of efficient algorithms to leverage its unparalleled processing capabilities. This research delves into the creation, exploration, and refinement of quantum computing algorithms, focusing on their applications in optimization, cryptography, and machine learning. Quantum algorithms such as Shor's and Grover's have demonstrated remarkable advantages in factorization and search problems, while more recent innovations are tackling complex challenges in global optimization and data analysis. By integrating principles of quantum mechanics—such as superposition, entanglement, and interference—these algorithms promise exponential speed-ups over classical counterparts in specific domains. This study critically analyzes existing quantum algorithms, proposes advancements in hybrid quantum-classical frameworks, and explores their implications for practical problem-solving. Through simulations and theoretical evaluations, it aims to bridge the gap between quantum theory and real-world applications, contributing to the evolution of quantum computing as a transformative technology.

Generating Bent Functions and Dynamic Filters: A Novel Equivalence-Based Approach

Boolean functions are fundamental building blocks in both discrete mathematics and computer science, with applications spanning from cryptography to coding theory. Bent functions, a subset of Boolean functions with maximal nonlinearity, are particularly valuable in cryptographic applications. This study introduces a novel equivalence relation among all Boolean functions and presents an algorithm to generate bent functions based on this relation. We systematically generated a collection of 10,000 bent functions over eight variables, all originating from the same equivalence class, and analyzed their structural complexity through rank determination. Our findings revealed the presence of at least five distinct affine classes of bent functions within this collection. By employing this construction, we devised an algorithm to generate a filter function capable of combining Boolean functions. This filter function can be dynamically adjusted based on a key, offering potential applications in symmetric cipher design, such as enhancing security or improving efficiency.

Cavity-enhanced induced coherence without induced emission

This paper presents a theoretical study of the enhancement of Zou-Wang-Mandel (ZWM) interferometry through cavity-enhanced spontaneous parametric down-conversion (SPDC) processes producing frequency-entangled biphotons. The ZWM interferometry shows the capability to generate interference effects between single signal photons via indistinguishability between the entangled idler photons. This paper extends the foundational principles of ZWM interferometry by integrating cavity-enhanced SPDCs, aiming to narrow photon bandwidths for improved coherence and photon pair generation efficiency, which is critical for applications in quantum information technologies, quantum encryption, and quantum imaging. This work explores the theoretical implication of employing singly resonant optical parametric oscillators within the ZWM interferometer to produce narrow-band single photons. By combining cavity-enhanced SPDCs with ZWM interferometry, this study fills a gap in current theoretical proposals, offering significant advancements in quantum cryptography and network applications that require reliable, narrow-band single photons.

Exploring DNA Computers: Advances in Storage, Cryptography and Logic Circuits.

Over the last four decades, research on DNA as a functional material has primarily focused on its predictable conformation and programmable interaction. However, its low energy consumption, high responsiveness and sensitivity also make it ideal for designing specific signaling pathways, and enabling the development of molecular computers. This review mainly discusses recent advancements in the utilization of DNA nanotechnology for molecular computer, encompassing applications in storage, cryptography and logic circuits. It elucidates the challenges encountered in the application process and presents solutions exemplified by representative works. Lastly, it delineates the challenges and opportunities within this filed.

A novel Chua's based 2-D chaotic system and its performance analysis in cryptography.

In this study, the chaotic behavior of a second-order circuit comprising a nonlinear resistor and Chua's diode is investigated. This circuit, which includes a nonlinear capacitor and resistor among its components, is considered one of the simplest nonautonomous circuits. The research explores various oscillator characteristics, emphasizing their chaotic properties through bifurcations, Lyapunov exponents, periodicity, local Lyapunov region, and resonance. The system exhibits both stable equilibrium points and a chaotic attractor. Additionally, the second objective of this study is to develop a novel cryptographic technique by incorporating the designed circuit into the S-box method. The evaluation results suggest that this approach is suitable for secure cryptographic applications, providing insights into constructing a cryptosystem for images and text based on its complex behavior. Real-life data were analyzed using various statistical and performance criteria after applying the proposed methodology. These findings enhance the reliability of the cryptosystems. Moreover, The proposed methods are assessed using a range of statistical and performance metrics after testing the text and images. The cryptographic results are compared with existing techniques, reinforcing both the developed cryptosystem and the performance analysis of the chaotic circuit.

Laser-engraved holograms as entropy source for random number generators

Our study introduces a novel approach to true random number generation (TRNG) using speckle patterns generated by laser-engraved holograms on carbon fiber-reinforced polymer (CFRP) composite substrates. Unlike previous methods, our approach simplifies the process by generating the necessary image dataset from a single microscope image of the engraved hologram. We achieve a high extraction ratio of 76 %, demonstrating the effectiveness of our TRNG. Moreover, our method successfully passes rigorous statistical tests proposed by the National Institute of Standards and Technology (NIST), indicating its suitability for cryptographic and secure system applications. This work offers promising implications for enhancing security in various domains, from secure communication networks to IoT devices.

A Comprehensive Review on Cryptographic Techniques for Securing Internet of Medical Things: A State-of-the-Art, Applications, Security Attacks, Mitigation Measures, and Future Research Direction

As healthcare becomes increasingly dependent on the Internet of Medical Things (IoMT) infrastructure, it is essential to establish a secure system that guarantees the confidentiality and privacy of patient data. This system must also facilitate the secure sharing of healthcare information with other parties within the healthcare ecosystem. However, this increased connectivity also introduces cybersecurity attacks and vulnerabilities. This comprehensive review explores the state-of-the-art in the IoMT, security requirements in the IoMT, cryptographic techniques in the IoMT, application of cryptographic techniques in securing the IoMT, security attacks on cryptographic techniques, mitigation strategies, and future research directions. The study adopts a comprehensive review approach, synthesizing findings from peer-reviewed journals, conference proceedings, book chapters, Books, and websites published between 2020 and 2024 to assess their relevance to cryptographic applications in IoMT systems. Despite advancements, cryptographic algorithms in IoMT remain susceptible to security attacks, such as man-in-the-middle attacks, replay attacks, ransomware attacks, cryptanalysis attacks, key management attacks, chosen plaintext/chosen ciphertext attacks, and side-channel attacks. While techniques like homomorphic encryption enhance security, their high computational and power demands pose challenges for resource-constrained IoMT devices. The rise of quantum computing threatens the efficacy of current cryptographic protocols, highlighting the need for research into quantum-resistant cryptography. The review identifies critical gaps in existing cryptographic research and emphasizes future directions, including lightweight cryptography, quantum-resistant methods, and artificial intelligence-driven security mechanisms. These innovations are vital for meeting the growing security requirements of IoMT systems and protecting against increasingly sophisticated threats.

Enhancing the SRAM PUF with an XOR Gate

This study focuses on designing enhanced Physically Unclonable Functions (PUFs) based on SRAM devices and improving the security of cryptographic systems. Most SRAM PUFs are limited in their number of CRPs, which makes them vulnerable to enrollment attacks. In this research, we present an SRAM-based PUF design that greatly increases the number of CRPs and the entropy of the generated bits by performing exclusive-or (XOR) on the responses of two SRAM devices. This was implemented using a readily available development board, SRAM devices, and a user-friendly custom circuit board for cryptographic key generation. The cryptographic protocol was implemented using both C++ and python3. The proposed SRAM PUF design was experimentally demonstrated and showed substantial improvements in the security of various cryptographic applications as a hardware authentication device. It also addresses the specific vulnerabilities of legacy designs.

Tunable Liquid Crystal Twisted‐Planar Fresnel Lens for Vortex Topology Determination

AbstractThe development of straightforward and effective methods to determine the topological charge of phase singular beams is crucial for broadening the applications of optical vortices. Here, a straightforward and elegant method for determining the topological charge of an optical vortex using an innovative switchable achromatic nematic liquid crystal Fresnel lens is proposed. The approach allows for the unambiguous determination of both the absolute value and the sign of the topological charge of a singular beam across a wide range of the visible spectrum, as demonstrated both experimentally and theoretically. The research outcomes are promising for applications in optical information transmission systems, cryptography, and quantum computing.

Mem‐Transistor‐Based Gaussian Error–Generating Hardware for Post‐Quantum Cryptography Applications

AbstractQuantum computing can potentially hack the information encrypted by traditional cryptographic systems, leading to the development of post‐quantum cryptography (PQC) to counteract this threat. The key principle behind PQC is the “learning with errors” problem, where intentional errors make encrypted information unpredictable. Intentional errors refer to Gaussian distributed data. However, implementing Gaussian distributed errors is challenging owing to computational and memory overhead. Therefore, this study proposes a Gaussian error sampler that employs the intrinsic Gaussian properties of nanometer‐scale semiconductor devices. The proposed Gaussian error sampler significantly reduces computational and memory overhead. This work comprehensively evaluates the effectiveness of the proposed device by conducting statistical normality tests and generating quantile–quantile plots. The optimal programming voltage is identified to be −5.25 V, and the experimental results confirmed the Gaussian distribution of error data generated by the proposed module, aligning closely with software‐generated Gaussian distributions and distinct from uniform random distributions.

Satellite dish-like nanocomposite as a breakthrough in single photon detection for highly developed optoelectronic applications

A nanocomposite with a unique satellite dish-like structure, termed arsenic (III) oxide iodide (AsO2I)/polypyrrole (Ppy) intercalated with iodide ions (AsO2I/Ppy-I), has been meticulously developed via a two-step process. It features natural satellite dish-like nanostructures, potentially serving as nanoresonators for efficient single photon absorption. With a bandgap of 2.8 eV, the AsO2I/Ppy-I nanocomposite efficiently absorbs photons in the UV and visible light regions, making it suitable for single photon detection. Impressive performance is seen in photocurrent sensitivity measurements, recording values of 0.017 mA.cm−2 under white light and 0.009 mA.cm−2 under monochromatic light at 340 nm. Additionally, it exhibits high responsivity and detectivity, with peak values at wavelengths of 340 nm and 440 nm associated with the diameter of the Satellite dish nanostructure. Cost-effectiveness and simple synthesis methods make it attractive for industrial applications, while its unique structural characteristics and enhanced optical properties position it as a valuable asset in optoelectronic technologies. It holds promise as a leading material in advanced quantum technology, marking a significant leap forward in optoelectronic technologies, with potential applications in quantum cryptography, communication, and computing.