HAL: inria-00607767, version 1

See detailed view

BibTeX,EndNote,... BibTeX - EndNote - TEI - RefWorks -

WCC 2011 - Workshop on coding and cryptography, Paris : France (2011)

Improving the efficiency of Generalized Birthday Attacks against certain structured cryptosystems

Robert Niebuhr 1, Pierre-Louis Cayrel 2, Johannes Buchmann 1, 2

(2011-04)

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 the key sizes. Many of these use highly structured matrices which can be stored more efficiently. In this paper, we show how a broad class of such structures can be exploited to increase the time and memory efficiency of a Generalized Birthday Attack (GBA), which is one of the best generic attacks against 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.

1:	Technische Universitat Darmstadt Fachbereich Informatik
	Technische Universitat Darmstadt Fachbereich Informatik, Kryptographie und Computeralgebra
2:	CASED { Center for Advanced Security Research Darmstadt
	CASED { Center for Advanced Security Research Darmstadt

Domain

:

Computer Science/Cryptography and Security Computer Science/Discrete Mathematics Computer Science/Information Theory and Coding Mathematics/Information Theory

Keywords: Generalized Birthday Attack – quasi-cyclic – quasi-dyadic – codes – post quantum – cryptography.

inria-00607767, version 1

http://hal.inria.fr/inria-00607767

oai:hal.inria.fr:inria-00607767

From: Assia Saadi <>

Submitted on: Monday, 11 July 2011 11:08:09

Updated on: Monday, 11 July 2011 11:13:48