2967 search results - page 182 / 594 » Cryptology |
205
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
In order to avoid birthday attacks on message authentication schemes, it has been suggested that one add randomness to the scheme. One must be careful about how randomness is added...
172
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
168
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
200
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
160
click to vote
CHES
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. This paper describes a new type of attack on tamper-resistant cryptographic hardware. We show that by locally observing the value of a few RAM or adress bus bits (possibl...