CRYPTO
1999
Springer
14 years 27 days ago
1999
Springer
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
CHES
1999
Springer
14 years 27 days 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...
CHES
1999
Springer
14 years 27 days ago
1999
Springer
Cryptographic algorithms are more efficiently implemented in custom hardware than in software running on general-purpose processors. However, systems which use hardware implementat...
CHES
1999
Springer
14 years 27 days ago
1999
Springer
CHES
1999
Springer
14 years 27 days 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 ...
CHES
1999
Springer
14 years 27 days ago
1999
Springer
CHES
1999
Springer
14 years 27 days 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...
CHES
1999
Springer
14 years 27 days ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
ASIACRYPT
1999
Springer
14 years 27 days 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...
ASIACRYPT
1999
Springer
14 years 27 days ago
1999
Springer