5372 search results - page 189 / 1075 » complexity 2007 |
EUROCRYPT
2007
Springer
13 years 12 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
ISCAS
2007
IEEE
14 years 2 months ago
2007
IEEE
— A method is presented to synthesize wideband linear-phase FIR filters with a piecewise-polynomial-sinusoidal impulse response. The proposed method is based on merging the earl...
CISC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
EJC
2010
13 years 8 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...