Results 41 to 50 of about 8,486 (220)
Abstract The original McEliece PKC proposal is interesting thanks to its resistance against all known attacks, even using quantum cryptanalysis, in an IND-CCA2 secure conversion. Here we present a generic implementation of the original McEliece PKC proposal, which provides test vectors (for all important intermediate results), and ...
openaire +1 more source
Compact McEliece keys based on quasi-dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very large keys, hence recent research has focused mainly on trying to reduce the
Persichetti Edoardo
doaj +1 more source
p-Adic estimates of Hamming weights in Abelian codes over Galois rings [PDF]
A generalization of McEliece's theorem on the p-adic valuation of Hamming weights of words in cyclic codes is proved in this paper by means of counting polynomial techniques introduced by Wilson along with a technique known as trace-averaging introduced ...
Katz, Daniel J.
core +1 more source
Decoding algorithms for Goppa codes with errors and erasures [PDF]
In 1978, McEliece built the first public key cryptosystem based on error-correcting codes. This cryptosystem based on Goppa codes is considered promising and cryptographically stable, taking into account quantum computing.
Ratseev, Sergey Mihailovich +1 more
doaj +1 more source
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
The Support Splitting Algorithm for Induced Codes
In the paper, the analysis of the stability of the McEliece-type cryptosystem on induced codes for key attacks is examined. In particular, a model is considered when the automorphism group is trivial for the base code C, on the basis of which the induced
Yury V. Kosolapov, Aleksey N. Shigaev
doaj +1 more source
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
Practical codes for photon communication [PDF]
In a recent paper, Pierce studied the problems of communicating at optical frequencies using photon-counting techniques, and concluded that "at low temperatures we encounter insuperable problems of encoding long before we approach [channel capacity]." In
McEliece, Robert J.
core +1 more source
QC-MDPC McEliece: an Optimized Implementation of a New McEliece Variant
This paper presents the implementation of an optimized version of a McEliece variant. The McEliece cryptosystem is an example of code-based cryptography which is an alternative to the most popular and commercial cryptosystems nowadays as it is believed to be immune to quantum computing. It has simple and fast algorithms, but its drawback is the size of
Martins, H. Oliveira, Nascimento, A. C.
openaire +3 more sources
Attacking and Defending the McEliece Cryptosystem [PDF]
This paper presents several improvements to Stern’s attack on the McEliece cryptosystem and achieves results considerably better than Canteaut et al. This paper shows that the system with the originally proposed parameters can be broken in just 1400 days by a single 2.4GHz Core 2 Quad CPU, or 7 days by a cluster of 200 CPUs.
Bernstein, D.J., Lange, T., Peters, C.P.
openaire +2 more sources

