Scribd Logo
Upload

Welcome to Scribd!

  • De Vazut

    Uploaded by

    Daniel Nae
    105 views2 pages
    This script searches for the private key corresponding to a known public key by brute force. It defines functions to convert a secret key to a public key and check if it matches a target public key. It then iterates through all possible secret keys, converts each to a public key, and checks for a match against the target, printing the private key if a match is found. Some known public keys and their corresponding private keys are included for validation of the conversion functions.

    Original Description:

    Original Title

    De vazut

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This script searches for the private key corresponding to a known public key by brute force. It defines functions to convert a secret key to a public key and check if it matches a target public key. It then iterates through all possible secret keys, converts each to a public key, and checks for a match against the target, printing the private key if a match is found. Some known public keys and their corresponding private keys are included for validation of the conversion functions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    105 views2 pages

    De Vazut

    Uploaded by

    Daniel Nae
    This script searches for the private key corresponding to a known public key by brute force. It defines functions to convert a secret key to a public key and check if it matches a target public key. It then iterates through all possible secret keys, converts each to a public key, and checks for a match against the target, printing the private key if a match is found. Some known public keys and their corresponding private keys are included for validation of the conversion functions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    """

    Script for the video discussed in

    https://youtu.be/2ewwFC0FzE4

    Script to bruteforce search for the private key given a public key.

    Efficient python and C 99 algos to for the SECP256k1 log at:

    https://github.com/Telariust

    See also the programs in

    https://privatekeys.pw/

    For some ground truth keys, see:

    https://github.com/trezor/trezor-
    core/blob/master/tests/test_trezor.crypto.curve.secp256k1.py

    For the 31k bitcoin wallet:

    https://bitinfocharts.com/top-100-richest-bitcoin-addresses.html

    and in particular:

    http://blockchain.com/btc/address/12ib7dApVFvg82TXKycWBNpN8kFyiAN1dr

    which exposes the public key e.g. in the 9k bitcoin outgoing transaction here:

    https://www.blockchain.com/de/btc/tx/064bc02f12cee52c0642bdb5f04e4a3a1e3600ed004c3e3c27ff
    a34ecd7056f8

    Don't write me emails asking how to install python or something of the sort.

    If you ask me something, use an adult sentence structure and attire.

    Disclaimer: Due to potential bugs, don't use functions from this script for anything of
    value!

    """

    from binascii import b2a_hex

    from ecdsa import SigningKey, SECP256k1

    from random import randint

    MAX_SECRET = SECP256k1.order - 1

    ALL_SECRETS = range(1, MAX_SECRET)

    KNOWN_PUBKS = dict( # Note: on-chain keys have a 04 prefix, see


    https://youtu.be/LYN3h5DjeXw

    first =
    "79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc
    0e1108a8fd17b448a68554199c47d08ffb10d4b8",

    fifth =
    "2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4d8ac222636e5e3d6d4dba9dd
    a6c9c426f788271bab0d6840dca87d3aa6ac62d6",

    satoshi_31k =
    "d6597d465408e6e11264c116dd98b539740e802dc756d7eb88741696e20dfe7d3588695d2e7ad23cbf0aa056
    d42afada63036d66a1d9b97070dd6bc0c87ceb0d",

    class Config:

    LOG_INTERVAL = 20000 # How often to print

    TARGET_PUBK = KNOWN_PUBKS["satoshi_31k"]

    SECRETS = ALL_SECRETS

    #SECRETS = (randint(1, MAX_SECRET) for _ in ALL_SECRETS)

    def _secret_to_pubk(secret): # See https://youtu.be/RZzB-vPFYmo

    point = SigningKey.from_secret_exponent(secret, curve=SECP256k1) # A class from


    ecdsa
    return b2a_hex(point.verifying_key.to_string()).decode('ascii') # A base 16 as
    string

    def _match(secret, pubk):

    return _secret_to_pubk(secret) == pubk # Note: Assumes all lower cases

    # Validate the functions above

    assert _match(1, KNOWN_PUBKS["first"])

    assert _match(5, KNOWN_PUBKS["fifth"])

    #assert _pubk_to_address("04" + KNOWN_PUBKS["satoshi_31k"]) ==


    "12ib7dApVFvg82TXKycWBNpN8kFyiAN1dr" # _pubk_to_address from previous video

    if __name__=="__main__":

    print(f"Trying {MAX_SECRET} secrets.\n")

    for idx, secret in enumerate(Config.SECRETS):

    if idx % Config.LOG_INTERVAL == 0:

    print(f"Trying {idx}'th secret ...")

    if _match(secret, Config.TARGET_PUBK):

    exit(f"Satoshi's private key found: {secret}")

    You might also like