A Case-Based Evaluation of Quantum-Resistant Data Indexing Techniques for Blockchain Databases ​

Introduction. Widespread use of unmanned aerial vehicles in the civilian and military spheres requires the development of new algorithms for identification friend or foe of targets, as used in the Armed Forces of Ukraine (AFU) devices of the "Parol" system are designed to service approximately 110 objects military equipment. AFU automation systems allow the use of additional sources of information about various objects from civil or special data transmission networks, which can be the basis for building a networked multi-level system of state recognition. Predictions of the development of quantum computers foresee the possibility of breaking modern algorithms for information security in polynomial time in the next 5-10 years, which requires the development and implementation of new encryption algorithms and revision of modern parameters. The purpose of the article is to develop a new algorithm for state recognition of objects, which can be scaled to process the required number of manned and unmanned aerial vehicles. Potential threats to classical cryptographic protection algorithms for data networks, which will result in the execution of algorithms such as Grover and Shore on quantum computers, were also discussed. Results. The article proposes a new multilevel algorithm of state recognition based on modern cryptographic methods of information protection, which allows to perform reliable automated identification of objects, scale systems using data on potential targets from other sources through secure special networks. Grover's search algorithm does not give a strong increase in key search performance for symmetric encryption algorithms, so there is no need to increase the key lengths for this type of information security algorithms. Post-quantum asymmetric encryption algorithms require additional study and comprehensive testing of information security or increasing the key lengths of cryptographic algorithms, which corresponds to the number of qubits, i.e. more than twice. The most promising is the family of asymmetric post-quantum cryptographic algorithms based on supersingular isogenic elliptic curves. Conclusions. The developed algorithm of identification friend or foe of objects is more secure compared to existing algorithms and is focused on the use of modern on-board computers and programmable radio modems. Shore's algorithm and the like will be a significant threat to modern asymmetric cryptography algorithms when the number of qubits of quantum computers exceeds the number of bits in public keys more than twice. Keywords: identification friend or foe, symmetric encryption, asymmetric cryptography, quantum computer, post-quantum cryptography.

Modern cryptography pushed forward the need of having provable security. Whereas ancient cryptography was only relying on heuristic assumptions and the secrecy of the designs, nowadays researchers try to make the security of schemes to rely on mathematical problems which are believed hard to solve. When doing these proofs, the capabilities of potential adversaries are modeled formally. For instance, the black-box model assumes that an adversary does not learn anything from the inner-state of a construction. While this assumption makes sense in some practical scenarios, it was shown that one can sometimes learn some information by other means, e.g., by timing how long the computation take. In this thesis, we focus on two different areas of cryptography. In both parts, we take first a theoretical point of view to obtain a result. We try then to adapt our results so that they are easily usable for implementers and for researchers working in practical cryptography. In the first part of this thesis, we take a look at post-quantum cryptography, i.e., at cryptographic primitives that are believed secure even in the case (reasonably big) quantum computers are built. We introduce HELEN, a new public-key cryptosystem based on the hardness of the learning from parity with noise problem (LPN). To make our results more concrete, we suggest some practical instances which make the system easily implementable. As stated above, the design of cryptographic primitives usually relies on some well-studied hard problems. However, to suggest concrete parameters for these primitives, one needs to know the precise complexity of algorithms solving the underlying hard problem. In this thesis, we focus on two recent hard-problems that became very popular in post-quantum cryptography: the learning with error (LWE) and the learning with rounding problem (LWR). We introduce a new algorithm that solves both problems and provide a careful complexity analysis so that these problems can be used to construct practical cryptographic primitives. In the second part, we look at leakage-resilient cryptography which studies adversaries able to get some side-channel information from a cryptographic primitive. In the past, two main disjoint models were considered. The first one, the threshold probing model, assumes that the adversary can put a limited number of probes in a circuit. He then learns all the values going through these probes. This model was used mostly by theoreticians as it allows very elegant and convenient proofs. The second model, the noisy-leakage model, assumes that every component of the circuit leaks but that the observed signal is noisy. Typically, some Gaussian noise is added to it. According to experiments, this model depicts closely the real behaviour of circuits. Hence, this model is cherished by the practical cryptographic community. In this thesis, we show that making a proof in the first model implies a proof in the second model which unifies the two models and reconciles both communities. We then look at this result with a more practical point-of-view. We show how it can help in the process of evaluating the security of a chip based solely on the more standard mutual information metric.

Post-quantum cryptography is an emerging solution to the expected security breach, introduced by quantum computers, to the currently used public key cryptosystems. This paper presents an experimental study on the effect of the overhead associated with the wireless transmission of some of the newly developed post quantum cryptography algorithms through the Internet of Things networks. Experimental results of this work include the energy and time measurements for wireless transmission of chosen sample messages of these new cryptographic algorithms. In addition, recommendations are given for appropriate modules configurations and choice of suitable security algorithm for the Internet of Things networks.

