Computational indistinguishability

From CRYPTUTOR

< Computational indistinguishability

The following pages link to here:

View (previous 50) (next 50) (20 | 50 | 100 | 250 | 500).

• Course:Introductory:Fall 2006
• Pseudorandomness generator
• Hybrid argument
• Pseudorandom function
• Decisional Diffie-Hellman assumption
• Zero-knowledge proof
• Next-bit unpredictable PRG
• Equivalence of NBU PRG and PRG
• Pseudorandom (redirect page)
  • Hardcore predicate
  • Building a PRG
  • Private-Key Encryption using PRG and PRF
  • Elgamal encryption scheme
  • Decisional Diffie-Hellman assumption
  • Goldreich-Levin predicate
  • Diffie-Hellman key exchange
• User:Mikero
• Course:Introductory:Fall 2007
• Stream cipher
• Course:Introductory:Fall 2007:Summary
• Course:Introductory:Fall 2009

View (previous 50) (next 50) (20 | 50 | 100 | 250 | 500).