# Password Complexity, Hash Iterations and Entropy

DevFeed: [Password Complexity, Hash Iterations and Entropy](<https://devfeed.tech/articles/password-complexity-hash-iterations-and-entropy-5711.md>)

Original publisher: [Read original article](<https://neon.com/blog/password-complexity-hash-iterations-and-entropy>)

Author: Busra Demir

Published: 2024-05-21T14:56:51Z

Content type: article

Language: en

Sources: [Blog -- Neon Docs](<https://devfeed.tech/sources/blog-neon-docs.md>)

Topics: [passwords](<https://devfeed.tech/topics/passwords.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [attacks](<https://devfeed.tech/tags/attacks.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [latency](<https://devfeed.tech/tags/latency.md>), [passwords](<https://devfeed.tech/tags/passwords.md>), [performance](<https://devfeed.tech/tags/performance.md>), [random](<https://devfeed.tech/tags/random.md>), [security](<https://devfeed.tech/tags/security.md>)

## AI overview

The article examines whether SCRAM password-hashing iterations can be reduced from 4096 to one while preserving security through longer, randomly generated passwords. It explains the trade-off between hashing cost, brute-force resistance, CPU use, and connection latency.

## Source excerpt

Introduction Is it possible to safely reduce the number of SCRAM password hashing iterations from 4096 to just one? An engineer recently raised this question about our password generation to optimise CPU usage. Why? In Neon, every database is secured via a password. Verifying the...