login

Randomness in cryptography

IEEE Security & PrivacyPublished 1 March 2006
Rosario Gennaro
Citations56
SJR quartileQ1
SJR score0.43
SNIP1.10

TL;DR

Some basic uses of randomness in cryptography are looked at and the process of securely generating randomness is reviewed.

Abstract

Although more formal definitions of randomness exist, a colloquial one will suffice here: a random process is one whose consequences are unknown. Intuitively, this is why randomness is crucial in cryptographic applications - because it provides a way to create information that an adversary can't learn or predict. It's then the task of a good protocol designer to leverage this power in the best possible way to protect data and communication. In this paper, we'll look at some basic uses of randomness in cryptography and briefly review the process of securely generating randomness

Keywords

Computer Science