This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Randomness in Cryptography
March/April 2006 (vol. 4 no. 2)
pp. 64-67
Rosario Gennaro, IBM T.J. Watson Research Center
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 installment of Crypto Corner, we'll look at some basic uses of randomness in cryptography and briefly review the process of securely generating randomness.
Index Terms:
randomness, predictable, cryptography, nonce
Citation:
Rosario Gennaro, "Randomness in Cryptography," IEEE Security & Privacy, vol. 4, no. 2, pp. 64-67, March-April 2006, doi:10.1109/MSP.2006.49
Usage of this product signifies your acceptance of the Terms of Use.