Networking / Beginners

Asymmetric Encryption Algorithms

This class of algorithms employs a different key for encryption and decryption. Furthermore, the decryption key cannot be derived from the encryption key. This type of algorithm is also referred to as a "public-private key-based algorithm." The public portion of the name stems from the fact that the public key can be known by anybody (it's not a secret), but the private key portion should be a secret. The public and private keys are, however, mathematically related.

Algorithms that use asymmetric encryption are computationally more demanding than symmetric algorithms and as such are much slower in execution. The ease of distribution and management of the keys used for encryption and decryption are better than symmetric-based solutions. Some examples of asymmetric algorithms include Diffie-Hellman, ElGamal, and Merkle-Hellman Knapsack.

[Previous] [Contents] [Next]

In this tutorial:

  1. Securing Wireless Networks
  2. Security Background
  3. Security Services
  4. Cryptographic Concepts and Terms
  5. Encryption and Decryption
  6. Keyspace
  7. Exclusive OR (XOR)
  8. Algorithm
  9. Asymmetric Encryption Algorithms
  10. Public-Private Key Cryptography
  11. Cipher
  12. Concealment Ciphers vs. Running Key Ciphers
  13. Stream Ciphers vs. Block Ciphers
  14. Cipher Examples
  15. Cipher Implementations
  16. Wi-Fi Protected Access
  17. TKIP/WPA
  18. Wi-Fi Protected Access 2 (WPA2)
  19. CCMP/AES
  20. Hash Functions
  21. EAP
  22. EAP Entities
  23. EAP Grammar
  24. EAP Types
  25. EAP-TTLS
  26. EAP-PSK
  27. EAP-SIM
  28. EAP-AKA
  29. IEEE 802.11i
  30. Four-Way Handshake
  31. IEEE 802.11i Considerations