Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
71
Reaction Attacks Against Several Public-Key Cryptosystems
- Department of Computer Science
, 1996
"... We present attacks against the McEliece Public-Key Cryptosystem, the Atjai-Dwork Public-Key Cryptosystem, and variants of those systems. Most of these systems base their security on the apparent intractibility of one or more problems. The attacks we present do not violate the intractibility of the ..."
Abstract
-
Cited by 31 (5 self)
- Add to MetaCart
We present attacks against the McEliece Public-Key Cryptosystem, the Atjai-Dwork Public-Key Cryptosystem, and variants of those systems. Most of these systems base their security on the apparent intractibility of one or more problems. The attacks we present do not violate the intractibility
Timing Attacks against the Syndrome Inversion in Code-based Cryptosystems
"... Abstract. In this work we present new timing vulnerabilities that arise in the inversion of the error syndrome through the Extended Euclidean Algorithm that is part of the decryption operation of code-based Cryptosystems. We analyze three types of timing attack vulnerabilities theoretically and expe ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Abstract. In this work we present new timing vulnerabilities that arise in the inversion of the error syndrome through the Extended Euclidean Algorithm that is part of the decryption operation of code-based Cryptosystems. We analyze three types of timing attack vulnerabilities theoretically
An MQ/Code Cryptosystem Proposal
, 2013
"... We describe a new trap-door (and PKC) proposal. The proposal is “multivariate quadratic” (relies on the hardness of solving systems of quadratic equations); it is also code-based, and uses the code-scrambling technique of McEliece (1978). However, in the new proposal, the errorcorrecting code is not ..."
Abstract
- Add to MetaCart
We describe a new trap-door (and PKC) proposal. The proposal is “multivariate quadratic” (relies on the hardness of solving systems of quadratic equations); it is also code-based, and uses the code-scrambling technique of McEliece (1978). However, in the new proposal, the errorcorrecting code
Improving the efficiency of Generalized Birthday Attacks against certain structured cryptosystems
- In WCC 2011, LNCS
, 2011
"... Abstract. Code-based cryptographic schemes are promising candidates for post-quantum cryptography since they are fast, require only basic arithmetic, and because their security is well understood. Due to their main drawback of large public key sizes, there have been many proposals on how to reduce t ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
code-based cryptosystems. For example, this improves the best attack against QD-CFS (with n = 30924) and FSB512 by a factor of 180 and 1984, respectively. In general, for a parity-check matrix of size r×n, the improvement is a factor of r, which is typically in the order of 28 to 212.
A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems
, 2014
"... We give a polynomial time attack on the McEliece public key cryptosystem based on algebraic geometry codes. Roughly speaking, this attacks runs in O(n4) operations in Fq, where n denotes the code length. Compared to previous attacks, allows to recover a decoding algorithm for the public key even for ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
We give a polynomial time attack on the McEliece public key cryptosystem based on algebraic geometry codes. Roughly speaking, this attacks runs in O(n4) operations in Fq, where n denotes the code length. Compared to previous attacks, allows to recover a decoding algorithm for the public key even
On Private-Key Cryptosystems Based on Product Codes
"... . Recently J. and R.M. Campello de Souza proposed a private-key encryption scheme based on the product codes with the capability of correcting a special type of structured errors. In this paper, we show that J. and R.M. Campello de Souza's scheme is insecure against chosen-plaintext attacks, an ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
. Recently J. and R.M. Campello de Souza proposed a private-key encryption scheme based on the product codes with the capability of correcting a special type of structured errors. In this paper, we show that J. and R.M. Campello de Souza's scheme is insecure against chosen-plaintext attacks
Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Special Issues of Mathematics in Computer Science
, 2010
"... Abstract. We cryptanalyse here two variants of the McEliece cryptosystem based on quasi-cyclic codes. Both aim at reducing the key size by restricting the public and secret generator matrices to be in quasi-cyclic form. The first variant considers subcodes of a primitive BCH code. The aforementioned ..."
Abstract
-
Cited by 17 (3 self)
- Add to MetaCart
attacks working for McEliece type cryptosystems based on low density parity-check codes by choosing in the McEliece scheme more general one-to-one mappings than permutation matrices. We suggest here a structural attack exploiting the quasi-cyclic structure of the code and a certain weakness in the choice
On the Usage of LDPC Codes in the McEliece Cryptosystem
"... Abstract—In this paper, a new variant of the McEliece cryptosystem, based on Low-Density Parity-Check (LDPC) codes, is studied. Random-based techniques allow to design large families of LDPC codes with equivalent error correction capability; therefore, in principle, such codes can substitute Goppa c ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract—In this paper, a new variant of the McEliece cryptosystem, based on Low-Density Parity-Check (LDPC) codes, is studied. Random-based techniques allow to design large families of LDPC codes with equivalent error correction capability; therefore, in principle, such codes can substitute Goppa
Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel
"... Abstract — This manuscript proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In fact, our main goal is to achieve secure and rel ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract — This manuscript proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In fact, our main goal is to achieve secure
Attacking Code-Based Cryptosystems with Information Set Decoding using Special-Purpose Hardware
"... Abstract. In this work, we describe the first implementation of an in-formation set decoding (ISD) attack against code-based cryptosystems like McEliece or Niederreiter using special-purpose hardware. We show that in contrast to other ISD attacks due to Lee and Brickel [7], Leon [8], Stern [15] and ..."
Abstract
- Add to MetaCart
Abstract. In this work, we describe the first implementation of an in-formation set decoding (ISD) attack against code-based cryptosystems like McEliece or Niederreiter using special-purpose hardware. We show that in contrast to other ISD attacks due to Lee and Brickel [7], Leon [8], Stern [15
Results 1 - 10
of
71
