Home > Search
Found 3414 Results
Good cryptography requires good random numbers. This paper evaluates the hardware-based Intel Random Number Generator (RNG) for use in cryptographic applications. Almost all cryptographic protocols require the generation and use of secret values that must be unknown to attackers. For example, random number generators are required to generate public/private keypairs for asymmetric (public key) […]
Abstract: Cryptosystem designers frequently assume that secrets will be manipulated in closed, reliable computing environments. Unfortunately, actual computers and microchips leak information about the operations they process. This paper examines specfic methods for analyzing power consumption measurements to and secret keys from tamper resistant devices. We also discuss approaches for building cryptosystems that can […]
As part of Cryptography Research’s ongoing cryptosystem research activities, we have been analyzing how to improve security of portable cryptographic tokens, including smart cards. Over the past year and a half, we have been working with the smart card vendor community to address attacks we have developed including Simple Power Analysis, Differential Power Analysis, […]
An academic paper introducing timing attack cryptanalysis. Many elements of timing attacks are relevant to DPA. Abstract: By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed Diffe-Hellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally […]