Sciweavers

532 search results - page 28 / 107
» New Results on the Complexity of the Middle Bit of Multiplic...
Sort
View
DATE
2002
IEEE
79views Hardware» more  DATE 2002»
14 years 2 months ago
Incremental Diagnosis and Correction of Multiple Faults and Errors
An incremental simulation-based approach to fault diagnosis and logic debugging is presented. During each iteration of the algorithm, a single suspicious location is identified a...
Andreas G. Veneris, Jiang Brandon Liu, Mandana Ami...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 9 months ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi
EUROCRYPT
2010
Springer
14 years 1 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
CMA
2010
183views more  CMA 2010»
13 years 5 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis
INDOCRYPT
2010
Springer
13 years 7 months ago
The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA
Abstract. In this paper we present a new statistical cryptanalytic technique that we call improbable differential cryptanalysis which uses a differential that is less probable when...
Cihangir Tezcan