Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

IACR
2011

favoriteEmaildiscussreport

91views more IACR 2011»

Improved Generalized Birthday Attack

12 years 4 months ago

Improved Generalized Birthday Attack

Download eprint.iacr.org

Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to ﬁnd a nonzero codeword consisting of w length-B blocks with Hamming weight k. This problem was mainly studied after 2002. Not being able to solve this problem is critical for cryptography as it gives a fast attack against FSB, SWIFFT and learning parity with noise. In this paper, the classical methods are used in the same algorithm and improved.

Paul Kirchner

Real-time Traffic

Classical Methods | Fr 2 | IACR 2011 | Linear Code |

claim paper

Related Content

» Security Bounds for the Design of CodeBased Cryptosystems

» Secret Key Leakage from Public Key Perturbation of DLPBased Cryptosystems

» Generalized Improved Spread Spectrum watermarking robust against translation attacks

» Improved SideChannel Collision Attacks on AES

» Statistical Disclosure Attacks

» An Improved FreeRoaming Mobile Agent Security Protocol against Colluded Truncation Attacks

» Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes

» Synthesis Revisited Generating Statechart Models from ScenarioBased Requirements

Post Info
More Details (n/a)

Added	23 Dec 2011
Updated	23 Dec 2011
Type	Journal
Year	2011
Where	IACR
Authors	Paul Kirchner

Comments (0)