Password Generator
Generate results with the Password Generator — set your parameters and get cryptographically-random output instantly.
Calculator
Adjust values & calculateFormula
Password entropy measures the unpredictability of your password. A larger character pool and longer length each multiply the entropy exponentially.
Last reviewed: December 2025
Worked Examples
Example 1: 16-char password with all character types
Background & Theory
The Password Generator is grounded in the established principles and formulas described below. Computers represent all information using binary, a base-2 number system consisting solely of the digits 0 and 1, each called a bit. Because long binary strings are unwieldy, programmers routinely use octal (base 8) and hexadecimal (base 16) as compact shorthand. Converting between bases follows a consistent algorithm: divide the source number repeatedly by the target base, collecting remainders in reverse order. Hexadecimal digits A through F represent the values 10 through 15, allowing a single character to encode four binary bits, making it the preferred notation for memory addresses, color codes, and bytecode. Bitwise operations manipulate individual bits within integers. AND produces a 1 only when both input bits are 1, making it useful for masking. OR produces a 1 when either bit is 1 and is used for combining flags. XOR flips bits that differ, enabling simple toggle logic and efficient swap algorithms. NOT inverts every bit (one's complement), while left and right shifts multiply or divide by powers of two in constant time. Data storage units ascend in binary multiples of 1024: 8 bits form one byte, 1024 bytes form one kibibyte (KiB), 1024 KiB form one mebibyte (MiB), and so forth. Hard-drive manufacturers historically use decimal prefixes (1 KB = 1000 bytes), creating the persistent confusion between binary and decimal interpretations of the same label. The IEC standardized the binary prefixes KiB, MiB, GiB, and TiB in 1998 to resolve this ambiguity. Network bandwidth is measured in bits per second (bps), most commonly megabits per second (Mbps) or gigabits per second (Gbps). A 100 Mbps connection transfers 100 million bits every second, equating to roughly 12.5 megabytes per second. IP subnet masks define network boundaries; CIDR notation appends a prefix length (e.g., /24) to an address, indicating how many leading bits are fixed. A /24 subnet contains 256 addresses with 254 usable hosts. Algorithm efficiency is described using Big-O notation, which characterises the worst-case growth of time or space relative to input size. O(1) is constant, O(log n) is logarithmic (binary search), O(n) is linear, and O(n²) is quadratic. Cryptographic hash functions like SHA-256 produce a fixed 256-bit (32-byte) digest regardless of input length. File compression algorithms exploit statistical redundancy to reduce storage footprint, and compression ratio equals the original file size divided by the compressed size.
History
The Password Generator builds on a long history of ideas and practice, traced below. The conceptual foundation of modern computing traces back to Charles Babbage, whose Analytical Engine design of 1837 introduced the idea of a general-purpose mechanical computer with separate storage and processing units, including what he called the Store and the Mill. Ada Lovelace wrote what many consider the first algorithm intended for machine execution while annotating a translation of Luigi Menabrea's account of Babbage's work, also recognising the machine's potential to manipulate symbols beyond mere numbers. George Boole published "The Laws of Thought" in 1854, formalising a two-valued algebra of logic that would later map perfectly to electrical circuits. It remained largely a mathematical curiosity until Claude Shannon's landmark 1937 master's thesis demonstrated that Boolean algebra could describe switching circuits, laying the theoretical groundwork for all digital electronics. Shannon's 1948 paper "A Mathematical Theory of Communication" defined the bit as the fundamental unit of information and established information theory as a rigorous discipline. The same year, the transistor was invented at Bell Labs by Bardeen, Brattain, and Shockley, eventually replacing vacuum tubes and enabling miniaturisation at scale. ENIAC, completed in 1945, was one of the first general-purpose electronic computers, occupying 1800 square feet and consuming 150 kilowatts of power while performing roughly 5000 additions per second. The ASCII standard was ratified in 1963, assigning 7-bit codes to 128 characters and enabling interoperability between computers from different manufacturers. Through the 1970s, the microprocessor consolidated an entire CPU onto a single chip; Intel's 4004 in 1971 marked the beginning of this trend. The Apple II launched in 1977 and the IBM PC in 1981 brought computing to homes and offices, triggering a mass-market software industry. Tim Berners-Lee proposed the World Wide Web in 1989 and launched the first website in 1991 at CERN, transforming the internet from an academic and military network into a global information infrastructure. Mobile computing accelerated through the 2000s with smartphones integrating powerful processors, wireless networking, and GPS into pocket-sized devices, extending computation into every facet of daily life and cementing TCP/IP as the universal communications fabric.
Frequently Asked Questions
Reviewed by Daniel Agrici, Founder & Lead Developer · Editorial policy
Password Generator Formula
Entropy = log2(pool_size^length)
Password entropy measures the unpredictability of your password. A larger character pool and longer length each multiply the entropy exponentially.
Password Generator — Worked Examples
Example 1: 16-char password with all character types
Problem:Length: 16, uppercase + lowercase + numbers + symbols enabled
Solution:Pool: 95 chars (26 uppercase + 26 lowercase + 10 digits + 33 symbols). Entropy = log2(95^16) ≈ 105 bits
Result:Extremely strong password — infeasible to brute-force with current hardware
Password Generator — Frequently Asked Questions
How secure is a randomly generated password?
A randomly generated password using cryptographic randomness (like the Web Crypto API) is extremely secure. Unlike human-chosen passwords, it has no patterns, dictionary words, or predictable sequences. Each character is independently random, making brute-force attacks computationally infeasible for passwords of sufficient length.
What makes a password strong?
Two factors dominate password strength: length and character variety. Length matters most — each additional character multiplies the number of possible combinations. Character variety expands the pool: using uppercase, lowercase, digits, and symbols increases the pool from 26 to 95 characters. A 16-character password using all four types has over 100 bits of entropy.
What is password entropy and how is it calculated?
Password entropy measures unpredictability in bits. It is calculated as: Entropy = log2(pool_size ^ length). For a 16-character password drawn from a 95-character pool (all character types), entropy = log2(95^16) ≈ 105 bits. Each additional bit doubles the difficulty to guess. NIST guidelines consider 80+ bits strong and 100+ bits very strong.
Should I use a password manager?
Yes. A password manager lets you use a unique, long, random password for every account without memorizing them. This prevents credential reuse attacks — the most common cause of account breaches. Store generated passwords in a reputable manager such as Bitwarden, 1Password, or KeePass rather than reusing simpler passwords.