Skip to main content

How Django stores passwords

 

Django Password



Django provides a flexible password storage system and uses PBKDF2 by default. Django saves the password as below.

<algorithm>$<iterations>$<salt>$<hash>

example of a Hashed password stored in database:

pbkdf2_sha256$390000$LCm33kvO7rbjbZhwJA90Sf$xfuGOzl/MJyUxqWNhsNdSThaQUvn1EjEfxZ48HA8HF4=

Those are the components used for storing a User’s password,separated by the dollar-sign character and consist of: 

1. The hashing algorithm

2. The number of algorithm iterations (work factor)

3. The random salt

4. The resulting password hash. 



Most password hashes include a salt along with their password hash in order to protect against rainbow table attacks.

Example of Making Hashed password:



Here’s a simplified overview of how Django handles password storage:


  1. 1. Password Creation or Change:

    • # When someone creates a new account or decides to change their password, Django takes their chosen password and performs a process called hashing. Hashing is like scrambling the password into a format that is hard to reverse.

    • # To add an extra layer of security, Django also generates a random value called a "salt." This salt is mixed with the password before hashing. Think of it like adding a secret ingredient to a recipe.

  2. 2. Storing the Password:

    • # After hashing the password with the salt, Django saves both the resulting scrambled password (technically called a hash) and the salt into the database. It's like putting the locked recipe (hash) and the secret ingredient (salt) into a safe (database) for later use.

  3. 3. Logging In:

    • # When a user wants to log in, they provide their username and password.

    • # Django looks up the stored hash and salt associated with that username from the database.

  4. 4. Verifying the Password:

    • # Django then takes the password provided during login and repeats the hashing process using the stored salt.

    • # If the result of this process matches the stored hash, it means the provided password is correct. It's like recreating the locked recipe using the same secret ingredient. If the recreated recipe matches the one stored in the safe, Django lets the user in.

This process ensures that user passwords are stored securely and cannot be easily compromised, even if an attacker gains access to the database.

# Why django uses 'random' salt beside 'one' salt string?

Because if you would have one salt you could generate rainbow tables attack for your database easier than when there are random salts. 

If you would like to generate rainbow tables to decrypt django hashes you would have to generate tables for each different salt in database. Generating of rainbow tables take very long time, it's just brute force or dictionary attack.


By default, Django uses the PBKDF2 algorithm with a SHA256 hash, a password stretching mechanism recommended by NIST. This should be sufficient for most users: it’s quite secure, requiring massive amounts of computing time to break.

If anyone need to use different password Hashing Algorithm then it's flexible to do in django. 

# How to use different Password Hashing Algorithm ? 


Django chooses the algorithm to use by consulting the PASSWORD_HASHERS in settings.py. 

This is a list of hashing algorithm classes that this Django installation supports. For storing passwords, Django will use the first hasher in PASSWORD_HASHERS. To store new passwords with a different algorithm, put your preferred algorithm first in PASSWORD_HASHERS.

PASSWORD_HASHERS = [
    "django.contrib.auth.hashers.PBKDF2PasswordHasher",
    "django.contrib.auth.hashers.PBKDF2SHA1PasswordHasher",
    "django.contrib.auth.hashers.Argon2PasswordHasher",               "django.contrib.auth.hashers.BCryptSHA256PasswordHasher",
    "django.contrib.auth.hashers.ScryptPasswordHasher",
]


For verifying passwords, Django will find the hasher in the list that matches the algorithm name in the stored password. If a stored password names an algorithm not found in PASSWORD_HASHERS, trying to verify it will raise ValueError.


All references are taken from Django official doc 


Author:

Mahfujul Hasan
Software Engineer

linkedIn: https://www.linkedin.com/in/shojibhasan/ 

Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

Implementing Advance Query Optimization in Django ORM

 Django's ORM makes database interactions seamless, allowing developers to write queries in Python without raw SQL. However, as applications scale, inefficient queries can slow down performance, leading to high latency and database load.  This guide explores advanced query optimization techniques in Django ORM to go beyond basic CRUD (Create, Read, Update, Delete) operations and improve efficiency.  1. Use QuerySet Caching to Avoid Repeated Queries Using cache reduces redundant queries for frequently accessed data. Caching helps reduce repeated database hits. 2. Avoid .count() on Large Datasets Using .count() on large tables can be expensive Inefficient way: Optimized way ( .exists() is Faster) 3. Use Indexes for Faster Lookups Indexes speed up queries on frequently filtered fields. Add db_index=True for frequently queried fields: 4. Optimize Bulk Inserts and Updated Performing operations on multiple records one by one is inefficient. Use bulk_create() for mass insert...
Post a Comment
Read more

Database Indexing in Django application

  Database Indexing Database indexing is a technique used to optimize the performance of database queries by allowing the database management system (DBMS) to quickly locate and retrieve specific rows of data. Indexes are data structures that provide a faster way to look up records based on the values stored in one or more columns of a table. When you create an index on a table, the DBMS creates a separate data structure that maps the values in the indexed columns to the corresponding rows in the table. Default Type of Index is B-Tree Index ( The king of all indexes) বইতে কোন টপিক খুজতে গেলে আমরা টেবিল অফ কনটেন্ট থেকে দেখি এই টপিক কত নম্বর পেজে আছে।যাতে করে আমাদের পুরো বই খুজতে না হয়। ডেটাবেজ ইনডেক্সিং ও তেমনই একটা ইফিসিয়েন্ট টেকনিক।ডেটাবেজে কোন ডেটাকে দ্রুত খুজে বের করার জন্য ইনডেক্সিং করা লাগে।যদি এমন হয় একটা কুয়েরি বার বার এক্সিকিউট করতে হচ্ছে এবং একটা কলাম থেকে ভ্যালু বার বার খুজতে হচ্ছে তখন আমরা সেই কলামে ইনডেক্সিং করতে পারি।এর মাধ্যমে কোন ডেটা দ্রুত রিট্রাইভ করা যায়।কিন্তু ই...
Post a Comment
Read more

Django select_related and prefetch_related

  Difference between select_related and prefetch_related Reducing SQL queries is one of the first steps when optimizing a Django project. There are two powerful methods included in the Django ORM to help us that can boost performance by creating a single more complex QuerySet rather than multiple, smaller queries. In this project we will understand about  select_related and prefetch_related.  Django use these two orm method to reduce sql queries in database based on different scenario.  select_related Lets assume  this two model we have.  class Author ( models . Model ): name = models . CharField ( max_length = 200 ) def __str__ ( self ): return self . name class Courses ( models . Model ): name = models . CharField ( max_length = 200 ) author = models . ForeignKey ( Author , on_delete = models . CASCADE , related_name = 'courses' ) def __str__ ( self ): return self . name Here we have two mode. ...
Post a Comment
Read more