This research evaluated the practicality of implementing Post-Quantum Cryptography (PQC) algorithms onboard resource-constrained computing devices. While PQC is computationally efficient, key sizes, memory usage, and bandwidth constraints are of concern in an embedded environment. The Controller Area Network (CAN) protocol serves as an example of limited communication in an arbitrary embedded environment. It utilizes only eight (8) bytes of data payload per message, requiring the large keys of PQC algorithms to be split into several messages. Improvements upon the CAN protocol exist to increase throughput, although the unmodified version remains in use. This research is likely to be more restricted than future development. Comparison was made between PQC and current standard algorithms to evaluate computational cost. Ultimately, this research determined that PQC algorithms such as CRYSTALS-Kyber [1], CRYSTALS-Dilithium [2], and Falcon [3] are presently viable in low capacity networks.

A roadmap from classical cryptography to post-quantum resistant cryptography for 5G-enabled IoT: Challenges, opportunities and solutions

In the modern world, the financial sector faces a wide range of extraordinary events, from market shocks and geopolitical tensions to pandemics and cyberattacks. These diverse challenges significantly impact banks. Recently, particular attention has been drawn to the influence of artificial intelligence (AI) and quantum computing (QC) technologies on the stability of the financial system. This article analyzes the potential areas of impact of quantum technologies on the financial sphere in general and the resilience of financial institutions in particular.It's determined that quantum technologies can simultaneously pose both threats and new opportunities. Specifically, the article analyzes the potential of quantum technologies to break existing cryptographic algorithms that protect the confidential data of financial institutions' clients. This threat is exacerbated by the possibility of "harvest now, decrypt later" attacks, where malicious actors intercept data today with the intention of decrypting it in the future. This presents challenges and threats for online/mobile banking, payment operations, and corporate communications. Among the positive impacts of quantum technologies on banking, the article highlights improved financial risk assessment, particularly enhanced accuracy in stress testing, portfolio management, and derivatives pricing, by solving problems inaccessible to classical computing. The potential of quantum machine learning for fraud detection is also noted. Attention is given to the financial sector's response to these challenges. Initiatives for developing quantum-resistant (post-quantum) cryptography are considered as the primary method for mitigating the risks associated with the proliferation of quantum computing, along with new cryptographic protocols and quantum key distribution as a new opportunity to enhance security. The article emphasizes the responsibility of central banks in forming quantum-readiness strategies, including investments in post-quantum cryptography, expertise development, and the adaptation of regulatory frameworks. The conclusion drawn is that although the immediate benefits of quantum technologies may be modest, their long-term transformative potential for the financial sector is immense.

Quantum computing furnishes exponential speed up over classical computing in specific areas. For example, Shor’s algorithm can factor two numbers in a polynomial time complexity. Thus, many encryption algorithms that rely on large number factorization are potentially vulnerable to quantum computers. In order to address this, the National Institute of Standard and Test (NIST) has organized a competition to evaluate several post quantum cryptography (PQC) algorithms, that are secure from the attacks from quantum computers. Several of these lattice-based PQC encryption algorithms are based on Learning With Errors (LWE) computation. Conversely, LWE is the heaviest computation in a classical computer, which incurs significant portion of the latency overhead for the entire encryption algorithm. In this paper, we design an optimized quantum circuit for LWE computation. The proposed quantum circuit does not need any ancillary qubits and scales efficiently and easily if there are more qubits available on a higher qubit quantum computer.

The appearance of quantum computing in the short foreseeable future and its capability to break conventional cryptographic algorithms forces to change the paradigm of secure real‐time communications. Thus, government organizations, data centers, and enterprises among others are migrating their public key infrastructure towards using post‐quantum cryptography (PQC) algorithms in order to mitigate the security threats posed by quantum computers. This letter presents the first quantum resilient secure end‐to‐end communication link based on PQC algorithms operating between two data‐processing units DPU. Both data‐processing units employ on‐board ARM processors to perform the computationally expensive cryptographic building blocks—in that case CRYSTALS‐Kyber as a key encapsulation mechanism and CRYSTALS‐Dilithium for digital signature scheme in combination with advanced encryption standard with 256‐bit key.

