Results 11 to 20 of about 124 (115)
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
IET Information Security, Volume 17, Issue 2, Page 171-209, March 2023., 2023 Abstract In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post‐quantum secure cryptosystems.
J.‐F. Biasse +4 more
wiley +1 more source
Improved lattice enumeration algorithms by primal and dual reordering methods
IET Information Security, Volume 17, Issue 1, Page 35-45, January 2023., 2023 Abstract The security of lattice‐based cryptosystems is generally based on the hardness of the Shortest Vector Problem (SVP). The original enumeration (ENUM) algorithm solving SVP runs in exponential time due to the exhaustive search, which is used as a subroutine for the block Korkin–Zolotarev (BKZ) algorithm.
Kazuki Yamamura +2 more
wiley +1 more source
A Primer on Underwater Quantum Key Distribution
Quantum Engineering, Volume 2023, Issue 1, 2023., 2023 The growing importance of underwater networks (UNs) in mission‐critical activities at sea enforces the need for secure underwater communications (UCs). Classical encryption techniques can be used to achieve secure data exchange in UNs. However, the advent of quantum computing will pose threats to classical cryptography, thus challenging UCs. Currently,
Pietro Paglierani +6 more
wiley +1 more source
Key encapsulation mechanism based on polar codes
IET Communications, Volume 16, Issue 20, Page 2438-2447, December 2022., 2022 Abstract This paper introduces a key encapsulation mechanism based on polar codes, called as KEM‐PC, with secure and efficient key generation, encapsulation and decapsulation algorithms. In the proposed KEM‐PC, the ephemeral public encapsulation and secret decapsulation keys, which are generated at each key exchange session, are employed.
Reza Hooshmand, Mahdi Khoshfekr
wiley +1 more source
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 Water color is an important representation reflecting the characteristics of its quality in inland lakes or ponds; however, sufficient water color image samples are often difficult to obtain due to the limitation of fishery production. For few color image samples, the existing data enhancement methods based on the depth generation model have the ...
Zan Yang +4 more
wiley +1 more source
Security and Communication Networks, Volume 2022, Issue 1, 2022., 2022 Crystals‐Dilithium is one of the digital‐signature algorithms in NIST’s ongoing post‐quantum cryptography (PQC) standardization final round. Security and computational efficiency concerning software and hardware implementations are the primary criteria for PQC standardization.
Youngbeom Kim +4 more
wiley +1 more source
Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values
IEEE Open Journal of the Communications Society, 2022 Code-based cryptosystems are promising candidates for post-quantum cryptography. Recently, generalized concatenated codes over Gaussian and Eisenstein integers were proposed for those systems. For a channel model with errors of restricted weight, those q-
Johann-Philipp Thiers +1 more
doaj +1 more source
Survey of Graph Neural Networks and Applications
Wireless Communications and Mobile Computing, Volume 2022, Issue 1, 2022., 2022 The advance of deep learning has shown great potential in applications (speech, image, and video classification). In these applications, deep learning models are trained by datasets in Euclidean space with fixed dimensions and sequences. Nonetheless, the rapidly increasing demands on analyzing datasets in non‐Euclidean space require additional research.
Fan Liang +5 more
wiley +1 more source
IEEE Access, 2022 Group authenticated key exchange protocols (GAKE) are cryptographic tools enabling a group of several users communicating through an insecure channel to securely establish a common shared high-entropy key.
Jose Ignacio Escribano Pablos +2 more
doaj +1 more source
Quantum approximate optimization of the coset leader problem for binary linear codes
Computational and Mathematical Methods, Volume 3, Issue 6, November 2021., 2021 Abstract The security of a broad family of coding‐based cryptographic techniques relies on the hardness of the Syndrome Decoding Problem (SDP). In this problem, the aim is to find a word with a given syndrome and of Hamming weight smaller than a prefixed bound.
Markel Epelde +2 more
wiley +1 more source