1379 search results - page 147 / 276 » The Complexity of the Annihilating Polynomial |
166
click to vote
CTRSA
2010
Springer
16 years 1 months ago
2010
Springer
At ches 2009, Coron, Joux, Kizhvatov, Naccache and Paillier (cjknp) exhibited a fault attack against rsa signatures with partially known messages. This attack allows factoring the ...
168
click to vote
CCGRID
2008
IEEE
16 years 28 days ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
179
click to vote
ICC
2007
IEEE
16 years 24 days ago
2007
IEEE
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
141
click to vote
CSL
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
149
click to vote
FSTTCS
2007
Springer
16 years 18 days ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...