Abstract

This research investigates the mathematical structure and entropy distribution patterns of 24-word mnemonic phrases generated under the BIP39 standard. While 256 bits of initial entropy provide strong theoretical security, improper random number generation and structural checksum couplings can introduce measurable statistical signatures.

Key Findings

  • Bit Distribution Variance: Evaluated how non-uniform PRNG outputs propagate into 11-bit word indices.
  • Checksum Boundary Constraints: Analyzed the 8-bit SHA-256 checksum suffix in 24-word mnemonics and its filtering properties during brute-force key-space reduction.
  • Verification: Permanently archived on CERN’s Zenodo repository with DOI registration.