x.509 Certificate in Network Security

 

x.509 Certificate 

An X.509 certificate is a standard digital certificate format used in network security to associate a public key with the identity of an entity such as user, server, or organization.

  • X.509 is defined by the ITU-T X.509 standard.
  • It is commonly used in secure communication protocols such as:
    • SSL/TLS
    • HTTPS
    • Secure Email
    • VPN
Purpose of X.509 Certificate

  • To authenticate users and servers.
  • To prevent the use of fake or malicious public keys.
  • To establish trust between communicating parties.
  • To support secure key exchange in public-key cryptography.

Without certificates, an attacker could provide a false public key and perform a Man-in-the-Middle (MITM) attack.

Issuing Process of X.509 Certificate
X.509 Public key certificate

  1. The user or server generates a public key and private key pair.
  2. The user sends the public key and identity information to the Registration Authority (RA).
  3. The RA verifies the identity of the user, organization, domain, or other entity.
  4. After successful verification, the RA forwards the certificate request to the Certificate Authority (CA).
  5. The CA creates the X.509 certificate.
  6. The CA digitally signs the certificate using its private key.
  7. The signed certificate is issued to the user or server. 

Structure of X.509 Certificate

Version                             

Serial Number                      

Signature Algorithm Identifier

Issuer Name                        

Validity Period                    

Subject Name                       

Subject Public Key Information     

Issuer Unique ID 

Subject Unique ID

Extensions   

 
1. Version
Specifies the version of the X.509 standard used by the certificate.

2. Serial Number
A unique number assigned by the Certificate Authority (CA) to identify the certificate.

3. Signature Algorithm Identifier
Specifies the algorithm used by the CA to digitally sign the certificate.

4. Issuer Name
Identifies the Certificate Authority (CA) that issued the certificate.

5. Validity Period
Specifies the start date and end date during which the certificate is valid.

6. Subject Name
Identifies the owner of the certificate, such as a user, server, or organization.

7. Subject Public Key Information
Contains the public key of the certificate owner along with the corresponding key algorithm information.

8. Issuer Unique ID
Provides a unique identifier for the issuer when required.

9. Subject Unique ID
Provides a unique identifier for the certificate subject when required.

10. Extensions
Contains additional information that can extend the functionality of the certificate.


Verification of X.509 Certificate
  • Checks the CA's digital signature.
  • Verifies the validity period of the certificate.
  • Confirms that the certificate has not been revoked.
  • Trusts the public key only when the required checks are successfully completed. 

Handwritten Notes-Download PDF
Video Explanation-Watch on YouTube

Comments

Post a Comment

Popular posts from this blog

B+ Tree in DBMS | B+ Tree in Data Structure

    B+  Tree A B+ Tree is a self-balancing multi-way search tree   All leaf nodes are present at the same level . Actual data records are stored only in the leaf nodes . Internal nodes contain only search keys . It is mainly used for efficient searching and sequential access . B+ Tree supports efficient range queries . Structure of B+ Tree Consider a B+ Tree node containing keys and children: Number of Keys Number of Children 1 2 2 3 3 4 In general, Number of children = Number of keys + 1 The leaf nodes are connected sequentially using links( Linked List ). Rules of B+ Tree For a B+ Tree of order m : At most: A node can have at most m children . A node can contain at most m − 1 keys. At least: An internal node must have at least [ m/2 ] children . An internal node must contain at least [ m/2 ] − 1 keys . Insertion...
Read more

Hashing in Data Structure | Collision Resolution Techniques | Hashing in DBMS

  Hashing in DBMS Hashing is a technique used to map data elements (keys) to specific locations in a hash table using a hash function. It allows insertion and retrieval of data efficiently     Hash Function A hash function converts a key into a hash code (index) , which is used to store and retrieve the data from a hash table.                                 h(k)=k mod m Where: k → Key m → Hash table size h(k) → Hash index  Hash Table A hash table is a data structure that stores data in an array format . Each position in the table is called a bucket , and the position is accessed using the hash function. Example Consider Keys                   (k) = 11, 18, 20, 25, 29, 33 Hash table size (m) = 7 Hash function:    h(k)=k mod m                     ...
Read more

Normalization in DBMS,(1NF,2NF,3NF,BCNF,4NF,5NF)

                      Normalization in DBMS Normalization divides a large table into smaller , logically related tables and connects them using appropriate keys. The main purpose of normalization is to reduce unnecessary duplication of data and prevent problems that may occur when data is inserted, updated, or deleted. 1. First Normal Form (1NF) A relation is said to be in First Normal Form (1NF) when every attribute contains a single, indivisible value . Conditions of   1 NF Each cell must contain only one value. Multiple values should not be stored in the same field. ·         Example Customer Items Purchased Gowsi Rice, Dal Tamil Soap ·   Here, the Items Purchased column contains more than one value for Gowsi . ·   Therefore, the table is not in 1 NF . Converting it into 1NF. ...
Read more