Results 21 to 30 of about 86 (81)
Secure and Efficient Code-Based Cryptography for Multi-Party Computation and Digital Signatures
Computer Sciences & Mathematics Forum, 2023 Code-based cryptography is a promising candidate for post-quantum cryptography due to its strong security guarantees and efficient implementations. In this paper, we explore the use of code-based cryptography for multi-party computation and digital ...
Abdellatif Kichna, Abderrazak Farchane
doaj +1 more source
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
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
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
Semantically Secure McEliece Public-Key Cryptosystems -Conversions for McEliece PKC - [PDF]
, 2001 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]
IEEE Transactions on Information Theory, 1988 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
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
Cryptanalysis of the Original McEliece Cryptosystem [PDF]
, 2000 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
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 ...
Baldi, Marco +4 more
openaire +4 more sources
Key reduction of McEliece's cryptosystem using list decoding [PDF]
2011 IEEE International Symposium on Information Theory Proceedings, 2011 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