2967 search results - page 183 / 594 » Cryptology |
208
click to vote
CHES
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Three new types of power analysis attacks against smartcard implementations of modular exponentiation algorithms are described. The first attack requires an adversary to ...
172
click to vote
CHES
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. This paper describes the methodology and design of a scalable Montgomery multiplication module. There is no limitation on the maximum number of bits manipulated by the mu...
165
click to vote
EUROCRYPT
1999
Springer
15 years 11 months ago
1999
Springer
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
160
click to vote
EUROCRYPT
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
175
click to vote
EUROCRYPT
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...