Sciweavers

CHES
1999
Springer
104views Cryptology» more  CHES 1999»
14 years 3 months ago
A Scalable Architecture for Montgomery Multiplication
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...
Alexandre F. Tenca, Çetin Kaya Koç
CHES
1999
Springer
91views Cryptology» more  CHES 1999»
14 years 3 months ago
A High-Performance Flexible Architecture for Cryptography
Cryptographic algorithms are more efficiently implemented in custom hardware than in software running on general-purpose processors. However, systems which use hardware implementat...
R. Reed Taylor, Seth Copen Goldstein
CHES
1999
Springer
140views Cryptology» more  CHES 1999»
14 years 3 months ago
Power Analysis Attacks of Modular Exponentiation in Smartcards
Abstract. Three new types of power analysis attacks against smartcard implementations of modular exponentiation algorithms are described. The first attack requires an adversary to ...
Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sl...
CHES
1999
Springer
75views Cryptology» more  CHES 1999»
14 years 3 months ago
Efficient Finite Field Basis Conversion Involving Dual Bases
Burton S. Kaliski Jr., Moses Liskov
CHES
1999
Springer
99views Cryptology» more  CHES 1999»
14 years 3 months ago
Probing Attacks on Tamper-Resistant Devices
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...
Helena Handschuh, Pascal Paillier, Jacques Stern
CHES
1999
Springer
133views Cryptology» more  CHES 1999»
14 years 3 months ago
Random Number Generators Founded on Signal and Information Theory
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...
David Paul Maher, Robert J. Rance