Results 31 to 40 of about 2,437 (198)
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
Hexi McEliece Public Key Cryptosystem [PDF]
Applied Mathematics & Information Sciences, 2014 This paper introduces a new class of hexi codes namely, hexi polynomial codes, hexi Rank Distance codes, hexi Maximum Rank Distance codes, hexi Goppa codes and hexi wild Goppa codes. These codes are useful to create variants of the McEliece public key cryptosystem known as the hexi McEliece public key cryptosystem and its variants; these cryptosystems ...
K. Ilanthenral, K. S. Easwarakumar
openaire +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
Complete and Improved FPGA Implementation of Classic McEliece
Transactions on Cryptographic Hardware and Embedded Systems, 2022 We present the first specification-compliant constant-time FPGA implementation of the Classic McEliece cryptosystem from the third-round of NIST’s Post-Quantum Cryptography standardization process.
Po-Jen Chen +6 more
doaj +1 more source
Post‐Quantum Secure Password‐Authenticated Key Exchange Based on Ouroboros
Security and Communication Networks, Volume 2022, Issue 1, 2022., 2022 Password‐authenticated key exchange (PAKE) protocols play an important role in cryptography. Most of PAKEs are based on the Diffie–Hellman key exchange protocols or RSA encryption schemes, but their security is threatened by quantum computers. In this study, we propose the first code‐based PAKE protocol based on Ouroboros, which is a code‐based key ...
Hao Wang +3 more
wiley +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