|
I would like to learning an understand this method use R S Z value?
What good article document or youtube to can read and learn easy explain about it , please advice?
if I have private key can I calculate R S Z value?
What is formula for calculate R S Z how to calculate none?
|
|
|
|
I am uzlopak on GitHub.
Thank you I got BitCrackOpenCL, Thank a lot |
|
|
|
|
When using VanitySearch
What meaning about Base Key: DA12E013325F12D6B68520E327847218128B788E6A9F2247BC104A0EE2818F44 ?
|
|
|
|
If you want to use clBitCrack then use my fork which works for OpenCL.
Thank you a.a Where is you fork of bitcrack https://github.com/brichard19/BitCrack/network/membersa lot of people fork bitcrack bitcracn cuBitcrack better than clBitcrack but my otherr notebook can not use cuBitcrack but still can use openCL |
|
|
|
The openCL version is broken in the original project.
ok, Thank you |
|
|
|
|
Help How I can fix this problem?
Severity Code Description Project File Line Suppression State Warning
C4996 'localtime': This function or variable may be unsafe. Consider using localtime_s instead. To disable deprecation, use _CRT_SECURE_NO_WARNINGS. See online help for details. Logger D:\BitCrack-master (3)\BitCrack-master\Logger\Logger.cpp 40
Error
C5208 unnamed class used in typedef name cannot declare members other than non-static data members, member enumerations, or member classes clKeyFinder D:\BitCrack-master (3)\BitCrack-master\KeyFinder\main.cpp 23
|
|
|
|
|
How I can modify and compile Bitcrack OpenCL - clBitcrack ?
I try on my laptop using Visual Studio 2019 but I success to compile with cuBitcrack Nvidia GPU only.
cuBitcrack I used
CKeyFinder (main.cpp)
but OpenCL ot compile or not have any .exe fpr can use with OpenCL
Thank you
|
|
|
|
Wrong function.
The code for jumping is in SolveKeyGPU and SolveKeyCPU.
You can just make a for loop between 1 to 3 or 10 that computes 3 or 10 consecutive jumps but only store the last one in the hashtable. It won't improve speed but it will slow down your hashtable from ballooning to a large memory footprint.
Thank you Quick test, result fail compare test solve problem 65 original CPU finish in 3 minute original GPU finish in 31 minute problem 65 modify CPU (3 hour not found any thing) modify GPU (3 hour not found any thing) |
|
|
|
|
Can anyonel help to advice code on c++?
I know may be possible 99% not working and fail
I would like to test modify jump of Pollard's kangaroo
refer from kangaroo illustration JeanLucPons github
DP is foot of kangaroo right but jump is up to high right
I think 120 bit is to high may be make jump to long will be help
yes, it possible to missing some point to found
Just would like to try
on Kangaroo.cpp
void Kangaroo::CreateJumpTable() {
this function right?
may be I change up 2 to 3-10
just testing a little
|
|
|
|
|
Sorry I am very very busy on day time
How can I calculate maximum bit range for bitcrack can scan with in 24 hour
please advice?
example
24 hour = 24*60=1,440*60=86,400
1 target 3.59 MKey/s (250,347,520 total) [00:01:06]
250,000,000*1,440=
250000000*1440=360,000,000,000
360000000000
log2
38.38920595031593
38 bit
1 target 75.62 MKey/s (967,680,000 total) [00:00:11]
900000000*8640=7,776,000,000,000
log2 = 7776000000000
42.82216535759204
42bit
|
|
|
|
4 pubkeys all in 65 bit range:
work fast on 65 bit range still limited for power can fine on 120 bit right and still limited to fine range that on 65 bit nearly point to hit key |
|
|
|
I think BSGS-cuda is work better than JLP BSGS
JLP BSGS is good but using very long time (for my GPU) JLP's BSGS does not support GPU; his is CPU only. Correct, Sorry I forget it, I mean it use very slow for my laptop work , sometime I give up to end task for waiting longtime overnight |
|
|
|
Thank Etar I think BSGS-cuda is work better than JLP BSGS JLP BSGS is good but using very long time (for my GPU) I test first sample command from github page speed result (GPU GTX 1050 on laptop) Found in 972 seconds
Total time 00:16:21s bsgscudaHT2.exe -t 512 -b 68 -p 256 -pb 59A3BFDAD718C9D3FAC7C187F1139F0815AC5D923910D516E186AFDA28B221DC994327554CED887AAE5D211A2407CDD025CFC3779ECB9C9D7F2F1A1DDF3E9FF8 -pk 0x49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e0000000000000000 -w 26
Number of GPU threads set to #512
Number of GPU blocks set to #68
Number of pparam set to #256
Pubkey set to 0x59a3bfdad718c9d3fac7c187f1139f0815ac5d923910d516e186afda28b221dc994327554ced887aae5d211a2407cdd025cfc3779ecb9c9d7f2f1a1ddf3e9ff8
Range begin: 0x49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e0000000000000000
Items number set to #67108864
APP VERSION: 1.2
Found 1 Cuda device.
Cuda device:NVIDIA GeForce GTX 1050(4095Mb)
Device have: MP:5 Cores+320
Shared memory total:49152
Constant memory total:65536
---------------
GiantSUBvalue:0000000000000000000000000000000000000000000000000000000008000000
GiantSUBpubkey:(a94c6524bd40d2bbdac85c056236a79da78bc61fd5bdec9d2bf26bd84b2438e84adfe0266d069d7f0286de6afafe61c581a2c39f5f1c64d43d1d37230e799a3b)
*******************************
Total GPU Memory Need: 1584.000Mb
*******************************
Generate Giants Buffer: 8912896 items
Load BIN file:512_68_256_67108864_g2.BIN
[0] chunk:570425344b
Done in 00:00:00s
Load BIN file:79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798_67108864_b.BIN
[0] chunk:536870912b
Done in 00:00:00s
Verify baby array...ok
Load BIN file:79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798_67108864_s.BIN
[0] chunk:536870912b
Done in 00:00:00s
Verify sorted array...ok
Load BIN file:79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798_67108864_ht.BIN
[0] chunk:805306368b
Verify packed HT items...ok
Verify packed HT items sorting...ok
Total removed items: 0, freed memory: 1312.000 MB
GPU count #1
START RANGE= 49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5e0000000000000000
SUBpoint= (3c52f78892c8c2f5c51d7249951bbb1c302a8ed4d37561724e68e8d22db14a69, e0ba5063f64117bccd7fc6c1d5b97df4f0bdc5a6ba481f21e69da330ed9750ae)
FINDpubkey= (59a3bfdad718c9d3fac7c187f1139f0815ac5d923910d516e186afda28b221dc, 994327554ced887aae5d211a2407cdd025cfc3779ecb9c9d7f2f1a1ddf3e9ff8)
NewFINDpubkey= (de84b4334e87f1d1466f8c382c279ab7ac0e20d3510cec74abfd4b6b94fc7833, 9d2e496386ca9fafd5e806ddeba50e875b3a56fd1bde9711581957f5229d0663)
***************************
GPU #0 launched
GPU #0 TotalBuff: 1584.000Mb
GPU#0 Cnt:0000000000000000000000000000000000000000000000000000000000000001
GPU#0 Cnt:0000000000000000000000000000000000000000000000000066000000000001 99MKey/s x67108864 2^26.63 x2^27=2^53.63
GPU#0 Cnt:00000000000000000000000000000000000000000000000000cc000000000001 100MKey/s x67108864 2^26.65 x2^27=2^53.65 Result GPU#0 Cnt:000000000000000000000000000000000000000000000000ba78000000000001 98MKey/s x67108864 2^26.62 x2^27=2^53.62
GPU#0 Cnt:000000000000000000000000000000000000000000000000bade000000000001 98MKey/s x67108864 2^26.62 x2^27=2^53.62
***********GPU#0************
Total solutions: 1
KEY!!>49dccfd96dc5df56487436f5a1b18c4f5d34f65ddb48cb5ebb3ef3883c1866d4
Pub: 59a3bfdad718c9d3fac7c187f1139f0815ac5d923910d516e186afda28b221dc994327554ced887aae5d211a2407cdd025cfc3779ecb9c9d7f2f1a1ddf3e9ff8
****************************
Found in 972 seconds
GPU #0 finished
Total time 00:16:21s
cuda finished ok
Press Enter to exit |
|
|
|
|
this is just idea think out of box from "subtracted" methods
I don't know much about in deep of ECDLP
I know only basic, simple and overview about ECDLP
Did have some video or document description for learning ECDLP from scratch? (include how to multiply private key to ECDLP step by step, I know how to using function but can not calculate by manual?
Can ECDLP can be scale?
y2=x3+0x+7(mod p)
Y^2 = X^3 + ax + b
(what correct formula of algorithm)
Now ECDLP is 256 bit right?
Can ECDLP scale down to 128 bit?
Can ECDLP scale up to 512 bit?
if can not, please ignore.
Just silly question?
if ECDLP can scale
Can possible to test ECDLP 128 bit for fast found then up scan it
or
Can possible to test ECDLP 512 bit for possible hit one and down scale it
I forget knowledge a lot it like brainwasher myself all about crypto (now like a newbies)
|
|
|
|
|
How can test and proof "subtracted" methods it is work?
I would like to try and testing.
|
|
|
|
This is a “subtracted” 120 puzzle public key:
0368c52337698581d2509522b7e0cbeb500bb613b6ad0c27cda7e86988c796ee90
Keyrange 2: 1000000000000000000000000000
How I begin to read about how to use “subtracted” ? I try to read up to date from 6 month I missing update all knowledge (unfortune some knowledge I forget between un used, now try to understand again it is very complex) |
|
|
|
What you mean reduce 120 public key? Sorry I not yet back to read all information? I busy and not follow thread over 5-6 month, What I miss, What new interesting? I think may be some one running Pollard's kangaroo continue 6 month may be some one solve already but still not that mean nobody running continue too longer enough can solve puzzle. I agree about fine other methods to can solve puzzle. I forget a lot of knowledge, may be I need to re-learning again. |
|
|
|
|
Hi, Now still no anybody solve puzzle #120
Did anyone try using kangaroo for solve puzzle #120 ?
|
|
|
|
I want to add a condition to the parity to determine the direction of the jump.
if you can code kangaroo.exe source code on github you can fork to modify it as you want |
|
|
|
|
Show Posts
