A method for finding codewords of small weight

Stern, Jacques

doi:10.1007/bfb0019850

Cited by 353 publications

(261 citation statements)

References 1 publication

Supporting

Mentioning

257

Contrasting

Unclassified

Order By: Relevance

“…Then, we construct a generator matrix G which describes all possible state variables that result in a collision for this linearized version. By searching for low-weight codewords(see [3,10,16]) in the linear code described by G, we are actually searching for L-characteristics with high probability.…”

Section: Extending the Rijmen-oswald Approach To Unmodified Sha-256mentioning

confidence: 99%

Analysis of Step-Reduced SHA-256

Mendel

Pramstaller

Rechberger

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This is the first article analyzing the security of SHA-256 against fast collision search which considers the recent attacks by Wang et al. We show the limits of applying techniques known so far to SHA-256. Next we introduce a new type of perturbation vector which circumvents the identified limits. This new technique is then applied to the unmodified SHA-256. Exploiting the combination of Boolean functions and modular addition together with the newly developed technique allows us to derive collision-producing characteristics for step-reduced SHA-256, which was not possible before. Although our results do not threaten the security of SHA-256, we show that the low probability of a single local collision may give rise to a false sense of security.

show abstract

Section: Extending the Rijmen-oswald Approach To Unmodified Sha-256mentioning

confidence: 99%

Analysis of Step-Reduced SHA-256

Mendel

Pramstaller

Rechberger

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The first assumption is enforced by complexity theory results [3,2,16], and by extensive research on general purpose decoders [7,18,4]. The second assumption received less attention.…”

Section: A Brief Description Of Mceliece's and Niederreiter's Schemesmentioning

confidence: 99%

How to Achieve a McEliece-Based Digital Signature Scheme

Courtois

Finiasz

Sendrier

2001

Lecture Notes in Computer Science

301

256

View full text Add to dashboard Cite

Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. It is widely believed that code-based cryptosystems like McEliece do not allow practical digital signatures. In the present paper we disprove this belief and show a way to build a practical signature scheme based on coding theory. Its security can be reduced in the random oracle model to the well-known syndrome decoding problem and the distinguishability of permuted binary Goppa codes from a random code. For example we propose a scheme with signatures of 81-bits and a binary security workfactor of 2 83 .

show abstract

“…Many algorithms solving this problem were developed (e.g. [39,58,13,14,15,23].) Finally, a general lower-bound on the complexity of the information set decoding algorithm was derived by Finiasz and Sendrier [23] using idealized algorithms.…”

Section: Problem 12 (Minimum Distance Problem (Mdp)mentioning

confidence: 99%

HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Duc

Vaudenay

2013

Progress in Cryptology – AFRICACRYPT 2013

View full text Add to dashboard Cite

Abstract. We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with Noise problem (LPN) and the decisional minimum distance problem. We show that the resulting cryptosystem achieves indistinguishability under chosen plaintext attacks (IND-CPA security). Using the FujisakiOkamoto generic construction, HELEN achieves IND-CCA security in the random oracle model. Our cryptosystem looks like the Alekhnovich cryptosystem. However, we carefully study its complexity and we further propose concrete optimized parameters.

show abstract

A method for finding codewords of small weight

Cited by 353 publications

References 1 publication

Analysis of Step-Reduced SHA-256

Analysis of Step-Reduced SHA-256

How to Achieve a McEliece-Based Digital Signature Scheme

HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Contact Info

Product

Resources

About