Sciweavers

175 search results - page 1 / 35
» Improved Generalized Birthday Attack
Sort
View
IACR
2011
91views more  IACR 2011»
12 years 4 months ago
Improved Generalized Birthday Attack
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 find a nonzero codeword consisting of w length...
Paul Kirchner
ASIACRYPT
2009
Springer
13 years 11 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
BIRTHDAY
2012
Springer
12 years 15 days ago
Secret Key Leakage from Public Key Perturbation of DLP-Based Cryptosystems
Finding efficient countermeasures for cryptosystems against fault attacks is challenged by a constant discovery of flaws in designs. Even elements, such as public keys, that do no...
Alexandre Berzati, Cécile Canovas-Dumas, Lo...
INDOCRYPT
2009
Springer
13 years 11 months ago
FSBday
This paper applies generalized birthday attacks to the FSB compression function, and shows how to adapt the attacks so that they run in far less memory. In particular, this paper p...
Daniel J. Bernstein, Tanja Lange, Ruben Niederhage...
ICASSP
2008
IEEE
13 years 11 months ago
Generalized Improved Spread Spectrum watermarking robust against translation attacks
In this work, we consider the ISS (improved spread spectrum) watermarking [1] framework, and propose a generalized version of it, termed “Generalized Improved Spread Spectrum”...
Neslihan Gerek, Mehmet Kivanç Mihçak