Results 21 to 30 of about 661 (173)
Decoding algorithms for Goppa codes with errors and erasures [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 In 1978, McEliece built the first public key cryptosystem based on error-correcting codes. This cryptosystem based on Goppa codes is considered promising and cryptographically stable, taking into account quantum computing.
Ratseev, Sergey Mihailovich +1 more
doaj +1 more source
A Distinguisher for High-Rate McEliece Cryptosystems [PDF]
IEEE Transactions on Information Theory, 2011 The Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. The hardness of this problem is an assumption to prove the security of code-based cryptographic primitives such as McEliece's cryptosystem. Up to now, it is widely believed that the GD problem is a hard decision problem. We present the
Faugère, Jean-Charles +4 more
openaire +3 more sources
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
Post-quantum cryptography-driven security framework for cloud computing
Open Computer Science, 2022 Data security in the cloud has been a major issue since the inception and adoption of cloud computing. Various frameworks have been proposed, and yet data breach prevails.
Ukwuoma Henry Chima +3 more
doaj +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
An asymmetric cryptography using Gaussian integers
Engineering and Applied Science Research, 2020 In this paper, the already strong McEliece cryptosystem is enhanced with atwo-dimensional finite Gaussian integer. By substituting the one-dimensional linear code with atwo-dimensional code employing afinite Gaussian integer, anew system ...
Wanarat Juraphanthong +1 more
doaj +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
Noise Modulation‐Based Reversible Data Hiding with McEliece Encryption
Security and Communication Networks, Volume 2022, Issue 1, 2022., 2022 McEliece cryptosystem is expected to be the next generation of the cryptographic algorithm due to its ability to resist quantum computing attacks. Few research studies have combined it with reversible data hiding in the encrypted domain (RDH‐ED). In this article, we analysed and proved that there is a redundancy in the McEliece encryption process that ...
Zexi Wang +5 more
wiley +1 more source
Security and Communication Networks, Volume 2022, Issue 1, 2022., 2022 The existing reversible data hiding methods in encrypted domain separate image encryption from information embedding and do not make full use of the redundant space in the process of image encryption. In order to improve the performance of reversible data hiding by using the technical characteristics of image encryption, a reversible data hiding method
Kong Yongjun +5 more
wiley +1 more source