Cryptographic algorithms are crucial for secure communication in the Internet of Things (IoT). Quantum computers threaten public key cryptography algorithms like RSA (Rivest, Shamir, Adleman) and Diffie-Hellman (DH) key exchange schemes, which are widely in use today. As cryptographic algorithms are the foundation of secure internet communication, the development of Quantum Key Distribution (QKD) and Post-Quantum Cryptography (PQC) is essential to protect transactions over the internet. However, solutions like Quantum Key Distribution require heavy infrastructure. So, it is not feasible for the Internet of Things with fewer resources in computing power and form factor. Post-Quantum Cryptography is helpful on these devices. But, it needs further developments and improvements. This paper analyzes cryptography algorithms and protocols of IoT with different categories. Integrated PQC of National Institute of Standards and Technology (NIST) third level finalists on Raspberry Pi 4 (RPI4) board with Linux operating system. The performance of Post-Quantum Cryptography schemes for IoT has been evaluated. Finally, a Post-Quantum Cryptography scheme has been suggested for the Internet of Things based on the performance analysis.

This article mainly discusses the history of progress regarding the legislation and updates through scrutiny, its current architecture, and its standards applied around the world, such as eIDAS and eIDAS 2.0, which are used not only as technical but also as purely political standards. The penetration of the digital economy has largely promoted the evolution of cyber platforms for public and private use, so that e-signatures have become one of the pillars in the national IT architecture. 1) Legislation The e-signature operations in Türkiye are regulated by Electronic Signature Law No. 5070 and its secondary regulations. However, today, the infrastructure groundwork relies heavily on RSA-based cryptography. RSA is attracting greater and more debate these days, with concerns about whether it will continue to be useful given the increasing importance of security requirements for mobile devices, performance expectations, and the threat posed by quantum computing. This article also examines the extent to which Turkish law is compatible with the EU regulation of compliance. In this paper, we study whether the Turkish legislation complies with the European legislation. This covers security, performance, key size, and support for RSA and Elliptic Curve Cryptography (ECC) algorithms. This paper discusses technical, institutional, and legal requirements for the transition of the national e-signature infrastructure to ECC. Furthermore, ECC’s contribution is evaluated in terms of Post-Quantum Cryptography (PQC), and a roadmap is suggested for transitioning to hybrid (ECC + PQC) architectures. Finally, policy and technical suggestions are proposed to facilitate international electronic and mobile signature interoperability under eIDAS 2.0.

The book provides a study of quantum computing effects on contemporary cryptographic systems. This research examines quantum threats and the requirement for post-quantum computations which lead to a study of developing post-quantum cryptographic methods while exploring fundamental quantum concepts that show the menace classical cryptography faces. RSA and elliptic curve cryptography (ECC) demonstrate weakpoints that create an immediate need for moving toward quantum-resistant system architectures . Quantum attacks generate important risks which demand organizations to implement secure cryptographic measures. The text gives insight into hash-based cryptographic algorithms parallel to lattice-based and code-based and isogeny-based algorithms. The book investigates quantum-resistant hash functions together with NIST’s post-quantum cryptography initiative and quantum-safe public key encryption and Quantum Key Distribution (QKD) and hybrid cryptographic methods. The book evaluates digital signatures as cybersecurity anchors through NIST’s post-quantum signature models and specific algorithms. The paper evaluates operational barriers that face post-quantum cryptography adoption through investigations about key migration together with a review of interoperability needs and explanations about protected key systems. The book explores emerging quantum computing technology through investigations about quantum-proof digital currencies along with QML security risks. The book analyzes ethical guidelines which prioritize security and privacy against worldwide accessibility and verify government participation in post-quantum cryptography implementation. This document presents both a planned path toward quantum-security readiness together with scheduling plans and scientific monitoring methodologies that protect networks from quantum age security hazards.

SummaryThe present scenario witnesses “the second quantum revolution,” which has enabled the development of revolutionary novel quantum tools. Quantum computing endeavors to establish higher computing standards that can potentially solve complex structures. Post‐quantum cryptography (PQC) has emerged as one of the new domains of cryptography, which is resilient to quantum attacks owing to the revolution in quantum computing. To ensure quantum security, the lattice‐based cryptosystem (LB‐cryptosystem) is one of the promising tools of PQC to address quantum‐based threats. The traditional security algorithms, such as RSA and Diffie–Hellman (DH), are strong enough to resist present security threats. However, it has been predicted that quantum technologies have the capability to break the security of most traditional algorithms whose security is based on prime factorization and DH‐type hard problems. Therefore, research is currently focused on addressing the security and privacy threats by using LB‐cryptosystems to secure various applications, organizations' data, and information infrastructure in the quantum era. The purpose of this article is to investigate recent advances in LB‐cryptosystems that may allow the design of secure models for smart‐grid networks (SGNs) against existing and future quantum attacks. SGNs have been explored as the bi‐directional assimilation of communication in terms of electricity generation, transmission, allocation, and utilization. This survey provides a comprehensive overview of LB‐cryptosystems, as well as their potential applications in securing SGNs. Lastly, the article summarizes the various PQC primitives, NIST selected algorithms, open‐source tools along with their packages, and various PQC industrial initiatives, and also compares traditional cryptographic schemes with other PQC.

