264 search results - page 6 / 53 » On Linear Cryptanalysis with Many Linear Approximations |
112
click to vote
ASIACRYPT
2001
Springer
15 years 3 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
COMBINATORICS
2007
14 years 11 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
ICISC
2001
15 years 1 months ago
2001
Although many strong cryptanalytic tools exploit weaknesses in the data-randomizinig part of a block cipher, relatively few general tools for cryptanalyzing on the other part, the ...
108
click to vote
JMLR
2006
14 years 11 months ago
2006
The goal of active learning is to determine the locations of training input points so that the generalization error is minimized. We discuss the problem of active learning in line...
104
click to vote
ESANN
2004
15 years 1 months ago
2004
The one-dimensional functional equation g(y(t)) = cg(z(t)) with known functions y and z and constant c is considered. The indeterminacies are calculated, and an algorithm for appro...