OPEN SOURCE & STANDARDS LICENSING verified_user CRYPTOGRAPHIC PROVENANCE

Password & Passphrase Generator: Attributions & Licensing

Formal acknowledgment of cryptographic algorithms, curated wordlists, academic publications, open standards, and public-domain references utilized in the ToolAcre client-side password engine.

Wordlist Source Electronic Frontier Foundation

Licensing CC BY 3.0 US

Entropy Foundation Claude Shannon (1948)

CSPRNG Specification RFC 4086 / SP 800-90A

Verification Matrix

Cryptographic Provenance & Open Standards

AUDIT STATUS: 100% UNBUNDLED

menu_book

EFF Wordlists

Creative Commons Attribution 3.0

Official Electronic Frontier Foundation Deep Pockets & Long Wordlists systematically curated by Joseph Bonneau.

verified Permissive attribution tier

vpn_key

W3C WebCrypto API

W3C Recommendation

Standardized cryptographic primitives implemented natively in modern browser runtimes via operating-system entropy hooks.

check_circle Browser-native runtime

shuffle

RFC 4086 / BCP 106

IETF Security Guideline

"Randomness Requirements for Security" governing non-predictable hardware entropy collectors and sampling bias rejection.

shield Unbiased modulo reduction

terminal

Zero Proprietary Math

100% Open Standards

Every formula, word list, array mask, and bitwise mapping is inspectable in your browser inspector without minification traps.

code Verifiable in DevTools

calculate

Deterministic Information Density

Uniform random selection across $N = 7,776$ discrete dictionary tokens guarantees exact entropy distribution.

BITS PER TOKEN 12.9248125036...

COMBINATORIAL BASE 6⁵ = 7,776

Dictionary Heritage

Curated Wordlist Attributions & Licensing

PRIMARY DICTIONARY 7,776 ENTRIES

Electronic Frontier Foundation (EFF) Deep Pockets Wordlist

Curated by Joseph Bonneau and published by the EFF under the permissive Creative Commons Attribution 3.0 United States License (CC BY 3.0 US).

Design Rationale

Specially optimized for Diceware-style memorability. Contains exactly 7,776 words ($6^5$). Words are intentionally chosen for distinct typing cadences, clear audio comprehension, unique 3-character prefixes where possible, and systematic exclusion of homophones, obscure jargon, and offensive vocabulary.

Formal Citation:

Bonneau, J. & Electronic Frontier Foundation (2016). "EFF's New Wordlists for Random Passphrases".

lock_open CC BY 3.0 US License Compliant EFF Spec Archive open_in_new

ORIGINAL SPECIFICATION EST. 1995

The Original Diceware System by Arnold G. Reinhold

Conceived and engineered by Arnold G. Reinhold in Cambridge, Massachusetts. The method introduced physical entropy sampling through standard dice rolled against fixed lexicographical mappings.

Architectural Precedent

Reinhold's pioneering insight eliminated cryptographic reliance on closed hardware pseudo-generators, popularizing passphrases that resist automated brute-force while retaining human recallability. Diceware is a recognized descriptive concept across computer security curricula.

Trademark & Usage Notice:

"Diceware" is a trademark of Arnold G. Reinhold. The trademark is referenced here solely in a descriptive and historical context to accurately acknowledge the origin of physical-entropy passphrase generation.

history_edu Historical Standard Reinhold Archive open_in_new

developer_mode

Native Sampling Implementation (No modulo bias)

ECMAScript 2024 / RFC 4086 Compliant In-Memory Routine

// ToolAcre zero-bias rejection sampling implementation for 7,776-word lists
export function getRandomDicewareIndex(): number {
  const WORDLIST_SIZE = 7776;
  const LIMIT = Math.floor(0xFFFFFFFF / WORDLIST_SIZE) * WORDLIST_SIZE; // Rejection threshold
  const buffer = new Uint32Array(1);

  while (true) {
    window.crypto.getRandomValues(buffer);
    const candidate = buffer[0];
    // Reject entropy values outside uniform modulo domain to prevent statistical bias
    if (candidate < LIMIT) {
      return candidate % WORDLIST_SIZE;
    }
  }
}

Information Science

Mathematical & Theoretical Foundations

functions

Claude Shannon's Information Theory (1948)

In the seminal work "A Mathematical Theory of Communication" (Bell System Technical Journal, Vol. 27), Claude Shannon formulated the mathematical foundation of data entropy:

H = - ∑ p(x) × log&sub2(p(x))

Because ToolAcre draws uniformly at random from an indexed vocabulary of size $N = 7,776$, each chosen word represents an invariant state where $p_i = 1 / 7776$. The theoretical security yielded per selected word evaluates exactly to:

log&sub2(7776) = log&sub2(6&sup5) ≈ 12.92481 bits

check Guarantees 77.5 bits of raw entropy in a standard 6-word phrase

політика

NIST Special Publication 800-63B

The National Institute of Standards and Technology (NIST) Digital Identity Guidelines: Authentication and Lifecycle Management directly informs ToolAcre's password architecture.

Key Standard Directives:

Deprecates arbitrary complexity composition rules (e.g., forced casing + symbols).
Identifies raw length and high-entropy word combinations as superior resistance.
Eliminates arbitrary periodic expiration rituals that incentivize predictable patterns.

ToolAcre's defaults prioritize password lengths $\ge 16$ characters or passphrase lengths $\ge 5$ words to comfortably exceed modern credential stuffing resistance thresholds.

check Strictly aligned with federal guidance for authenticator secrets

verified

Zero-Dependency Client Architecture & Audit Trail

Zero Bundled Libs

ToolAcre does not bundle crypto-js, sjcl, or opaque third-party WebPack chunks. Zero network calls occur during key generation.

Pure Standard ES2024

Built purely atop standard crypto.getRandomValues() and native array manipulation routines supported across all modern Chromium, WebKit, and Gecko engines.

Immediate Local Audit

You can verify integrity by pressing F12, navigating to the Network tab, and inspecting generator executions offline.

Interactive Model

Shannon Entropy Simulator

Generation Type:

Phrase Length: 5 words 5 units

3 words Recommended: 5–7 words 10 words

ESTIMATED SHANNON ENTROPY STRONG

64.6 bits

Exceeds the 64-bit threshold necessary to withstand distributed GPU-accelerated hash clusters.

Native Verification Engine

Ready to generate cryptographically verifiable secrets?

Experience zero-latency client-side Diceware and high-entropy passwords with complete mathematical certainty and browser-native integrity.

key Launch Password Generator menu_book Read Entropy Guide