nelsbrock/fingerprunk
1
0
Fork 0
mirror of https://github.com/nelsbrock/fingerprunk.git synced 2026-08-14 16:12:08 +02:00
Code Issues Packages Projects Releases Wiki Activity

fix README.md

Browse Source
This commit is contained in:
nelsbrock
2025-10-23 23:43:16 +02:00
parent 4388ae2c5c
commit bbc17385a7
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
+4 -3
View File
@@ -13,8 +13,9 @@ cargo install fingerprunk
## Usage ## Usage
Let's say you want to find keys whose fingerprints begin with `C0FFEE` and store them `secret.asc`. Let's say you want to find keys whose fingerprints begin with `C0FFEE` and store them
The regex for this is `^C0FFEE`. Now, simply use the following command to start the search: at `secret.asc`. The regex for this is `^C0FFEE`. Now, simply use the following command to start
the search:
```sh ```sh
fingerprunk -r '^C0FFEE' >> secret.asc fingerprunk -r '^C0FFEE' >> secret.asc
@@ -49,7 +50,7 @@ Also see <https://en.wikipedia.org/wiki/Hexspeak> for some further examples of "
### How long does it take? ### How long does it take?
On my machine with an AMD Ryzen 7 5800X Processor, Fingerprunk is able to generate and check about On my machine with an AMD Ryzen 7 5800X processor, Fingerprunk is able to generate and check about
43300 keys per second. This means that for finding a fingerprint with a string of *n* specific 43300 keys per second. This means that for finding a fingerprint with a string of *n* specific
hexadecimal digits at a specific place, I could expect the following runtimes until finding the hexadecimal digits at a specific place, I could expect the following runtimes until finding the
first key: first key: