Home > Search
Found 3458 Results
Randomness is required for a variety of computational, statistical, and security-related applications. In particular, random numbers and the processes used to generate them are a critical component of secure protocols and cryptographic key generation. Security processes that lack adequate sources of randomness will have poor security. Cryptography Research has evaluated the C3 Nehemiah random number […]
Paul Kocher’s presentation at the General Session of the 2003 RSA Conference. Download “Securing Unusually High Threat Systems – RSA 2003”
Despite the high public profile of piracy as a threat to intellectual property owners, surprisingly little useful research has been done to understand the range of technical solutions that are feasible. This paper presents results from a study sponsored by Cryptography Research, Inc. to determine how cryptographic systems can provide the most effective long-term […]
Paul Kocher’s presentation at the Hackers and Threats track of the 2002 RSA Conference. Download “Hacking Cryptosystems – RSA 2002”
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 […]