2 Definition of Public-key Encryption


    Last lecture we studied in great detail the notion of pseudorandom generators (PRG), a deterministic functions that stretch randomness by any polynomial amount: from k to p(k) bits. As we already indicated, PRG's have a lot of applications including constructions of both public-and private-key encryptions, and implementation of " ideal randomness " in… (More)


    Figures and Tables

    Sorry, we couldn't extract any figures or tables for this paper.

    Slides referencing similar topics