CS 70 Discrete Mathematics and Probability Theory Summer 2014
نویسنده
چکیده
In this note, we discuss a very nice and important application of modular arithmetic: the RSA public-key cryptosystem, named after its inventors Ronald Rivest, Adi Shamir and Leonard Adleman. Cryptography is an ancient subject that really blossomed into its modern form at the same time1 as the other great revolutions in the general fields of information science/engineering. The basic setting for basic cryptography is typically described via a cast of three characters: Alice and Bob, who with to communicate confidentially over some (insecure) link, and Eve, an eavesdropper who is listening in and trying to discover what they are saying.
منابع مشابه
CS 70 Discrete Mathematics for CS Spring 2007 Luca Trevisan Lectures
Suppose we have a random variable X (it is helpful to think of the example of the random variable X that is +1 with probability 1/2 and −1 with probability 1/2) of finite expectation and finite variance, that describes the outcome of a certain process. Suppose we repeat the process several times independently, and so have random variables X1, . . . ,Xn, . . . that are mutually independent and h...
متن کاملIntegrable probability: From representation theory to Macdonald processes
These are lecture notes for a mini-course given at the Cornell Probability Summer School in July 2013. Topics include lozenge tilings of polygons and their representation theoretic interpretation, the (q, t)-deformation of those leading to the Macdonald processes, nearest neighbor dynamics on Macdonald processes, their limit to semi-discrete Brownian polymers, and large time asymptotic analysis...
متن کاملCS 70 Discrete Mathematics and Probability Theory Fall 2009
But in real life many quantities that we wish to model probabilistically are real-valued; examples include the position of a particle in a box, the time at which an certain incident happens, or the direction of travel of a meteorite. In this lecture, we discuss how to extend the concepts we’ve seen in the discrete setting to this continuous setting. As we shall see, everything translates in a n...
متن کاملEECS 70 Discrete Mathematics and Probability Theory Fall 2014
Fall 2014 Anant Sahai Discussion 8W-S 1. Probability Space Consider the drawing of the probability space S below. Here, the blue/purple region is the set of events B, the red/purple/orange region is the set of events R, and the yellow/orange region is the set of events Y . The set of events P is the set of events in both B and R, and is represented by the purple region. The set of events O is t...
متن کاملCS 70 Discrete Mathematics for CS Spring 2008
In the next major topic of the course, we will be looking at probability. Suppose you toss a fair coin a thousand times. How likely is it that you get exactly 500 heads? And what about 1000 heads? It turns out that the chances of 500 heads are roughly 5%, whereas the chances of 1000 heads are so infinitesimally small that we may as well say that it is impossible. But before you can learn to com...
متن کامل