Metadata-Version: 2.4
Name: master-of-secrets
Version: 0.1.0
Summary: Cryptographically secure Password Generator
Project-URL: Homepage, https://github.com/thelazybastard/the-master-of-secrets
Project-URL: Issues, https://github.com/thelazybastard/the-master-of-secrets/issues
Author-email: thelazybastard <0q2m4o1uq@mozmail.com>
License: MIT
License-File: LICENSE
Keywords: cli,cryptography,generator,password,security
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.9
Classifier: Programming Language :: Python :: 3.10
Classifier: Programming Language :: Python :: 3.11
Classifier: Programming Language :: Python :: 3.12
Classifier: Topic :: Security
Classifier: Topic :: Utilities
Requires-Python: >=3.9
Requires-Dist: numpy
Requires-Dist: scipy
Description-Content-Type: text/markdown

# The Master of Secrets - Password Generator

A Python-based secure password generator that creates strong 20-character passwords and calculates their cryptographic strength.

## Features

- Uses Python's `secrets` module for cryptographically strong random passwords
- Passwords include uppercase letters, lowercase letters, digits, and special characters
- Computes the Shannon entropy of generated passwords to measure randomness
- Estimates how long it would take to crack the password (assuming 1 billion guesses per second)

## Requirements

- Python 3.9 (minimum)
- NumPy
- SciPy

## Installation

Install the required dependencies:

```bash
pip install numpy scipy
```

## Usage

Run the script:

```bash
python password_generator.py
```

When prompted, type "Yes" to generate a password or "No" to exit:

```
Greetings, The Master of Secrets is at your service!
Would you like to know a secret? (Yes/No): Yes
```

Example output:

```
Password: K9#mP$2xL@4rT&8vN!1q
Estimated crack time: 3.27e+02 years
```

## How It Works

1. Creates a 20-character password using a combination of ASCII letters, digits, and punctuation marks
2. Analyzes the character distribution in the password to calculate its Shannon entropy
3. Estimates the time required to crack the password based on the entropy, assuming an attacker can make 1 billion guesses per second

## Note

The crack time estimation is based on the character distribution entropy of the specific generated password, not the theoretical password space. For a truly random 20-character password from the full character set, the theoretical entropy would be higher.

## Author

Monish Giani (thelazybastard)


## License

MIT Licence 