A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A distinguisher for high rate McEliece cryptosystems
2011
2011 IEEE Information Theory Workshop
Preserved Fulltext
In this paper, we present an efficient distinguisher for alternant and Goppa codes of high rate over binary/non binary fields. ...
GD is the problem of distinguishing the public matrix in the McEliece cryptosystem from a random matrix. ...
In this paper, we present a deterministic polynomial-time distinguisher for solving the GD problem defined below with advantage close to 1 for codes of high rate. ...
doi:10.1109/itw.2011.6089437
dblp:conf/itw/FaugereGOPT11
fatcat:bskpih4hczfbrkpf2stish6pfa
A Distinguisher for High-Rate McEliece Cryptosystems
2013
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present an efficient distinguisher for alternant and Goppa codes of high rate over binary/non binary fields. ...
GD is the problem of distinguishing the public matrix in the McEliece cryptosystem from a random matrix. ...
In this paper, we present a deterministic polynomial-time distinguisher for solving the GD problem defined below with advantage close to 1 for codes of high rate. ...
doi:10.1109/tit.2013.2272036
fatcat:6unjob76nbgvtjyndsiyhcfsk4
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes
2013
2013 IEEE International Symposium on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The pseudo-randomness, in fact the key security, is often the weak spot even for Goppa codes. In [10] a distinguisher for high rate Goppa codes is presented. ...
The encryption and decryption is as usual for the original McEliece cryptosystem. One of the main benefits of our work refers to its security reduction. ...
The pseudo-randomness, in fact the key security, is often the weak spot even for Goppa codes. In [10] a distinguisher for high rate Goppa codes is presented. ...
doi:10.1109/isit.2013.6620590
dblp:conf/isit/MisoczkiTSB13
fatcat:hkeuja3b6rhgtm3xruezsfx244
Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Code equivalence is directly related to the security of McEliece-type cryptosystems in the case where the private code is known to the adversary. ...
This problem has a direct reduction to a nonabelian hidden subgroup problem (HSP), suggesting a possible quantum algorithm analogous to Shor's algorithms for factoring or discrete log. ...
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
A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we describe a new Niederreiter cryptosystem based on quasi-cyclic m-1/m codes that is quantum-secure. ...
This new cryptosystem has good transmission rate compared to the one using binary Goppa codes and uses smaller keys. ...
We also show that the proposed cryptosystem has high encryption rate and shorter keys compared to classical McEliece cryptosystems. ...
arXiv:1803.07827v1
fatcat:fox7lg7ev5cl7oitznxnyzfruq
ON THE CONSTRUCTION OF A SEMANTICALLY SECURE MODIFICATION OF THE MCELIECE CRYPTOSYSTEM
2019
PRIKLADNAYa DISKRETNAYa MATEMATIKA
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Further, one can suppose that this system can be used as base cryptosystem for building the McEliece type encryption scheme with the IND-CCA2 property and an efficient information transfer rate. ...
In the paper, the goal is to construct a McEliece type cryptosystem that has the IND-CPA property. ...
Consequently, the development of cryptosystems of the McEliece type with the IND-CCA2 property and the high information transfer rate is current of interest. ...
doi:10.17223/20710410/45/4
fatcat:vbgjfjlsbfhh7pkph64fahowyu
Security and complexity of the McEliece cryptosystem based on quasi-cyclic low-density parity-check codes
2013
IET Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2013 pre-print arXiv:1109.5827v5 fatcat:ouqn53dnhbhgnieeuelqujjhdaOther Versions
We also provide theoretical arguments and practical tools for estimating the trade-off between security and complexity, in such a way to give a simple procedure for the system design. ...
In the context of public key cryptography, the McEliece cryptosystem represents a very smart solution based on the hardness of the decoding problem, which is believed to be able to resist the advent of ...
ACKNOWLEDGMENT The authors wish to thank Rafael Misoczki for having suggested improvements in Table III , and Ludovic Perret for fruitful discussion on the complexity of the attacks to the cryptosystems ...
doi:10.1049/iet-ifs.2012.0127
fatcat:q5yjdugd6bd7jcbicdjaum5ule
Enhanced public key security for the McEliece cryptosystem
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
McEliece cryptosystem for security reasons. ...
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. ...
Acknowledgment The authors would like to thank Jean-Pierre Tillich and Ayoub Otmani for having pointed out the subcode vulnerability for the private code. ...
arXiv:1108.2462v4
fatcat:wlrekb63qzdb7neitzrw55vk2q
Joint QKD-Post-Quantum Cryptosystems
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We also describe a run-time configurable spatially coupled (SC)-LDPC code, derived from template quasi cyclic (QC)-LDPC, suitable for use in both information reconciliation and McEliece crypto-subsystem ...
INDEX TERMS Quantum communication, quantum key distribution (QKD), discrete variable (DV)-QKD, post-quantum cryptography, information reconciliation, McEliece cryptosystem, secret-key rate (SKR). ...
ACKNOWLEDGMENT The authors would like to thank anonymous reviewers for the comments that provided an improvement to the manuscript. ...
doi:10.1109/access.2020.3018909
fatcat:4glyoqske5fd7c2txxsrq7ghxy
PKC-PC: A Variant of the McEliece Public Key Cryptosystem based on Polar Codes
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
to the McEliece cryptosystem. ...
This paper studies a variant of the McEliece public key cryptosystem based on polar codes, called "PKC-PC". ...
In fact, such distinguisher can solve Goppa code distinguishing (GCD) problem in polynomial-time for high code rates (near 1). ...
arXiv:1712.07672v1
fatcat:tbwh5oagvze3bixmk4rdl2qdey
McEliece-type Cryptosystems over Quasi-cyclic Codes
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We propose a new variant of Niederreiter cryptosystem over rate m-1/m quasi-cyclic codes which is secure against quantum Fourier sampling due to indistinguishability of the hidden subgroup. ...
In this thesis, we study algebraic coding theory based McEliece-type cryptosystems over quasi-cyclic codes. ...
Putting all these together, we see that |K| 2 e −δp ≤ 4p 8 e −δp for some positive constant δ. ...
arXiv:1805.09972v1
fatcat:4ugriofz4fat5fmz72sxx32dqu
MDPC decoding algorithms and their impact on the McEliece cryptosystem
2018
Proceedings of the 2018 Federated Conference on Computer Science and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This work presents a comparison of different variants of MDPC decoding algorithms and their impact on the cryptosystem. ...
We present a complete analysis of modification of this algorithm and new results of the likelihood of correct word decoding for security systems which ensure security level 2 128 and 2 256 . ...
However, it still has too high DFR to be practically used. Our proposition to change the δ value for higher security level has a very strong impact on the decoding failure rate. ...
doi:10.15439/2018f99
dblp:conf/fedcsis/Janoska18
fatcat:hjmk6d4p3beivovyxk2b3x2lqe
A Novel Digital Signature based on Error Correcting Codes
2019
International Journal on Recent and Innovation Trends in Computing and Communication
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A digital signature is a cryptographic primitive for ensuring the authenticity of digital documents. ...
The main goal is to make digital signature for which the security is based on decoding syndrome problem. ...
According to the authors, the signature can be made using Goppa codes of a high rate. ...
doi:10.17762/ijritcc.v7i3.5253
fatcat:ux7q3fgul5fj5j5cyretjdz4ui
Error-correcting pairs
2015
ACM Communications in Computer Algebra
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
McEliece proposed the first public-key cryptosystem based on linear error-correcting codes. A code with an efficient bounded distance decoding algorithm is chosen as secret key. ...
That means that, the McEliece cryptosystem is not only based on the intractability of bounded distance decoding but also on the problem of retrieving an error-correcting pair from the public code. ...
Recent progress is made with respect to the second assumption by [5, 2] where it is shown that one can distinguish between high rate Goppa, alternant and random codes. ...
doi:10.1145/2768577.2768606
fatcat:pracjrwa7rhehk2v7loa4izgzi
A CCA2 Secure Variant of the McEliece Cryptosystem
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
for public-key cryptosystems. ...
In this work, we show the first construction of a McEliece based public-key cryptosystem secure against chosen ciphertext attacks in the standard model. ...
For this instantiation, an efficient distinguisher was built for the case of high-rate codes [12] , [13] (i.e., codes where the rate are very close to 1). ...
arXiv:1205.5224v3
fatcat:asb4xmwomfbcnnbmgeg44mly5e
« Previous
Showing results 1 — 15 out of 238 results