Probabilistic polynomial time

From CRYPTUTOR

< Probabilistic polynomial time

The following pages link to here:

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

• User:Mikero
• PPT (redirect page)
  • IND-CPA security
  • SIM-CPA security
  • One-way function
  • Hardcore predicate
  • Private-Key Encryption using PRG and PRF
  • Pseudorandom function
  • Computational indistinguishability
  • Discrete logarithm assumption
  • Decisional Diffie-Hellman assumption
  • IND-CCA security
  • SIM-CCA security
  • Message authentication code
  • Collision resistant hash function
  • Universal one-way hash function
  • Digital signature scheme
  • Commitment scheme
  • Zero-knowledge proof
  • Next-bit unpredictable PRG
  • User:Mikero
  • Diffie-Hellman key exchange
  • Course:Introductory:Fall 2007
  • Course:Introductory:Fall 2007:Summary
  • Commitment Schemes
  • Course:Introductory:Fall 2009

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