See this document in CiteSeerX!

Unknown  (Make Corrections)  
Spring Cryptography Part Spring 1998 Cryptography (Part I) Christos Papadimkriou Scribe: Brent Chun 1...



  Home/Search   Context   Related

 
View or download:
berkeley.edu/~christos/cs270...lec18.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/~christos/cs270/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: with k. The security of the one-time pad rests on (i) being able to generate truly random numbers and (ii) never reusing any of the bits of the pad, hence the name one-time pad. Perhaps the most popular technique that is in use today is public-key cryptography. In this approach, originally proposed by Diffie and Hellman, Alice and Bob each have a public and private key. Public keys are well-known and made available to the public. Private keys are held by their owners and kept secret. When... (Update)

Similar documents based on text:   More   All
0.7:   On the Secret-Key Rate of Binary Random Variables - Exte Nd Ed   (Correct)
0.7:   Private Quantum Channels - Ambainis, Mosca, Tapp, de Wolf (2000)   (Correct)
0.7:   Generalized Privacy Amplification - Bennett, Brassard, Crépeau.. (1995)   (Correct)

BibTeX entry:   (Update)

@misc{ part-unknown,
  author = "Spring Cryptography Part",
  title = "Unknown",
  url = "citeseer.ist.psu.edu/517817.html" }
Citations not processed or no citations identified.

Documents on the same site (http://www.cs.berkeley.edu/~christos/cs270/):   More
CS270 Lecture Notes Approximation Algorithms - Professor Christos Papadimitriou   (Correct)
. History of DES - Note Much Of   (Correct)
Satisfiability for ATPG: Is it easy? - Chong, Prasad (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC