Search

With the advent of internet-enabled and hybrid technologies, information is becoming increasingly accessible to the general public. Smartphones and other gadgets are used extensively by people to share and promote ideas, in a variety of ways. Human interaction and communication has become more reliable and effective through advanced computing technologies. Quantum computing is an emerging paradigm that will change the lives of individuals and the operations of organizations. Quantum computers solve problems at high speed by operating in a superposition state in which the state can be either zero or one at the same instant. Quantum sensors can be used efficiently in technological research to make accurate measurements and collect data that provide new insights into the behavior of nanomaterials. The use of quantum computing could also speed up the manufacturing process of devices with remarkable properties such as superconductivity, high strength or improved signal performance. Quantum computing has the ability to dramatically speed up the development process of various organizations and increase their efficiency and effectiveness. The security and reliability of data and communication is improved by quantum computing techniques such as key generation and entanglement dispersion. Companies use cryptographic algorithms to protect their data. However, with the advent of quantum computing, cryptographic methods that rely on numerical aspects are no longer sufficient to protect data. Quantum computing is an emerging field that is being applied to various problems that previously could not be solved using conventional methods. Quantum computing plays an important role in the field of information processing, where information is precisely analyzed. Various quantum technologies and algorithms are used to secure company data. This paper provides a systematic review of the literature on the principles of quantum computing. The SLR focuses on achieving four aims "identifying a variety of quantum IoT devices, analyzing their importance in different industries, highlighting the challenges of quantum technology, and presenting various techniques used by researchers to overcome different problems". Quantum cryptography is identified as a key strategy for improving the security of IoT systems and ensuring the security and consistency of information. [ABSTRACT FROM AUTHOR]

Digital signatures are one of the key cryptographic components for providing authenticity and non-repudiation. To circumvent the need of certificates, Shamir in 1984 introduced identity-based signature (IBS). Nearly all of the existing state-of-the-art IBS schemes are relying on the number-theoretic hardness assumptions. Unfortunately, these hard problems are insecure and face a threat in quantum world. Thus, it is high time to design and analyze IBS algorithms that can resist quantum attacks and provide long-term security. Quantum cryptography is one such technique to provide quantum-safe IBS. In this paper, we cryptanalyze the quantum cryptography-based IBS of Huang et al. (Huang et al. in Quantum Inf Process 22(1):36, 2022). We show that the design in (Huang et al. in Quantum Inf Process 22(1):36, 2022) is not secure against public key generator forgery attack, collusion attacks, and intercept and resend attacks. Next, we modify the design of (Huang et al. in Quantum Inf Process 22(1):36, 2022) and propose a new quantum IBS (namely qIBS) which is secure against the aforementioned attacks. [ABSTRACT FROM AUTHOR]

With the rapid development of quantum computing technology, the traditional cryptosystem will face a significant threat. It is an urgent security issue to study the security impact of quantum computing on classical cryptosystems and provide reliable cryptographic primitives for the post-quantum era. A powerful way to solve this problem is to quantize the classical cryptanalysis tools and use the improved versions for cryptanalysis. In this paper, we propose a quantum Zero-correlation analysis algorithm based on the Bernstein–Vazirani and Grover algorithms. It can find zero-correlation linear hulls for Feistel and SPN structures. We prove the correctness of the algorithm and analyze its complexity. Compared with the classical algorithms, the proposed quantum algorithm has significant advantages when the number of encryption rounds of block ciphers is large. Moreover, compared with the existing quantum Zero-correlation linear analysis, the proposed algorithm is more efficient and does not depend on the algebraic characteristics of the target cipher, which makes the algorithm has more flexible application scenarios. With the development of quantum computers, we discuss the threat of quantum cryptanalysis algorithms to classical security. [ABSTRACT FROM AUTHOR]

This paper introduced a novel semiring structure involving nonnegative integers, where operations depended on the comparison of the magnitudes of decimal digit sums. Consequently, a corresponding matrix semiring can be established on this commutative semiring. We showed that the 3-satisfiability problem can be polynomial-time reduced to solving systems of quadratic polynomial equations over this semiring. We proposed a key exchange protocol based on this matrix semiring, with its security relying on the two-sided digital circulant matrix action problem over this semiring. This scheme provides a novel cryptographic primitive for post-quantum cryptography. [ABSTRACT FROM AUTHOR]

In the last couple of decades, Attribute-Based Encryption (ABE) has been a promising encryption technique to realize fine-grained access control over encrypted data. ABE has appealing functionalities such as (i) access control through encryption and (ii) encrypting a message to a group of recipients without knowing their actual identities. However, the existing state-of-the-art ABEs are based on number-theoretic hardness assumptions. These designs are not secure against attacks by quantum algorithms such as Shor algorithm. Moreover, existing Post-Quantum Cryptography (PQC)-based ABEs fail to provide long-term security. Therefore, there is a need for quantum secure ABE that can withstand quantum attacks and provides long-term security. In this work, for the first time, we introduce the notion of a quantum-secure ABE (qABE) framework that preserves the classical ABE's functionalities and resists quantum attacks. Next, we provide a generic construction of qABE which is able to transform any existing ABE into qABE scheme. Thereafter, we illustrate a concrete construction of a quantum ABE based on our generic transformation qABE and the Waters' ciphertext-policy ABE scheme. [ABSTRACT FROM AUTHOR]

Hermite–Korkin–Zolotarev (HKZ) reduction is an important notion of lattice reduction which plays a significant role in number theory (particularly the geometry of numbers), and more recently in coding theory and post-quantum cryptography. In this work, we determine a sharp upper bound on the orthogonality defect of HKZ reduced bases up to dimension 3. Using this result, we determine a general upper bound for the orthogonality defect of HKZ reduced bases of arbitrary rank. This upper bound is sharper than existing bounds in literature, such as the one determined by Lagarias, Lenstra and Schnorr [3]. [ABSTRACT FROM AUTHOR]

Isogeny-based cryptography holds significant promise in the realm of post-quantum cryptography, primarily due to its perceived resilience against attacks from quantum computers, based on our current understanding of the underlying mathematical problems. However, it's essential to acknowledge the dynamic nature of post-quantum cryptography, where ongoing research may yield profound insights or lead to the development of novel cryptographic approaches. This study delves into the analysis of Hessian form curves within the framework of isogeny-based cryptography (IBC). We specifically investigate the computational costs associated with deriving Hessian form curves for constructing sections, particularly when employing compression functions. The square-root Velu method is utilized for handling Hessian form curves, and we introduce a novel formula for calculating the curve's coefficient at a specific point on a Hessian curve. Our results indicate that the operational costs of the Hessian form and the Montgomery curve are comparable. Furthermore, we propose the Hessian-Edwards hybrid model, optimizing Hessian-CSIDH and determining the coefficient for the codomain's curve using Edwards curves. According to our findings, various Isogeny-based cryptosystems can be implemented by leveraging Hessian curves. [ABSTRACT FROM AUTHOR]

The multipartite nonlocality provides deep insights into the fundamental feature of quantum mechanics and guarantees different degrees of cryptography security for potential applications in the quantum internet. Verifying multipartite nonlocal correlations is a difficult task. A unified approach is proposed that encompasses all the quantum characteristics of the multipartite correlated system beyond from fully separable to biseparable no‐signaling correlations. A straightforward method is offered to verify general systems by lifting partial nonlocal correlations. This allows to construct a chained Bell inequality, facilitating the unified verification of hierarchic multipartite nonlocalities. The lifting method is finally applied to verify the correlations derived from quantum networks. [ABSTRACT FROM AUTHOR]

This research aims to establish a secure system for key exchange by using post-quantum cryptography (PQC) schemes in the classic channel of quantum key distribution (QKD). Modern cryptography faces significant threats from quantum computers, which can solve classical problems rapidly. PQC schemes address critical security challenges in QKD, particularly in authentication and encryption, to ensure the reliable communication across quantum and classical channels. The other objective of this study is to balance security and communication speed among various PQC algorithms in different security levels, specifically CRYSTALS-Kyber, CRYSTALS-Dilithium, and Falcon, which are finalists in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography Standardization project. The quantum channel of QKD is simulated with Qiskit, which is a comprehensive and well-supported tool in the field of quantum computing. By providing a detailed analysis of the performance of these three algorithms with Rivest–Shamir–Adleman (RSA), the results will guide companies and organizations in selecting an optimal combination for their QKD systems to achieve a reliable balance between efficiency and security. Our findings demonstrate that the implemented PQC schemes effectively address security challenges posed by quantum computers, while keeping the the performance similar to RSA. [ABSTRACT FROM AUTHOR]

In the face of advancing quantum computing capabilities posing significant threats to current cryptographic protocols, the need for post-quantum cryptography has become increasingly urgent. This paper presents a comprehensive analysis of the performance of various post-quantum cryptographic algorithms specifically applied to digital signatures. It focuses on the implementation and performance analysis of selected algorithms, including CRYSTALS-Dilithium, Falcon, and SPHINCS+, using the liboqs library. Performance tests reveal insights into key pair generation, file signing, and signature verification processes. Comparative tests with the well-known and popular RSA algorithm highlight the trade-offs between security and time efficiency. The results can help to select secure and efficient ciphers for specific 5G/6G services. [ABSTRACT FROM AUTHOR]

Advances in quantum computers may pose a significant threat to existing public-key encryption methods, which are crucial to the current infrastructure of cyber security. Both RSA and ECDSA, the two most widely used security algorithms today, may be (in principle) solved by the Shor algorithm in polynomial time due to its ability to efficiently solve the discrete logarithm problem, potentially making present infrastructures insecure against a quantum attack. The National Institute of Standards and Technology (NIST) reacted with the post-quantum cryptography (PQC) standardization process to develop and optimize a series of post-quantum algorithms (PQAs) based on difficult mathematical problems that are not susceptible to being solved by Shor's algorithm. Whilst high-powered computers can run these PQAs efficiently, further work is needed to investigate and benchmark the performance of these algorithms on lower-powered (constrained) devices and the ease with which they may be integrated into existing protocols such as TLS. This paper provides quantitative benchmark and handshake performance data for the most recently selected PQAs from NIST, tested on a Raspberry Pi 4 device to simulate today's IoT (Internet of Things) devices, and provides quantitative comparisons with previous benchmarking data on a range of constrained systems. CRYSTALS-Kyber and CRYSTALS-Dilithium are shown to be the most efficient PQAs in the key encapsulation and signature algorithms, respectively, with Falcon providing the optimal TLS handshake size. [ABSTRACT FROM AUTHOR]

Quantum computing has made many important achievements in the field of cryptanalysis. However, due to the limitations of current physical system and technology, the realization of large-scale universal quantum computers is a long way off. Currently, small-scale quantum computers are easier to implement than large-scale universal quantum computers. Distributed quantum computing proposes an implementation architecture, which attempts to break down large-scale tasks into many sub-tasks distributed across multiple small-scale quantum computers. How to use small-scale quantum computers with fewer qubits and shallower quantum depths to complete large-scale tasks and improve the success rate of attacking symmetric cryptosystems is our concern. In this paper, we propose a distributed exact Simon's algorithm, apply it to achieve quantum key recovery attacks on single-permutation-based pseudorandom cryptographic schemes with classical birthday bound security, and estimate the quantum resources of quantum circuits. Furthermore, we combine distributed exact Grover's algorithm and distributed exact Simon's algorithm to achieve quantum key recovery attacks on two-permutation-based pseudorandom cryptographic schemes with classical beyond birthday bound security and estimate the corresponding quantum resources. Our results show that (1) our algorithms are exact which means that the theoretical success probability of attacking pseudorandom cryptographic schemes is 100%; (2) the depth of circuit is in polynomial time which means that the theoretical depth of attacking symmetric cryptosystems is exponentially accelerated relative to the previous results; (3) the qubits of circuit don't increase significantly. Our work is of great importance. It could lead to the rapid realization of effective quantum attacks against symmetric cryptosystems on small-scale quantum computers. [ABSTRACT FROM AUTHOR]

The emergence of a new era of quantum computing is on the horizon, presenting modern cryptography with a cluster of unprecedented threats. This review delves into the cryptographic techniques that risk being challenged in a postquantum environment and the algorithms that challenge these techniques. We first investigate aspects of traditional cryptography, covering both asymmetric and symmetric cryptography. Then, we analyze quantum computing and its impact on cryptographic techniques, notably Shor's and Grover's algorithms. Finally, we will research quantum-resistant solutions and explore our current status in post-quantum cryptography. This review aims to provide a comprehensive understanding of the threats posed by quantum computing from a cryptographic standpoint and the approaches available to mitigate these risks for a more secure future. [ABSTRACT FROM AUTHOR]

In the quest for robust and efficient digital communication, this paper introduces cutting-edge key exchange protocols leveraging the computational prowess of tropical semirings and the structural resilience of block matrices. Moving away from the conventional use of finite fields, these protocols deliver markedly faster processing speeds and heightened security. We present two implementations of our concept, each utilizing a different platform for the set of commuting matrices: one employing tropical polynomials of matrices and the other employing Linde–de la Puente matrices. The inherent simplicity of tropical semirings leads to a decrease in operational complexity, while using block matrices enhances our protocols' security profile. The security of these protocols relies on the Matrix Decomposition Problem. In addition, we provide a comparative analysis of our protocols against existing matrix block-based protocols in finite fields. This research marks a significant shift in cryptographic protocol design, is specifically tailored for demanding engineering applications, and sets a new standard in secure and efficient digital communication. [ABSTRACT FROM AUTHOR]

The foundation of this research is the quantum implementation of two hashing algorithms, namely Secure Hash Algorithm (SHA1) and Message Digest (MD5). Quantum cryptography is a challenging topic in network security for future networks. Quantum cryptography is an outgrowth of two broad topics—cryptology and cryptanalysis. In this paper, SHA1 and MD5 algorithms are designed and implemented for quantum computers. The main aim is to study and investigate the time requirement to build a hash and the bit rate at which a hash value is sent through. In this paper, a comprehensive analysis of these two algorithms is performed. Experiments have been done to compare and contrast the performances of the classical and proposed algorithms. In the experiment, it was found that the total time of execution of quantum SHA1 and quantum MD5 is much higher than the classical SHA1 and MD5. During quantum MD5 execution, it is observed that the time doubles when the number of chunks is increased from 1 to 2. Another experimental observation is that the execution time of the implemented algorithms depends upon the processor's speed. [ABSTRACT FROM AUTHOR]

This paper presents the quantum-inspired substitution box (QIS-Box) algorithm, a novel approach aimed at enhancing the security of cryptographic S-boxes by leveraging quantum-inspired techniques. The QIS-Box algorithm significantly improves key cryptographic metrics, increasing nonlinearity from 102-110 and reducing differential uniformity from 6-4. Nonlinearity, which measures an S-Box's resistance to linear cryptanalysis, is enhanced to provide stronger protection, whereas differential uniformity, which assesses resilience to differential cryptanalysis, is improved to offer greater defence. These advancements highlight the robust security capabilities of the QIS-Box algorithm against prevalent cryptanalytic attacks. Furthermore, the algorithm demonstrates notable efficiency, making it well suited for implementation in resource-constrained environments such as IoT devices. This research contributes substantially to the development of quantum-resistant cryptographic solutions, addressing the challenges posed by emerging quantum computing technologies. Future research will focus on refining the simulation of quantum events within classical computational frameworks and integrating the QIS-Box Algorithm with other cryptographic techniques to further increase security and efficiency. This study paves the way for the development of advanced cryptographic systems capable of withstanding the evolving landscape of digital threats. [ABSTRACT FROM AUTHOR]

Abstract A significant amount of study is being done to review the security promises made for the various ciphers now in use as a result of the development of quantum computing technology. A general attack against symmetric key cryptography primitives that can reduce search costs to the square root is Grover's search algorithm. To implement Grover's algorithm, it is necessary that the target cipher be implemented as a quantum circuit. Despite being relatively new, this area of study has received significant attention from the research community. The authors have estimated the cost of Grover's key search attack against the stream cipher Atom, for the first time, under circuit depth restrictions defined in National Institute of Standards and Technology (NIST) PQC standardisation process. The authors implement the quantum circuit of Atom in QISKIT, (open‐source software development kit for working with quantum computers running on IBM Quantum Experience). The results are also compared with other existing literature on LFSR‐based stream ciphers, such as Grain‐v1, Grain‐128‐AEAD, and Lizard. The authors also find that, to the best of their knowledge, in the existing literature on estimating the cost of Grover's attack on symmetric ciphers, Atom is the only 128‐bit key cipher that meets the threshold of ≈2170 set by NIST for quantum security of 128‐bit key ciphers. The authors also analyse the security of Atom against quantum TMDTO attacks.

Quantum key distribution (QKD) and post‐quantum cryptography (PQC) are the two counter measures against cryptographic attacks via quantum computing. While QKD offers information theoretic security but limited authentication scalability, PQC facilitates scalable authentication in high density networks but is not information theoretic secure. Therefore, an ideal quantum‐safe framework should efficiently leverage the complementarity of both techniques. However, despite growing efforts in integrating both, current realizations have focused on channel authentication, and a complete cryptosystem addressing both hybrid authentication and hybrid key exchange is yet to be demonstrated. Here, an authenticated hybrid key exchange protocol is introduced that incorporates PQC and QKD in a modular and information‐theoretic secure architecture. The quantum‐safe protocol is inherently resilient to catastrophic cryptographic failures and provides both forward and post‐compromise security. As proof‐of‐concept implementation, the cryptosystem on a QKD hardware prototype is integrated, with the QKD processing, PQC key exchange and secret state masking via physical unclonable functions (PUFs) all running on a single field programmable gate array (FPGA). This work paves the way for the deployment of versatile and modular quantum‐safe networks that exploit the complementarity of PQC and QKD. [ABSTRACT FROM AUTHOR]

Lattice-based digital signature has become one of the widely recognized post-quantum algorithms because of its simple algebraic operation, rich mathematical foundation and worst-case security, and also an important tool for constructing cryptography. This survey explores lattice-based digital signatures, a promising post-quantum resistant alternative to traditional schemes relying on factoring or discrete logarithm problems, which face increasing risks from quantum computing. The study covers conventional paradigms like Hash-and-Sign and Fiat-Shamir, as well as specialized applications including group, ring, blind, and proxy signatures. It analyzes the versatility and security strengths of lattice-based schemes, providing practical insights. Each chapter summarizes advancements in schemes, identifying emerging trends. We also pinpoint future directions to deploy lattice-based digital signatures including quantum cryptography. [ABSTRACT FROM AUTHOR]

Electronic voting, based on cryptographic protocols and blockchain technology, represents an advanced method for ensuring the security, transparency, and reliability of electoral processes. The scientific research presented in this article is devoted to the analysis of trends and advanced technologies in the field of electronic voting. The authors propose a systematic mapping of this area using bibliometric analysis. The research is based on the analysis of scientific articles extracted from the Web of Science and Scopus databases. Bibliometric analysis tools are used to automatically identify key topics and trends in the literature. The results of the study reveal the key directions of the development of electronic voting, including the integration of cryptographic protocols and blockchain technology. Specific aspects include improving privacy through the use of modern cryptographic protocols, creating an immutable register of votes using blockchain technology, ensuring trust through open-source code, and increasing resilience to cyber-attacks. These areas reflect the desire to develop efficient, transparent, and secure electronic voting systems. Based on the identified trends, recommendations are proposed for further research aimed at improving electronic electoral systems and their adaptation to the modern requirements of security and transparency in electoral processes. [ABSTRACT FROM AUTHOR]

In the paper (EPJ Quant. Technol. 10:29, 2023), Kuo et al. proposed a multiparty quantum secret sharing protocol based on a novel structure and single qubits. Owing to the absence of an entanglement state, the proposed protocol is more practical than other quantum secret sharing protocols which use entanglement properties. Therefore, we study the security of the proposed protocol and find there exists a security loophole in the n-party (n ≥ 4 ) secret sharing case in it, that is, two dishonest agents can collude to obtain (part of) Alice's secret without the help of the other agents. In order to overcome the security loophole, we give an improved protocol and make a security analysis for it. By calculating, the qubit efficiency of the three-party case in it is equal to 1 8 , which is higher than that in Hillery et al.'s protocol (Phys. Rev. A 59:1829, 1999). [ABSTRACT FROM AUTHOR]

Private set intersection cardinality (PSI-CA) is a typical problem in the field of secure multiparty computation, which enables two parties calculate the cardinality of intersection securely without revealing any information about their sets. And it is suitable for private data protection scenarios where only the cardinality of the set intersection needs to be calculated. However, most of the currently available PSI-CA protocols only meet the security under the semi-honest model and can't resist the malicious behaviors of participants. To solve the problems above, by the application of the variant of Elgamal cryptography and Bloom filter, we propose an efficient PSI-CA protocol with high security. We also present two new operations on Bloom filter called IBF and BIBF, which could further enhance the safety of private data. Using zeroknowledge proof to ensure the safety under malicious adversary model. Moreover, in order to minimize the error in the results caused by the false positive problem, we use Garbled Bloom Filter and key-value pair packing creatively and present an improved PSI-CA protocol. Through experimental comparison with several existing representative protocols, our protocol runs with linear time complexity and more excellent characters, which is more suitable for practical application scenarios. [ABSTRACT FROM AUTHOR]

Polynomial multiplication algorithms such as Toom-Cook and the Number Theoretic Transform are fundamental building blocks for lattice-based post-quantum cryptography. In this work we present correlation power-analysis-based side-channel analysis methodologies targeting every polynomial multiplication strategy for all lattice-based post-quantum key encapsulation mechanisms in the final round of the NIST post-quantum standardization procedure. We perform practical experiments on real side-channel measurements, demonstrating that our method allows to extract the secret key from all lattice-based post-quantum key encapsulation mechanisms. Our analysis shows that the used polynomial multiplication strategy can significantly impact the time complexity of the attack. [ABSTRACT FROM AUTHOR]

Elliptic curve cryptography is a widely deployed technology for securing digital communication. It is the basis of many cryptographic primitives such as key agreement protocols, digital signatures, and zero-knowledge proofs. Fast elliptic curve cryptography relies on heavily optimised modular arithmetic operations, which are often tailored to specific micro-architectures. In this article, we study and evaluate optimisations of the popular elliptic curve Curve25519 for ARM processors. We specifically target the ARM NEON single instruction, multiple data (SIMD) architecture, which is a popular architecture for modern smartphones. We introduce a novel representation for 128-bit NEON SIMD vectors, optimised for SIMD parallelisation, to accelerate elliptic curve operations significantly. Leveraging this representation, we implement an extended twisted Edwards curve Curve25519 back-end within the popular Rust library "curve25519-dalek". We extensively evaluate our implementation across multiple ARM devices using both cryptographic benchmarks and the benchmark suite available for the Signal protocol. Our findings demonstrate a substantial back-end speed-up of at least 20% for ARM NEON, along with a noteworthy speed improvement of at least 15% for benchmarked Signal functions. [ABSTRACT FROM AUTHOR]

The emergence of new complex technologies, such as cloud and quantum computing, has a complicated computational structure, which can compromise the security of traditional cryptographic protocols. It has been noted that traditional security systems utilize non-quantum resistance factorization and Diffie–Hellman (DH) hard problems for their protection. Lattice-based cryptography appears to be a potential post-quantum substitute for the presently employed public-key cryptography. As a result, we have been motivated to focus on increasingly sophisticated and challenging lattice hard assumptions capable of withstanding new modern technologies with quantum resistance properties. In this paper, we devise a new lattice-based public-key encryption and signature schemes with smaller key sizes. The proposed scheme also resists the quantum attack because of the lattice small integer solution problem and its variant. The security claim has also been proved in a well-suited model for quantum attacks. The performance analysis shows that the presented schemes outperform the DH-type schemes and compete with similar lattice-based schemes in terms of storage, communication, key sizes, and computational overheads. [ABSTRACT FROM AUTHOR]

Quantum-key-distribution (QKD) networks are gaining importance and it has become necessary to analyze the most appropriate methods for their long-distance interconnection. In this paper, four different methods of interconnecting remote QKD networks are proposed. The methods are used to link three different QKD testbeds in Europe, located in Berlin, Madrid, and Poznan. Although long-distance QKD links are only emulated, the methods used can serve as a blueprint for the secure interconnection of distant QKD networks in the future. Specifically, the presented approaches combine, in a transparent way, different fiber and satellite physical media, as well as common standards of key delivery interfaces. The testbed interconnections are designed to increase the security by utilizing multipath techniques and multiple hybridizations of QKD and post-quantum cryptography (PQC) algorithms. [ABSTRACT FROM AUTHOR]

Farfalle is a permutation-based construction for building a pseudorandom function which has been proposed by Bertoni et al. in 2017. In this work, we show that by observing suitable inputs to Farfalle, one can derive various constructions of a periodic function with a period that involves a secret key. As this admits the application of Simon's algorithm in the so-called Q2 attack model, we further show that in the case when internal rolling function is linear, then the secret key can be extracted under feasible assumptions. Furthermore, using the provided constructions of periodic functions for Farfalle, we show that one can mount forgery attacks on the session-supporting mode for authenticated encryption (Farfalle-SAE) and the synthetic initial value AE mode (Farfalle-SIV). In addition, as the wide block cipher mode Farfalle-WBC is a 4-round Feistel scheme, a quantum distinguisher is constructed in the case when input branches are containing at last two blocks, where length of one block corresponds to the size of a permutation employed in Farfalle (a similar attack can be mounted to Farfalle-WBC-AE). And finally, we consider the problem of extracting a secret round key out of different periods obtained from a (Generalized) Feistel scheme (GFN), which has not been addressed in any of the previous works which consider the application of Simon's (or Simon-Grover) algorithm to round reduced versions of GFNs. In this part, we assume that the key is added to an input of an inner function utilized in the round function of a given GFN. By applying two different interpolation formulas, we show that one can extract the round key by utilizing amount of different periods which is closely related to the polynomial/algebraic degree of underlying inner function. Our methods can be seen as an extension of existing quantum attacks on key-alternating GFNs based on Simon's or Simon-Grover algorithms. [ABSTRACT FROM AUTHOR]

Communication system and internet dominance in our society, has made image security a matter of paramount concern. Cryptography involves encrypting data to protect information exchange between senders and receivers, establishing a foundation for secure communication. The Advanced Encryption Standard (AES) is an exceptional algorithm that plays a pivotal role in this area because of its ability to consistently transform plain data into cipher data using the same encryption key. This algorithm engages intricate encryption techniques, harnessing a variety of algorithms and transformations to ensure robust data security. This study introduces an image encryption technique to comprehensively address security requirements. The proposed approach uses encryption to provide high reliability and security, effectively protecting sensitive media from unauthorized access. The sender's file is divided into multiple pieces to maximize confidentiality, using an advanced algorithm. Upon proper decryption, these pieces seamlessly reconstruct the original file. The suggested technique enables customers to securely keep information on cloud storage, addressing concerns about possible leakage, damage or corruption. By integrating cloud storage and digital signatures, this method ensures protection and reliability for sensitive information. [ABSTRACT FROM AUTHOR]

Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be achieved unconditionally for any language in NEXP, as long as one is willing to make a suitable physical assumption: if the provers are spatially isolated, then they can be assumed to be playing independent strategies. Quantum mechanics, however, tells us that this assumption is unrealistic, because spatially-isolated provers could share a quantum entangled state and realize a non-local correlated strategy. The MIP* model captures this setting. In this work, we study the following question: Does spatial isolation still suffice to unconditionally achieve zero knowledge even in the presence of quantum entanglement? We answer this question in the affirmative: we prove that every language in NEXP has a 2-prover zero knowledge interactive proof that is sound against entangled provers; that is, NEXP ⊆ ZK-MIP*. Our proof consists of constructing a zero knowledge interactive probabilistically checkable proof with a strong algebraic structure, and then lifting it to the MIP* model. This lifting relies on a new framework that builds on recent advances in low-degree testing against entangled strategies, and clearly separates classical and quantum tools. Our main technical contribution is the development of new algebraic techniques for obtaining unconditional zero knowledge; this includes a zero knowledge variant of the celebrated sumcheck protocol, a key building block in many probabilistic proof systems. A core component of our sumcheck protocol is a new algebraic commitment scheme, whose analysis relies on algebraic complexity theory. [ABSTRACT FROM AUTHOR]

In the field of post-quantum security, isogeny-based cryptography stands out for its ability to fight quantum attacks. One of the key operations in isogeny-based schemes is finite field multiplication, which plays a crucial role in cryptographic protocols such as key exchange and digital signatures. To ensure practical implementations of these schemes, efficient finite field multiplication is essential. In this research, a novel optimization approach, the Crossover-Boosted Water Cycle Algorithm (CB-WCA), to enhance the efficiency of finite field multiplication in isogeny-based cryptography is proposed. By using both the WCA and a crossover method inspired by genetic algorithms, the CB-WCA effectively explores solution areas, aiming for the best solutions. The formulation of the finite field multiplication optimization problem and an objective function that quantifies the efficiency of the multiplication process based on computational cost is presented and defined. The CB-WCA is then applied to find the optimal set of parameters for finite field multiplication algorithms. Extensive experimental evaluations are conducted, comparing the performance of the CB-WCA-optimized algorithms with traditional optimization methods and other metaheuristic algorithms. Through the findings, it is evident that the CB-WCA stands out for its ability to achieve faster execution times and decrease computational costs. Furthermore, the optimized finite field multiplication algorithms are integrated into isogeny-based cryptographic schemes and evaluate their impact on cryptographic protocol efficiency and security. Real-world implementations showcase the practical applicability of the optimized algorithms in hardware and software environments. To ensure the security of the optimized algorithms, rigorous cryptanalysis is performed to verify their resilience against potential attacks, ensuring they meet the highest standards of security. [ABSTRACT FROM AUTHOR]

We address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z. A ciphertext policy attribute-based encryption scheme without pairings. In: International Conference on Information Security and Cryptology. Springer; 2011. p. 324–40. doi: https://doi.org/10.1007/978-3-642-34704-7%5f23.]. While a lot of work exists on the construction of revocable schemes for CP-ABE based on pairings, works based on lattices are not so common, and – to the best of our knowledge – we introduce the first server-aided revocation scheme in a lattice-based CP-ABE scheme, hence being embedded in a post-quantum secure environment. In particular, we rely on semi-trusted "mediators" to provide a multi-step decryption capable of handling mediation without re-encryption. We comment on the scheme and its application, and we provide performance experiments on a prototype implementation in the Attribute-Based Encryption spin-off library of Palisade to evaluate the overhead compared with the original scheme. [ABSTRACT FROM AUTHOR]

This article describes the author's experience designing and implementing an inquiry-based learning (IBL) pedagogical approach to an upper-division undergraduate cryptology course. The author shares the course goals and how the IBL style supports their achievement. The article concludes with sample activities – in-class exercises that touch on one-time pad, the Birthday Problem, the Meet-in-the-Middle attack, and Diffie–Hellman key exchange protocol, and a programing assignment on the Vigenère cipher. [ABSTRACT FROM AUTHOR]

Security awareness is one of the most pressing topics in today's globe. The idea of cryptography is introduced when the subject is information security. Conventional cryptography-based security techniques rely on the presumption that keys are shared before secure connections. The most crucial factor to consider when integrating cryptographic operations into account when integrating cryptographic operations in with any system is the safe key management strategy required for sending and transferring a secret key between two entities The systems will be vulnerable to bugs and possibly fatal external assaults if the fundamental management methods are poor A method for securely encrypting data sent between parties is quantum cryptography. and spotting eavesdroppers trying to overhear the conversation. Quantum cryptography may be the solution to these issues a quantum cryptography application, Quantum Key Distribution (QKD), refers to the production of a cryptographic key with unconditional security assured by physical rules. Quantum cryptography is a kind of encryption. We examine the quantum key exchange protocol (BB84 protocol) in this study and the way that it significantly improves data transfer security when compared to standard encryption techniques. The main objective of quantum cryptography is to offer a trustworthy way to provide a secure method of communication between the intended peers only and to detect the Eavesdropper presence. [ABSTRACT FROM AUTHOR]

The paper studies the relevance of the issues of encrypting confidential data for their transmission over unsecured channels of information and communication networks. An analysis of encrypted information exchange on the Internet based on the Google service was carried out in terms of the volume of encrypted web traffic. It is concluded that the difference in traffic volumes between countries is due to the popularity of the types of devices used, the geographic access infrastructure, as well as the availability of software that provides modern types of encryptions. The role of the HTTPS protocol in ensuring the security of working with resources on the Internet is substantiated. The NIST security requirements for modern information and communication systems in the post-quantum period are analyzed. It is determined that within a short period of time the power of computing devices increases exponentially, which entails an increase in the implementation of both already known and new attacks on cryptographic algorithms that ensure the strength of security services in networks. Based on the results of this study, the results of a comparative analysis of the complexity of classical and quantum algorithms were demonstrated. The classification of special attacks was considered according to the signs of influence on computing processes, according to access to systems and means, as well as according to the specifics of the attacks themselves. Solutions submitted for participation in the NIST competition for the definition of security standards through electronic digital signature mechanisms, encryption algorithms and key encapsulation are analyzed. The results of the analysis are presented in the form of a scheme of security and stability of the proposed protocols and algorithms. It is recommended to use TLS protocols to ensure the integrity and authenticity of users when establishing communication sessions with websites. A scheme of the process of authenticated encryption and authentication of an encrypted message transmitted over a TLS connection has been developed. A process scheme has been developed for authentication encryption and decryption of information when establishing a communication session in TLS protocols. A comparative analysis of the characteristics of the TLS 1.3 and TLS 1.2 protocols was carried out. [ABSTRACT FROM AUTHOR]

Classical cryptography (crypt) schemes (sche) have been compromised by the practical results on quantum (q) computers in recent years. Nowadays these sche 's can be compromised by using the Shor's methodology. This paper provides a detailed survey of the work on so called post q crypt (PQC) sche 's, which are based on different principles, minimizing the threats coming from advances of q-computers. Even so, post-q-sche 's do not completely solve the problem (prblm) but rather represent (rprs) a temporary solution. On the other hand, q-crypt (QC) and q-key distribution (distr) (QKD), discussed in this paper, offer the ultimate solution: by relying on entanglement (gle) between q-states (tat's). At least in the beginning, a competition is anticipated between the two approaches to security (O) sche 's, so the paper provides comprehensive survey of both QC and PQC algorithms (lgrt's), enabling full understanding of pros and cons when choosing implementation (αmpl) options in future networks (net's). To further encourage the net designers to consider q-solutions for future net 's, the paper presents original, fundamental research work on LEO satellite net optimization (Optmz) A lgrt 's for global QKD. The solutions using exclusively LEO orbits instead the combinations of LEO and GEO orbits, considered so far, enable up to two orders of magnitude power savings which is of importance when it comes to Jmpl of the net using power constrained terminals. The A lgrt 's are designed for using q-Search A lgrt 's (QSA), like Grover A lgrt, and q-Approximate (aprx) O ptmz-A lgrt 's (QAOA), especially powerful for solving combinatorial O ptmz - prblm 's. Index Terms: PQC, QC, QKD. [ABSTRACT FROM AUTHOR]

Copyright of Przegląd Elektrotechniczny is the property of Przeglad Elektrotechniczny and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Most currently used cryptographic tools for protecting data are based on certain computational assumptions, which makes them vulnerable with respect to technological and algorithmic developments, such as quantum computing. One existing option to counter this potential threat is quantum key distribution, whose security is based on the laws of quantum physics. Quantum key distribution is secure against unforeseen technological developments. A second approach is post-quantum cryptography, which is a set of cryptographic primitives that are believed to be secure even against attacks with both classical and quantum computing technologies. From this perspective, this study reviews recent progress in the deployment of the quantum-secured infrastructure based on quantum key distribution, post-quantum cryptography, and their combinations. Various directions in the further development of the fullstack quantum-secured infrastructure are also indicated. Distributed applications, such as blockchains and distributed ledgers, are also discussed. [ABSTRACT FROM AUTHOR]

Caesar cipher algorithm is one of the ancient algorithms. However, due to advances in technology the algorithm is now much simple to breach. This is because; each letter in the message is replaced by the same letter as specified. To raise the safety, some changes can be made. So, here we are going to use another arithmetic algorithm Diffie - Hellman's mode of changing the key to find the secret key and use simple calculations to verify data encryption. After obtaining a private shared key using the Diffie-Hellman method, depending on the operating mode with 26 keys to get the value of 26 or less, then the current character is taken with the key when the additional value of the new character. In any letter in the position of an 'x', the key first increases with an 'x' and is adjusted to get the encrypted letter. Therefore, 2 messages are repeated 2 times and the third letter has 3. This increases safety. This technology can be used to securely transfer sensitive information from one person to another. [ABSTRACT FROM AUTHOR]

The Number Theoretic Transform (NTT) has been widely used to speed up polynomial multiplication in lattice-based post-quantum algorithms. All NTT operands use modular arithmetic, especially modular multiplication, which significantly influences NTT hardware implementation efficiency. Until now, most hardware implementations used Digital Signal Processing (DSP) to multiply two integers and optimally perform modulo computations from the multiplication product. This paper presents a customized Lattice-DSP (L-DSP) for modular multiplication based on the Karatsuba algorithm, Vedic multiplier, and modular reduction methods. The proposed L-DSP performs both integer multiplication and modular reduction simultaneously for lattice-based cryptography. As a result, the speed and area efficiency of the L-DSPs are 283 MHz for 77 SLICEs, 272 MHz for 87 SLICEs, and 256 MHz for 101 SLICEs with the parameters q of 3329, 7681, and 12,289, respectively. In addition, the N − 1 multiplier in the Inverse-NTT (INTT) calculation is also eliminated, reducing the size of the Butterfly Unit (BU) in CRYSTAL-Kyber to about 104 SLICEs, equivalent to a conventional multiplication in the other studies. Based on the proposed DSP, a Point-Wise Matrix Multiplication (PWMM) architecture for CRYSTAL-Kyber is designed on a hardware footprint equivalent to 386 SLICEs. Furthermore, this research is the first DSP designed for lattice-based Post-quantum Cryptography (PQC) modular multiplication. [ABSTRACT FROM AUTHOR]

Blockchain technology provides efficient and secure solutions to various online activities by utilizing a wide range of cryptographic tools. In this article, we survey the existing literature on post-quantum secure digital signatures that possess exotic advanced features and that are crucial cryptographic tools used in the blockchain ecosystem for (1) account management, (2) consensus efficiency, (3) empowering scriptless blockchain, and (4) privacy. The exotic signatures that we particularly focus on in this work are the following: multi-/aggregate, threshold, adaptor, blind, and ring signatures. Herein the term "exotic" refers to signatures with properties that are not just beyond the norm for signatures, e.g., unforgeability, but also imbue new forms of functionalities. Our treatment of such exotic signatures includes discussions on existing challenges and future research directions in the post-quantum space. We hope that this article will help to foster further research to make post-quantum cryptography more accessible so that blockchain systems can be made ready in advance of the approaching quantum threats. [ABSTRACT FROM AUTHOR]

Quantum-secure communication and computation have garnered increasing attention due to their powerful search capabilities for certain complex problems and their ability to provide unconditional security. This indicates that classical cryptography, such as asymmetric ciphers based on complex mathematics, faces a significant threat from quantum algorithms. However, quantum cryptography can detect any attempt to eavesdrop on a channel. As a result, the investigation and implementation of quantum computers and quantum-secure communication networks have become essential objectives for numerous research teams. This paper provides an overview of quantum cryptography, including its development, and focuses on the theoretical aspect of quantum secure direct communication (QSDC). This helps readers understand the theoretical operating principles and gain a better understanding of the entire quantum characteristic and protocol operation in the QSDC field. QSDC enables secure communication without previously shared private keys, making it a crucial topic in quantum cryptography research. This paper provides an overview of several well-known versions of QSDC in theory, discussing their applications, challenges and potential future directions. [ABSTRACT FROM AUTHOR]

In this paper, a technique to develop a secure messaging service utilizing a new post-quantum cryptosystem, termed CryptoMess, is proposed. Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) is utilized to secure key exchange paired with the AES algorithm to protect message content in communication. At the same time, the Rainbow post-quantum digital signature technology is incorporated to assure the integrity and authenticity of communications between the sender and the recipient. As a consequence, the messaging program is able to exchange messages between users, assuring safety, security, integrity, and authenticity. The performance of the program has a transmitting rate of approximately 0.26 s and a receiving rate of approximately 0.22 s. The message signing time is approximately 0.027 s, the message verification speed is approximately 0.22 s, and the key exchange time is approximately 0.0017s. [ABSTRACT FROM AUTHOR]

