A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack.
There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to...
A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a ran...
Written by the inventors, Raptor Codes, provides a complete introduction to the theory, design and practical implementation of a class of codes that provide a lot of practical value to a large variety of data communication applications. They find applications in all types of data transmission, including those using the TCP and UDP protocols; multipoint-to-point; point-to-multipoint and multipoint-to-multipoint. The codes are so efficient and practical that two classes of them (R10 and RaptorQ) have been adopted widely by a number of standards bodies and are used in a variety of standards....
Written by the inventors, Raptor Codes, provides a complete introduction to the theory, design and practical implementation of a class of codes that p...
