52 search results - page 4 / 11 » How Fast can be Algebraic Attacks on Block Ciphers |
172
click to vote
BIRTHDAY
2012
Springer
14 years 1 months ago
2012
Springer
We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show t...
156
click to vote
EUROCRYPT
2006
Springer
15 years 9 months ago
2006
Springer
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebrai...
149
click to vote
EUROCRYPT
2003
Springer
15 years 11 months ago
2003
Springer
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
158
click to vote
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
156
click to vote
ICC
2009
IEEE
15 years 3 months ago
2009
IEEE
Cryptographic hash functions are often built on block ciphers in order to reduce the security of the hash to that of the cipher, and to minimize the hardware size. Proven secure co...