Results 41 to 50 of about 11,917 (171)
Selecting parameters for secure McEliece-based cryptosystems [PDF]
International Journal of Information Security, 2012 In 1994, Shor showed that quantum computers will be able to break cryptosystems based on the problems of integer factorization and the discrete logarithm, for example, RSA or ECC. Code-based cryptosystems are promising alternatives to public-key schemes built on these problems, and they are believed to be secure against quantum computer attacks.
Robert Niebuhr +3 more
openaire +3 more sources
, 2023 The aim of this thesis is to explore the McEliece cryptosystem, a post-quantum cryptosystem based on linear codes. As modern cryptosystems based on number theoretic problems, such as integer factorization and discrete logarithms, are no longer considered
Ali, Amjad
core +1 more source
Study of the security of the mceliece public-key cryptosystem. [PDF]
, 2022 The research object of this paper is McEliece public key cryptosystem. General cryptography aspects are discussed in this paper: tasks, security concepts and levels; possible attack types are analyzed as well.
Galinskas, Ingvaras,
core
Study of the security of mceliece public-key cryptosystem. [PDF]
, 2022 In this work McEliece cryptographic system security has been studied. Research‘s theory has been provided and by using JAVA programming language attacks against McEliece cryptosystem have been written, such as: generalized information-set-decoding attack,
Drabužinskis, Paulius,
core
Strengthening McEliece Cryptosystem [PDF]
, 2000 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 +2 more sources
Cryptanalysis of McEliece’s Public-Key Cryptosystem [PDF]
, 2007 An approach is proposed for the cryptanalysis of the well-known version of McEliece's public-key cryptosystem that is based on a new iterative optimization algorithm for decoding an arbitrary linear code. The algorithm provides guaranteed correction of all error patterns with Hamming weight less than d/2, where d is the minimum distance of the code ...
Valery I. Korzhik, Andrew I. Turkin
openaire +1 more source
Enhanced Public Key Security for the McEliece Cryptosystem [PDF]
Journal of Cryptology, 2014 This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the public key is no longer permutation equivalent to the secret code. This increases the security level of the public key, thus opening the way for reconsidering the adoption of classical families of codes, like Reed–Solomon codes, that have been longly ...
Marco Baldi +4 more
openaire +6 more sources
Study of the security of mceliece public-key cryptosystem. [PDF]
, 2021 The considered problem is the assessment of the McEliece cryptographic system in the context of the intense development of quantum computers. The McEliece cryptosystem is resistant to the P. Shor‘s algorithm for quantum computers in contrast to currently
Jachimovičius, Paulius,
core
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
Joint QKD-Post-Quantum Cryptosystems
IEEE Access, 2020 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