Results 41 to 50 of about 661 (173)
Cryptosystem Based on Induced Group Codes
Моделирование и анализ информационных систем, 2016 The code C on a group G, induced by the code N on a subgroup H, has the property that for decoding the code C one can use the decoder for the code N.
V. M. Deundyak, Y. V. Kosolapov
doaj +1 more source
Decoding the Tensor Product of MLD Codes and Applications for Code Cryptosystems
Моделирование и анализ информационных систем, 2017 For the practical application of code cryptosystems such as McEliece, it is necessary that the code used in the cryptosystem should have a fast decoding algorithm.
Vladimir Mikhailovich Deundyak +2 more
doaj +1 more source
A Centralized Key Management Scheme Based on McEliece PKC for Space Network
IEEE Access, 2020 Constrained by the limited resource, high-latency and high bit error rate, the existing group key management schemes for the space network are inefficient. To solve this problem, we proposed a centralized and identity-based key management scheme by using
Jie Liu +4 more
doaj +1 more source
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 +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
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
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 +1 more source
Tensor-based trapdoors for CVP and their application to public key cryptography
, 1999 We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product.
Jean-Pierre Seifert +3 more
core +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
Curse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs
Transactions on Cryptographic Hardware and Embedded Systems, 2021 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