This paper presents the best outcome of the Quantum communication use case of industrial manufacturing, using quantum theory to achieve secure data transfer between industrial production facilities and production units, especially in the most restricted industrial manufacturing facilities (i.e., Air and Defense production units). Quantum computing has several features to support manufacturing and production units within defense industrial products. Users must validate their user credentials and other essential information to access critical data from the source to the target system. We introduce Rawal Liang and Peter's (RLP) sequence for quantum key distribution to support the security and privacy of industrial manufacturing businesses. [ABSTRACT FROM AUTHOR]

Zero-knowledge proof (ZKP) is a fundamental cryptographic primitive that allows a prover to convince a verifier of the validity of a statement without leaking any further information. As an efficient variant of ZKP, noninteractive zero-knowledge proof (NIZKP) adopting the Fiat-Shamir heuristic is essential to a wide spectrum of applications, such as federated learning, blockchain, and social networks. However, the heuristic is typically built upon the random oracle model that makes ideal assumptions about hash functions, which does not hold in reality and thus undermines the security of the protocol. Here, we present a quantum solution to the problem. Instead of resorting to a random oracle model, we implement a quantum randomness service. This service generates random numbers certified by the loophole-free Bell test and delivers them with postquantum cryptography (PQC) authentication. By employing this service, we conceive and implement NIZKP of the three-coloring problem. By bridging together three prominent research themes, quantum nonlocality, PQC, and ZKP, we anticipate this work to inspire more innovative applications that combine quantum information science and the cryptography field. [ABSTRACT FROM AUTHOR]

Most of current public key cryptosystems would be vulnerable to the attacks of the future quantum computers. Post-quantum cryptography offers mathematical methods to secure information and communications against such attacks, and therefore has been receiving a significant amount of attention in recent years. Lattice-based cryptography, built on the mathematical hard problems in (high-dimensional) lattice theory, is a promising post-quantum cryptography family due to its excellent efficiency, moderate size and strong security. This survey aims to give a general overview on lattice-based cryptography. To this end, the authors begin with the introduction of the underlying mathematical lattice problems. Then they introduce the fundamental cryptanalytic algorithms and the design theory of lattice-based cryptography. [ABSTRACT FROM AUTHOR]