Sciweavers

1383 search results - page 149 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
DCC
2002
IEEE
16 years 6 months ago
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
Jorge Guajardo, Christof Paar
CTRSA
2010
Springer
212views Cryptology» more  CTRSA 2010»
16 years 1 months ago
Fault Attacks Against emv Signatures
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 ...
Jean-Sébastien Coron, David Naccache, Mehdi...
CCGRID
2008
IEEE
16 years 28 days ago
Joint Communication and Computation Task Scheduling in Grids
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...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
ICC
2007
IEEE
16 years 24 days ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
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...
Richard M. Todd, J. R. Cruz
CSL
2007
Springer
16 years 19 days ago
Propositional Logic for Circuit Classes
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...
Klaus Aehlig, Arnold Beckmann