172 search results - page 9 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
121
Voted
IACR
2011
13 years 11 months ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
104
click to vote
SIROCCO
1998
15 years 1 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
137
click to vote
ISCAS
2007
IEEE
15 years 6 months ago
2007
IEEE
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
93
Voted
IISWC
2006
IEEE
15 years 5 months ago
2006
IEEE
Workload characterization involves the understanding of the relationship between workload configurations and performance characteristics. To better assess the complexity of worklo...
ORL
2000
14 years 11 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...