Results 31 to 40 of about 11,917 (171)
Quantum Election Protocol Based on Quantum Public Key Cryptosystem
There is no quantum election protocol that can fulfil the eight requirements of an electronic election protocol, i.e., completeness, robustness, privacy, legality, unreusability, fairness, verifiability, and receipt‐freeness. To address this issue, we employ the general construction of quantum digital signature and quantum public key encryption, in ...
Wenhua Gao, Li Yang, Prosanta Gope
wiley +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 +2 more sources
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.
Jean-Pierre Seifert +3 more
core +1 more source
A McEliece cryptosystem using permutation codes [PDF]
This paper is an attempt to build a new public-key cryptosystem; similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem built using two permutation error-correcting codes.
Srinivasan, Adarsh, Mahalanobis, Ayan
core
Hexi McEliece public key cryptosystem [PDF]
This paper introduces a new class of hexi codes namely, hexi polynomial codes, hexi Rank Distance codes, hexi Maximum Rank Distance codes, hexi Goppa codes and hexi wild Goppa codes.
Ilanthenral, K. +3 more
core +1 more source
Secure and Efficient Code-Based Cryptography for Multi-Party Computation and Digital Signatures
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
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
On Decoding Schemes for the MDPC-McEliece Cryptosystem [PDF]
Recently, it has been shown how McEliece public-key cryptosystems based on moderate-density parity-check (MDPC) codes allow for very compact keys compared to variants based on other code families. In this paper, classical (iterative) decoding schemes for MPDC codes are considered.
Bartz, Hannes, Liva, Gianluigi
openaire +4 more sources
Decoding the Tensor Product of MLD Codes and Applications for Code Cryptosystems
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
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