The Internet of Things (IoT) now underpins critical systems like healthcare monitors, smart home, smart grids, automotive V2V & V2X networks, and industrial controls but it still relies on classical cryptography, whose security assumptions are vulnerable to quantum computers. A large quantum computer could run Shor’s algorithm to break RSA/ECC and use Grover’s algorithm to accelerate brute-forcing of symmetric keys, undermining the confidentiality and authentication of data in these IoT applications. Researchers have proposed quantum cryptographic solutions. Quantum key distribution (QKD) and quantum random number generators (QRNGs) exploit quantum mechanics to detect eavesdropping and deliver provably secure key material. For example, chip-scale QRNGs can be embedded in IoT sensors to generate true random keys, boosting resistance to brute-force attacks. These quantum techniques provide information-theoretic secrecy, for instance, QKD-generated keys have been used to authenticate smart-grid SCADA. However, most IoT devices are resource-constrained, making direct deployment of conventional QKD hardware challenging. Post-quantum cryptography (PQC) complements quantum methods by providing algorithms such as lattice-based, hash-based that resist quantum attacks on existing hardware. Standardized PQC can be deployed via software updates on legacy IoT nodes, enabling scalable and quantum-safe security within current constraints. Researchers are exploring lightweight PQC for connected cars and e-health sensors. Hybrid approaches combining QKD/QRNG with PQC offer a layered defense. Since QKD protocols are regarded as ‘future-proof’ and PQC standards mature, their combined use will be essential for robust, quantum-safe IoT security. Miniaturizing quantum components such as integrated QKD/QRNG modules and optimizing lightweight PQC schemes for low-power IoT devices are future research directions to secure IoT networks.

With quantum computing evolving very fast as we speak, the security and integrity of blockchain-based applications will become the most crucial aspect. A proposal is raised to use blockchain technology as a platform for writing and probating ‘wills’. Blockchain technology in drafting and probating wills makes them safe from manipulations, highly secure, and transparent. It also dramatically decreases the time required without catering for the challenges created by the current system. [9] This paper presents a new method for will transfer and inheritance management by implementing quantum-resistant algorithms in the security architecture of a blockchain decentralized application (DApp). The system uses IPFS Network for data storage and quantum-safe algorithms as retrieval and sending algorithms. The system includes Quantum-Resistant Dilithium Signatures and Merkle trees as the fundamental components for safeguarding the transfers of assets and claims for inheritance. Quantum-Resistant Dilithium Signatures offer an unbreakable shield against quantum attacks that are expected to happen, which in turn safeguards the privacy and authenticity of transactions. While Merkle trees are responsible for the organization of inheritance claims in an effective and tamper-proof manner, the introduced system incorporates smart contracts to address the execution of an inheritance case, adding more security and automation to the asset distribution process. The system ensures a robust security framework by integrating quantum-resistant algorithms at the very core of the blockchain DApp for instance, retrieval and sending. This research is of great significance to blockchain technology which is the emerging technology of the future because it addresses the existing threat of quantum computing by showing the feasibility of using quantum-resistant algorithms in practical applications. As established by the findings, besides Quantum-Resistant Dilithium Signatures and Merkle trees, the systems of asset transfers and inheritance management within blockchain networks are enhanced in terms of safety and reliability. Hence, paving the road to the creation of more secure and trustworthy digital asset management systems.

The exponential development in Quantum Computing is becoming a threat to the existing asymmetric cryptographic algorithms like RSA (Rivest, Shamir, Adleman). A threat to these public key cryptographic algorithms is a threat to the entire Internet itself, as algorithms like RSA are the basic building blocks of existing secure Internet communication. Thus, a new area of quantum cryptography emerged, that lead to the development of Post-Quantum Cryptography (PQC) algorithms and Quantum-safe Internet protocol Quantum Key Distribution (QKD). These systems, which are generally known as Quantum Cryptographic Systems, have many practical limitations that make them complex and expensive to be implemented or even experimented with, in a real-life scenario. Therefore, to develop new protocols and analyze the feasibility of the existing protocols in a cost-effective manner, we need efficient simulation frameworks. So, in this paper, we are profiling some of the recent Quantum Cryptographic based networks and Quantum Key Distribution (QKD) simulation frameworks and conducting a systematic and thorough analysis of the implementation and functionalities of these experimental platforms, with an aim to build a universal quantum testbed in the future.