Dale L. Sibborn

Learn More
Most modern cryptographic primitives are heavy consumers of randomness. These schemes are provably secure when uniform randomness is available. Random Number Generators (RNGs) often fail to provide high-quality randomness in practice due to poor design, insufficient entropy, bugs, etc. Randomness failures can be catastrophic. Motivation Our Contributions(More)
Inspired by cold boot attacks, Heninger and Shacham (Crypto 2009) initiated the study of the problem of how to recover an RSA private key from a noisy version of that key. They gave an algorithm for the case where some bits of the private key are known with certainty. Their ideas were extended by Henecka, May and Meurer (Crypto 2010) to produce an algorithm(More)
This paper revisits related randomness attacks against public key encryption schemes as introduced by Paterson, Schuldt and Sibborn (PKC 2014). We present a general transform achieving security for public key encryption in the related randomness setting using as input any secure public key encryption scheme in combination with an auxiliary-input(More)
In a cold boot attack a cryptosystem is compromised by analysing a noisy version of its internal state. For instance, if a computer is rebooted the memory contents are rarely fully reset; instead, after the reboot an adversary might recover a noisy image of the old memory contents and use it as a stepping stone for reconstructing secret keys. While such(More)
  • 1