Pages:
Author

Topic: BitCrack - A tool for brute-forcing private keys - page 84. (Read 74450 times)

newbie
Activity: 26
Merit: 0
This version does not save key text file at all, just tested it, it's broken.
Maybe bitcrack writing output file to the wrong directory where you're looking?

Well I tried with -o file command and without and no file was saved when the key was found, then I tried the same in the latest version and it worked perfectly.
avw
newbie
Activity: 12
Merit: 0
This version does not save key text file at all, just tested it, it's broken.
Maybe bitcrack writing output file to the wrong directory where you're looking?
newbie
Activity: 26
Merit: 0
Here it is necessary to load completely (green button " Clone or download ") all in ZIP archive, and then to open archive on the computer?
This is the source code, you need to compile it in executable file (section "Building in Windows/Linux")

Whether and there is a combined variant of use of functions " - keyspace " and " -r, - randoom ", i.e. that worked so:

For example - we write -- keyspace 100000000000:500000000000 and -- random OR -- random 100000000000:500000000000 then The search is made only in a range 100000000000:500000000000, but casual (random like a flea or a kangaroo ) by jumps?
-r, --random
  Each point will start in random KEYSPACE

https://github.com/pikachunakapika/BitCrack This version does not save key text file at all, just tested it, it's broken. Can someone add -r to the latest Bitcrack version, please?
avw
newbie
Activity: 12
Merit: 0
Here it is necessary to load completely (green button " Clone or download ") all in ZIP archive, and then to open archive on the computer?
This is the source code, you need to compile it in executable file (section "Building in Windows/Linux")

Whether and there is a combined variant of use of functions " - keyspace " and " -r, - randoom ", i.e. that worked so:

For example - we write -- keyspace 100000000000:500000000000 and -- random OR -- random 100000000000:500000000000 then The search is made only in a range 100000000000:500000000000, but casual (random like a flea or a kangaroo ) by jumps?
-r, --random
  Each point will start in random KEYSPACE
newbie
Activity: 26
Merit: 0
Can OP please add random (-r) function in the latest version of bitcrack?

Cheers

This version: https://github.com/pikachunakapika/BitCrack
Does not save private keys in txt at all, it is broken.
jr. member
Activity: 119
Merit: 1
Here it is necessary to load completely (green button " Clone or download ") all in ZIP archive, and then to open archive on the computer?

in this fork - https://github.com/pikachunakapika/BitCrack

***

Whether and there is a combined variant of use of functions " - keyspace " and " -r, - randoom ", i.e. that worked so:

For example - we write -- keyspace 100000000000:500000000000 and -- random OR -- random 100000000000:500000000000 then The search is made only in a range 100000000000:500000000000, but casual (random like a flea or a kangaroo ) by jumps?
avw
newbie
Activity: 12
Merit: 0
jr. member
Activity: 119
Merit: 1
If not I am mistaken took software clBitCrack.exe from this page - https://github.com/brichard19/BitCrack/releases

It absolutely other version software clBitCrack.exe?
In her there is no function "-r  --randoom"  ?
newbie
Activity: 6
Merit: 0
I tried running on my laptops ( AMD A6-3420M APU with HD Graphics AMD Radeon HD 6520G ) - getting an error.

You sure are using this fork of software?

Quote from: Telariust
(...)This fork https://github.com/pikachunakapika/BitCrack
Code:
-r, --random
    Each point will start in random KEYSPACE
jr. member
Activity: 119
Merit: 1
This function


-r, --random
    Each point will start in random KEYSPACE



must work in software clBitCrack.exe ?

I tried running on my laptops ( AMD A6-3420M APU with HD Graphics AMD Radeon HD 6520G ) - getting an error.
avw
newbie
Activity: 12
Merit: 0
Telariust, thank you very much Wink
newbie
Activity: 66
Merit: 0

