898 search results - page 138 / 180 » An Analysis of Permutations in Arrays |
167
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Recently, a large number of methods for the analysis of microarray data have been proposed but there are few comparisons of their relative performances. By using so-ca...
153
click to vote
TCC
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
152
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
156
click to vote
ACNS
2008
Springer
16 years 19 days ago
2008
Springer
In this paper, we present an analysis of the CCM mode of operations and of a slight variant. CCM is a simple and efficient encryption scheme which combines a CBC-MAC authentication...
161
click to vote
EUROCRYPT
2007
Springer
16 years 13 days ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...