Public Key Authentication

From Computing and Software Wiki

Revision as of 13:53, 5 April 2009 (view source) Larocqt (Talk) ← Older edit		Revision as of 13:58, 5 April 2009 (view source) Larocqt (Talk) Newer edit →
Line 48:		Line 48:
	==Public Key Algorithms==		==Public Key Algorithms==
-	* Primes	+	===Primes===
-	* Factoring	+	===Factoring===
	** RSA (Rivest-Shamir-Adleman) algorithm		** RSA (Rivest-Shamir-Adleman) algorithm
-	* Discrete Logarithms	+	===Discrete Logarithms===
	** DSA/DSS (Digital Signature Standard) algorithm		** DSA/DSS (Digital Signature Standard) algorithm
	** Diffie-Hellman algorithm		** Diffie-Hellman algorithm
-	* Lattices	+	===Lattices===
	==References==		==References==

---

Revision as of 13:58, 5 April 2009

Public key authentication, also known as asymmetric-key encryption is a cryptographic process that involves the generation of a key pair; a public key and a private key for encryption and decryption of messages, as well as the verification of a user's identity on a server. The private key is kept secret on the user's system who generated it, while the public key is distributed to any user or server with which the user wishes to communicate.

Messages are encrypted using the public key, and may only be decrypted by the corresponding private key. In this way, possession of the private key is required for the message to be read and third parties are prevented from intercepting the message. Similarly, the private key can generate unique signatures that could only have come from that specific private key. Using the matching public key a server can verify the signature provided and therefore the user's identity.

Contents 1 Background 1.1 Identity Verification Process 1.2 Message Encryption/Decryption Process 1.3 Physical World Equivalent 2 Benefits 2.1 Hacked Server 2.2 Brute Force Attacks 3 Drawbacks 4 Public Key Algorithms 4.1 Primes 4.2 Factoring 4.3 Discrete Logarithms 4.4 Lattices 5 References 6 See Also 7 External Links

Background

• briefly explain password-based/symmetric key authentication
• go in more detail on public key authentication

Identity Verification Process

• Generate a key pair on your computer
• Copy your public key to the server
• When authentication is required, a signature is generated using the private key
• Server uses the public key to verify the signature and grant access

Message Encryption/Decryption Process

• Generate a key pair on your computer
• Send your public key to the desired user you wish to communicate with
  • Recipient may generate their own key pair
• Sender uses the recipient's public key to encrypt the message and sends it
• Recipient uses their private key to decrypt the message

Physical World Equivalent

The process of message delivery in networking resembles the postal system of the physical world. Encryption of the messages themselves is like locking the parcel with a padlock. Using a symmetric key would involve a single padlock with each user possessing an identical copy of the key used to open that padlock.

Alternatively, the use of a public (asymmetric) key system is equivalent to each user purchasing their own key/padlock set and sending the padlock to the user with whom they wish to communicate. This second user would then use this received padlock to lock up any messages they wish to send. The first user then unlocks the padlock with the matching key that they remained in possession of the entire time.

Benefits

Hacked Server

One advantage the public key authentication possesses over those that are password-based is when the server has been hacked or spoofed. In systems that use symmetric keys for authentication, the attacker can learn your password and proceed to pose as you in the future. Alternatively, if a server using public key authentication is hacked the signature sent to the server would mean nothing to the attacker. Without the private key, the attacker cannot impersonate you.

Brute Force Attacks

While brute force attacks are still possible in public key authentication,

Drawbacks

• computational cost
  • explain uses of hybrids

Public Key Algorithms

Primes

Factoring

• • RSA (Rivest-Shamir-Adleman) algorithm

Discrete Logarithms

• • DSA/DSS (Digital Signature Standard) algorithm
  • Diffie-Hellman algorithm

Lattices

References

• [1] - Using Public Key Authentication
• [2] - Public Key Cryptography
• [3] - Public Key Cryptography
• [4] - Asymmetric Ciphers

See Also

External Links

• Public Key Encryption at HowStuffWorks.com

--larocqt 9:24 AM, 5 April 2009 (EDT)