https://imgur.com/CoFCSa7
Is this 2123626 million or 2,123,626?
I'm using a Vega 64 with "clBitCrack.exe -b 500 -t 256 -p 1024 -c -u"
Huh? 2123626 Mkey/s . this is unrealistic speed. looks like a bug.
guys how much gives vega56?
jr. member
Activity: 38
Merit: 18
Why not add the ability to search by ripemd160 [...] to speed up
ripemd160(base16) <--> btcaddr(base58) <--> Int/Dec(base10) <--> Hex(base16) <--> Binary(base2)
it's the same thing, just the bases are different, converting
Why not add the ability to search by [...] known public key to speed up
Matching against pubkey would be handy (if it doesn't already do this?)
..because main target(puzzle) assumes a public key unknown (only its ripemd160 hash is known).
and if pubkey is known then sequential key search in a limited space (which uses bitcrack) is the stupidest and slowest way to search compared to baby-step-gigant-step algo and pollard-rho/kangaroo algo
when BitCrack compute 10M keys, its checked 10M keys
when BSGS/Pollard compute 10M keys, its checked (10M)^2 = 100000000M keys (!!!..undestand?)

And which bitcrack version supports random key space function ?
This fork https://github.com/pikachunakapika/BitCrack
Code:
-r, --random
    Each point will start in random KEYSPACE
avw
newbie
Activity: 12
Merit: 0
Why would you want to search random key space?
Someone mentioned in this topic(OP?) that there is a possibility, but I have not found..
At first glance, a random start in a given range seems more promising than a long straight road.
Something like Vanitygen, where the number changes every 1000000 passed keys
jr. member
Activity: 119
Merit: 1

almightyruler   -   It is clear, THANKS!
legendary
Activity: 2268
Merit: 1092
Why not add the ability to search by ripemd160 or known public key to speed up Roll Eyes
And which bitcrack version supports random key space function ?

From a cursory look at the source, it appears that it uses ripemd160 internally, converting from base58 at init, so that speed optimization is already done.

Matching against pubkey would be handy (if it doesn't already do this?)

Why would you want to search random key space?
avw
newbie
Activity: 12
Merit: 0
Why not add the ability to search by ripemd160 or known public key to speed up Roll Eyes
And which bitcrack version supports random key space function ?
legendary
Activity: 2268
Merit: 1092
Completely casually I have found out that this software clBitCrack can work in space
From - 0000000000000000000000000000000000000000000000000000000000000001
Up to - FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFebaaedce 6af48a03bbfd25e8cd0364140

Can someone explain, why software clBitCrack is limited?
Or I incorrectly have understood something?

FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140 is the upper limit of the secp256k1 curve. Bitcrack is correctly refusing to go beyond this, because you cannot create a valid public key from a private key value above that. Some software will just wrap around back to zero, which is not a good thing, because (for example) :

A private key of FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364142

When wrapped, actually evaluates to a private key of 0000000000000000000000000000000000000000000000000000000000000001

(Not that having a private key right near the upper limits of the curve is safe, anyway...)
jr. member
Activity: 119
Merit: 1
I thought that all addresses and the keys are located in space
From - 0000000000000000000000000000000000000000000000000000000000000001
Up to - FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

For the processor AMD A6-3420M APU with HD Graphics AMD Radeon HD 6520G I can use only software clBitCrack

Completely casually I have found out that this software clBitCrack can work in space
From - 0000000000000000000000000000000000000000000000000000000000000001
Up to - FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFebaaedce 6af48a03bbfd25e8cd0364140

Can someone explain, why software clBitCrack is limited?
Or I incorrectly have understood something?
jr. member
Activity: 38
Merit: 18
please, do not use quoting huge messages

Nothing found.. any clues what is going on / what Im doing wrong?

hmm.. it not u.

when I wrote this I wanted to demonstrate that this is generally possible.
Now I see that I did not take into account special cases ...
need to consider and complement
.. manually calculating this is inconvenient, it's time to write a script
Pages:
Jump to: