Three Types of Randomness

Raczkowski, Adam

Three types of randomness are integral to the strength of public-key cryptography. With the techniques of Allender et al., we present an analysis of how the ability to quickly distinguish Kolmogorov randomness allows for a probabilistic attack on two of the conjectured hard problems underlying public-key cryptography: the discrete logarithm and factoring. Specifically, Kolmogorov random strings ar... read more

This object is in collection:
Undergraduate honors theses
Department of Computer Science
Permanent URL
ID: tufts:UA005.036.001.00001
To Cite: DCA Citation Guide
Usage: Detailed Rights