Results 51 to 60 of about 2,437 (198)
Tensor-based trapdoors for CVP and their application to public key cryptography [PDF]
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product.
Fischlin, Roger, Seifert, Jean-Pierre
core +2 more sources
Semantically Secure McEliece Public-Key Cryptosystems -Conversions for McEliece PKC - [PDF]
Almost all of the current public-key cryptosystems (PKCs) are based on number theory, such as the integer factoring problem and the discrete logarithm problem (which will be solved in polynomial-time after the emergence of quantum computers). While the McEliece PKC is based on another theory, i.e.
Kazukuni Kobara, Hideki Imai
openaire +1 more source
Security-related comments regarding McEliece's public-key cryptosystem [PDF]
The optimal values of the parameters of the McEliece public-key cryptosystem are computed. It is shown that use of these values improves the cryptoanalytic complexity of the system and decreases its data expansion. It is shown that the likelihood of the existence of more than one trapdoor in the system is very small. >
Carlisle M. Adams, Henk Meijer
openaire +1 more source
Cryptanalysis of the Original McEliece Cryptosystem [PDF]
The class of public-key cryptosystems based on error-correcting codes is one of the few alternatives to the common algorithms based on number theory. We here present an attack against these systems which actually consists of a new probabilistic algorithm for finding minimum-weight words in any large linear code.
Anne Canteaut, Nicolas Sendrier
openaire +1 more source
Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values
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
Key reduction of McEliece's cryptosystem using list decoding [PDF]
Different variants of the code-based McEliece cryptosystem were pro- posed to reduce the size of the public key. All these variants use very structured codes, which open the door to new attacks exploiting the underlying structure. In this paper, we show that the dyadic variant can be designed to resist all known attacks. In light of a new study on list
Barbier, Morgan, Barreto, Paulo
openaire +3 more sources
On the security of digital signature schemes based on error-correcting codes [PDF]
We discuss the security of digital signature schemes based on error-correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to explain why the Xinmei scheme failed, such as the linearity of the signature and the ...
Doumen, Jeroen +2 more
core +3 more sources
Strengthening McEliece Cryptosystem [PDF]
McEliece cryptosystem is a public-key cryptosystem based on error-correcting codes. It constitutes one of the few alternatives to cryptosystems relying on number theory. We present a modification of the McEliece cryptosystem which strengthens its security without increasing the size of the public key.
openaire +1 more source
Joint QKD-Post-Quantum Cryptosystems
To extend the transmission distance and/or improve secret-key rate of QKD protocols, we propose to employ the joint QKD-post-quantum cryptosystems in which QKD is used for raw-key transmission while the post-quantum cryptography (PQC) subsystem to ...
Ivan B. Djordjevic
doaj +1 more source
Curse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs
This paper presents a side-channel analysis (SCA) on key encapsulation mechanism (KEM) based on the Fujisaki–Okamoto (FO) transformation and its variants.
Rei Ueno +5 more
doaj +1 more source

