Filters








107 Hits in 2.3 sec

Strengthening McEliece Cryptosystem [chapter]

Pierre Loidreau
2000 Lecture Notes in Computer Science  
We present a modification of the McEliece cryptosystem which strengthens its security without increasing the size of the public key.  ...  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.  ...  McEliece Public-Key Cryptosystem In the family of public-key cryptosystems based on coding theory the one proposed by McEliece is the most widely considered.  ... 
doi:10.1007/3-540-44448-3_45 fatcat:h37h4cqf6vdldmnsyc5i2bjerq

Post-quantum cryptography-driven security framework for cloud computing

Henry Chima Ukwuoma, Gabriel Arome, Aderonke Thompson, Boniface Kayode Alese
2022 Open Computer Science  
The simulation of the proposed McEliece algorithm showed that the algorithm has a better time complexity than the existing McEliece cryptosystem.  ...  The article proposes a model that comprises the application of a variant of McEliece cryptosystem, which has been tipped to replace Rivest–Shamir–Adleman (RSA) in the quantum computing era to secure access  ...  Proposed McEliece cryptosystem In a bid to increase the security of the McEliece cryptosystem, the key generation mechanism is strengthened, as shown below.  ... 
doi:10.1515/comp-2022-0235 fatcat:hexuew645be2laxfpknbfgrwfm

Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems [article]

Hang Dinh, Cristopher Moore, Alexander Russell
2011 arXiv   pre-print
Code equivalence is directly related to the security of McEliece-type cryptosystems in the case where the private code is known to the adversary.  ...  We revisit the claims of our previous article in the light of these classical attacks, and discuss the particular case of the Sidelnikov cryptosystem, which is based on Reed-Muller codes.  ...  We are grateful to Kirill Morozov and Nicolas Sendrier for discussions about the security of the Sidelnikov cryptosystem and methods for oblivious transfer with McEliece-type cryptosystems [Kobara et  ... 
arXiv:1111.4382v1 fatcat:ke6ggl25afa27mbpivvqrl7a7i

Post-Quantum Network Security:McEliece and Niederreiter Cryptosystems Analysis and Education Issues

2020 WSEAS transactions on systems and control  
The paper is aimed at analyzing of the classical McEliece and Niederreiter cryptosystems as well as theQuasi-Cyclic MDPC McEliece cipher in a context of the post-quantum network security.  ...  The characteristics of the given cryptosystems and otherasymmetric encryption schemes are analyzed.  ...  Binary Goppa codes provide an important element in strengthening the cryptographic resilience of the McEliece and Niederreiter ciphers.  ... 
doi:10.37394/23203.2020.15.62 fatcat:ycx2ry6l2bdvbeqr5qudu5uhb4

McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks [chapter]

Hang Dinh, Cristopher Moore, Alexander Russell
2011 Lecture Notes in Computer Science  
We also strengthen some results of Kempe et al. [9] on subgroups of S n reconstructible by Fourier sampling. McEliece-type cryptosystems.  ...  This gives the first rigorous results on the security of the McEliece-type cryptosystems in the face of quantum adversaries, strengthening their candidacy for post-quantum cryptography.  ...  Application to the McEliece cryptosystem. Consider a McEliece cryptosystem using a q-ary linear [n, k]-code C, with parameters satisfying q k 2 ≤ n 0.2n .  ... 
doi:10.1007/978-3-642-22792-9_43 fatcat:5oyobilk5vb3lpqyy5v3t5gufu

Page 5418 of Mathematical Reviews Vol. , Issue 2002G [page]

2002 Mathematical Reviews  
We present a modification of the McEliece cryptosystem which strengthens its security without increasing the size of the public key.  ...  Dingyi Pei (PRC-ASBJ-MSY; Beijing) 2002g:94042 94A62 94B27 Loidreau, Pierre (F-INRIA-CO; Le Chesnay) Strengthening McEliece cryptosystem.  ... 

A fuzzy sketch with trapdoor

J. Bringer, H. Chabanne, Quoc Dung Do
2006 IEEE Transactions on Information Theory  
The cryptosystem of McEliece is an asymmetric cryptosystem defined as follows: Claim 3 (Cryptosystem of McEliece [16] ) We consider the two codes defined by the matrices G and G pub such that • G is a  ...  Our construction Cryptosystem of McEliece We place ourselves into a hard instance of the McEliece cryptosystem, i.e. let d = c ⊕ e where • c is a word taken at random from a concealed Goppa code, • e  ... 
doi:10.1109/tit.2006.872861 fatcat:2hju3zhdirhgjoh7a2cosfgone

Reducing Key Length of the McEliece Cryptosystem [chapter]

Thierry P. Berger, Pierre-Louis Cayrel, Philippe Gaborit, Ayoub Otmani
2009 Lecture Notes in Computer Science  
The McEliece cryptosystem is one of the oldest public-key cryptosystem ever designated. It is also the first public-key cryptosystem based on linear error-correcting codes.  ...  The main advantage of the McEliece cryptosystem is to have a very fast encryption and decryption functions but suffers from a major drawback.  ...  Introduction The McEliece cryptosystem [18] represents one of the oldest public-key cryptosystem ever designated.  ... 
doi:10.1007/978-3-642-02384-2_6 fatcat:tdu7qveerjhclpbh3l4i4gmilm

The variant of post-quantum cryptosystem based on burst-correcting codes and on the complete decoding problem

Andrey Ovchinnikov
2022 Information and Control Systems  
Today the investigations of post-quantum cryptosystems secure against quantum computations is the area of great interest.  ...  Practical relevance: The proposed system allows to reduce the public-key size as compared to the classical McEliece system, cryptocomplexity also comparable, with the underlying mathematical problem to  ...  system's strengthening.  ... 
doi:10.31799/1684-8853-2022-3-45-54 fatcat:v72cmmjp3bbjbbc5kpeskiee3q

Towards Side-Channel Resistant Implementations of QC-MDPC McEliece Encryption on Constrained Devices [chapter]

Ingo von Maurich, Tim Güneysu
2014 Lecture Notes in Computer Science  
In this context, Misoczki et al. recently proposed the use of quasi-cyclic MDPC (QC-MDPC) codes for the McEliece cryptosystem.  ...  Side-channel attacks on the McEliece cryptosystem have mostly targeted Goppa codes and exploited differences in the timing behavior [18, 20, 21] .  ...  The QC-MDPC McEliece Cryptosystem In this section we describe the key-generation, encryption and decryption of the McEliece cryptosystem based on a t-error correcting (n, r, w)-QC-MDPC code.  ... 
doi:10.1007/978-3-319-11659-4_16 fatcat:qfkwq45ufncp5nt5rzugmfv4yi

On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes

V.M. Deundyak, Yu.V. Kosolapov
2018 Journal of Computational and Engineering Mathematics  
On the other hand, instead of a McEliece-type cryptosystem, it is proposed to use its modification, a Berger -Loidreau cryptosystem.  ...  Strengthening of code cryptosystems is currently conducted, usually, either by using codes for which no attacks are known, or by modifying the cryptographic protocol.  ...  McEliece-type Cryptosystem Under the McEliece-type cryptosystem based on [n, k, d]-code C we mean an analogue of an asymmetric cryptosystem described in [4] .  ... 
doi:10.14529/jcem180202 fatcat:sn7hlqnjozhv3prmhzamwgzily

A proposed encryption technique of different texts using circular link lists

Wisam Abed Shukur, Ahmed Badrulddin, Mohammed Kamal Nsaif
2021 Periodicals of Engineering and Natural Sciences (PEN)  
The sensitive information is encrypted in different manner via using circular link lists as data structure that contains different encryption algorithms such as: LU and LEE, Rabin, Okamoto-Uchiyama, McEliece  ...  Basically, the main model of McEliece cryptosystem is illustrated in figure1 below [8] . 3. The G is generation and k *n is chosen.  ...  Using these cipher methods with circular link list data structure for scheduling them is strengthen the proposed cipher method.  ... 
doi:10.21533/pen.v9i2.2096 fatcat:wocbhse4bvdzxit2u35va5exua

Security-Related Comments Regarding McEliece's Public-Key Cryptosystem [chapter]

Carlisle M. Adams, Henk Meijer
1988 Lecture Notes in Computer Science  
The optimal values for the parameters of the McEliece public key cryptosystem are a mputed. Using these values improves the cryptanalytic complexity of the system and decreases its data expansion.  ...  Introduction McEliece [1978] has introduced a public-key cryptosystem which is based on algebraic coding theory.  ...  We will show how a suitable choice of parameters k and t will m a e this complexity and thus strengthen the algorithm against this attack.  ... 
doi:10.1007/3-540-48184-2_20 fatcat:k6e3ynopp5cmdo32b7gs4heqoe

The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks [article]

Hang Dinh, Cristopher Moore, Alexander Russell
2010 arXiv   pre-print
This allows us to obtain the first rigorous results on the security of the McEliece cryptosystem in the face of quantum adversaries, strengthening its candidacy for post-quantum cryptography.  ...  In this article we show that the McEliece cryptosystem over well-permuted, well-scrambled linear codes resists precisely the attacks to which the RSA and El Gamal cryptosystems are vulnerable---namely,  ...  The McEliece cryptosystem. This public-key cryptosystem was proposed by McEliece in 1978 [11] , and is typically built over Goppa codes.  ... 
arXiv:1008.2390v2 fatcat:w7yviqvhg5htbbj4ig3m6t2pra

Two Public-Key Cryptosystems Based on Expanded Gabidulin Codes [article]

Wenshuo Guo, Fang-Wei Fu
2022 arXiv   pre-print
With different masking techniques, we give two encryption schemes by using expanded Gabidulin codes in the McEliece setting.  ...  This paper presents two public key cryptosystems based on the so-called expanded Gabidulin codes, which are constructed by expanding Gabidulin codes over the base field.  ...  The first code-based cryptosystem, known as McEliece cryptosystem [1] based on Goppa codes, was proposed by McEliece in 1978.  ... 
arXiv:2107.01610v3 fatcat:7j5h2bq5nzdr3bjsw3ktmqfhle
« Previous Showing results 1 — 15 out of 107 results