Results 31 to 40 of about 8,486 (220)
A lightweight McEliece cryptosystem co-processor design [PDF]
, 2020 Due to the rapid advances in the development of quantum computers and their susceptibility to errors, there is a renewed interest in error correction algorithms.
Agrawal, Rashmi +3 more
core +2 more sources
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
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
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
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
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
Cryptography, 2021 The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem, together with the one-Mannheim ...
Johann-Philipp Thiers +1 more
doaj +1 more source
A CCA2 Secure Variant of the McEliece Cryptosystem [PDF]
, 2012 The McEliece public-key encryption scheme has become an interesting alternative to cryptosystems based on number-theoretical problems. Differently from RSA and ElGa- mal, McEliece PKC is not known to be broken by a quantum computer.
Dowsley, Rafael +3 more
core +5 more sources
Permutations preserving divisibility [PDF]
, 2001 We give a proof of a theorem on the common divisibility of polynomials and permuted polynomials (over GF(2)) by a polynomial g(x)
Le Dantec, Claude +2 more
core +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 +2 more sources
Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets [PDF]
, 2020 We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing message randomization in their encoding procedures.
Matsumoto, Ryutaroh
core +2 more sources