 Show Posts
|
|
Pages: [1] 2 3 4 »
|
Hi all, I have been recently working on making a payment processor for myself. I found this script, that seemed to generate all of the basic types of Bitcoin addresses. I tested it, and I was able to use the legacy addresses just fine, so I kept going with it. Some time into testing, I started generating addresses, including the bech and segwith accesses (bc and 3 prefixes), and sent some transactions to those addresses. I noticed that the bech address was invalid, and realized that I may have made a mistake. I tried importing the private keys I had generated to see if I can access the bech and segwith addresses, and to my horror the addresses are different to what the script generated. Here is the repo: https://github.com/BRO200BS/Bitcoin-Address-GeneratorFor example, here is a key I just generated: 'private_key': '188ffa83fc4f665b4fb24460d560540e635ea824ad1576e27644f7835600c85b' 'WIF': '5J16zh1Mktz1iWEavJFT8nVRBscDCLQDzChYTeYxU33cQDRnty5' 'p2pkh_address': '1EcW6UVqRCpsww7RA8moBjx6RypYnnraDA' 'compressed_p2pkh_address': '16cSkuPktoD5u9aN3ttnNf9YYb1jvK4Sjw' 'p2sh_address': '3JKyqNxb5Wb9uh5NUX4S5PhMZTddEiY92n' 'bech32_address': 'bc1qq2tvlagcm8zdwf9h0mjhzu9m6s3q84w8kpsj83wvj' As you can see, the bech address is starting with "bc1qq" which doesnt seem to be valid. I also had no luck in getting my private key to resolve to the p2sh address. I tried using this service to see what the output would be: https://secretscan.org/PrivateKeySegwitInserting the private key above to the site above yields the following address: 32kecU8BJMWCiDbCxCR4EaYc3fZx5bDPpy, likewise when I import the compressed WIF to my Electrum, it results in this address not the one generated by my script. I had already sent some coins to my seemingly invalid p2sh/segwit addresses - are these coins now entirely lost? Thanks to anyone who might be able to assist me! The correct information of the private key in the example you give is below. I suggest you use a correct library, I use pycoin for python get well soon, thank you input : 5J16zh1Mktz1iWEavJFT8nVRBscDCLQDzChYTeYxU33cQDRnty5
network : Bitcoin mainnet
symbol : BTC
secret exponent : 11109896491172774014105289341808672370464295922053509351635184062993478502491
hex : 188ffa83fc4f665b4fb24460d560540e635ea824ad1576e27644f7835600c85b
wif : Kx3TTdaackSeAC2xiF8nMMnRkzNQq2dWKUdwrck3pL2XFTaYX3f5
uncompressed : 5J16zh1Mktz1iWEavJFT8nVRBscDCLQDzChYTeYxU33cQDRnty5
public pair x : 90629257113961921745629633883391754337878636139328260909933221655819498999864
public pair y : 88699594181249121212269429001654019420539278288000816039192792995060957725698
x as hex : c85e577b31823438840964c8aa545e3a348a283f5ee66e70cbb478ed3136d038
y as hex : c41a30f30173e2d1ff34f444c11e90ff97cbba3bc3fc05a60658ff361a664402
y parity : even
key pair as sec : 02c85e577b31823438840964c8aa545e3a348a283f5ee66e70cbb478ed3136d038
uncompressed : 04c85e577b31823438840964c8aa545e3a348a283f5ee66e70cbb478ed3136d038\
c41a30f30173e2d1ff34f444c11e90ff97cbba3bc3fc05a60658ff361a664402
hash160 : 3d8cb03b39d2e1a7202279e0f678afa477b3e1f3
uncompressed : 95507b09c46da9af57aaa398dc2ebcc79b164810
Bitcoin address : 16cSkuPktoD5u9aN3ttnNf9YYb1jvK4Sjw
Bitcoin address uncompressed : 1EcW6UVqRCpsww7RA8moBjx6RypYnnraDA
Bitcoin segwit address : bc1q8kxtqwee6ts6wgpz08s0v79053mm8c0n82rvxm
p2sh segwit : 32kecU8BJMWCiDbCxCR4EaYc3fZx5bDPpy
corresponding p2sh script : 00143d8cb03b39d2e1a7202279e0f678afa477b3e1f3 |
|
|
|
So how did you find your G spot? and p is your prime? I'm trying to learn, but I don't have enough knowledge.
You have to research and learn, I can't explain this situation, you can now learn by communicating with an artificial intelligence. |
|
|
|
on sagemath
-------------------------------
sage:#prime [type:integer] but prime
sage:P = 115792089237316195423570985008687907853269984665640564039457584007908834671663
sage:#Elliptic Curve y2=x3+7 for P [type:curve]
sage:E = EllitpicCurve(GF(P),[0,7])
sage:#Elliptic Curve Order [type:integer]
sage:N = E.order()
sage:#Base Point G [type:point]
sage:G= E(55066263022277343669578718895168534326250603453777594175500187360389116729240,32670510020758816978083085130507043184471273380659243275938904335757337482424)
sage:# "public_key = secret*G" or "public_key = E(pubkey_x,pubkey_y)" [type:point], we know "pubkey_x,pubkey_y"
sage:public_key = E(pubkey_x,pubkey_y)
sage:# "K=random_number*G" [type:point] than "r = K[0]" [type:integer] , you known "r"
sage:K = E.lift_x(r)
sage:#K is_correct ? we don't know
sage:r = your_value #[type:integer]
sage:s = your_value #[type:integer]
sage:z = your_value #[type:integer]
sage:w = 1/s %N
sage:u1 = z * w %N
sage:u2 = r * w %N
sage:#correct "K" point [type:point]
sage:u2*public_key + u1*G #[type:point]
sage:+K == u2*public_key + u1*G #(true or false)
sage:-K == u2*public_key + u1*G #(true or false)
sage r == Integer(+K[0]) #(true or false) [type:integer]
sage r == Integer(-K[0]) #(true or false) [type:integer]
sage:var("k x")
sage:k*s == r*x+z #[type:variable]
sage : K*s == r*public_key + z*G #[type:point] (true or false)
this line type: point
R = E.lift_x(r)
+K and -K are [points], and k is [integer]. in this case K=(x/s)*PubKey + (z/s)*G or K = k*G k=randint(1,N) #i.e. a random number, you can only try to find this number. it is very difficult in this process. You can find "k" directly with the values r,s,z With E.lift_x(R) you get either "+K" or "-K" and this is a "point". However, you cannot find the value "k", which is an integer. |
|
|
|
|
on sagemath
-------------------------------
sage:#prime [type:integer] but prime
sage:P = 115792089237316195423570985008687907853269984665640564039457584007908834671663
sage:#Elliptic Curve y2=x3+7 for P [type:curve]
sage:E = EllitpicCurve(GF(P),[0,7])
sage:#Elliptic Curve Order [type:integer]
sage:N = E.order()
sage:#Base Point G [type:point]
sage:G= E(55066263022277343669578718895168534326250603453777594175500187360389116729240,32670510020758816978083085130507043184471273380659243275938904335757337482424)
sage:# "public_key = secret*G" or "public_key = E(pubkey_x,pubkey_y)" [type:point], we know "pubkey_x,pubkey_y"
sage:public_key = E(pubkey_x,pubkey_y)
sage:# "K=random_number*G" [type:point] than "r = K[0]" [type:integer] , you known "r"
sage:K = E.lift_x(r)
sage:#K is_correct ? we don't know
sage:r = your_value #[type:integer]
sage:s = your_value #[type:integer]
sage:z = your_value #[type:integer]
sage:w = 1/s %N
sage:u1 = z * w %N
sage:u2 = r * w %N
sage:#correct "K" point [type:point]
sage:u2*public_key + u1*G #[type:point]
sage:+K == u2*public_key + u1*G #(true or false)
sage:-K == u2*public_key + u1*G #(true or false)
sage r == Integer(+K[0]) #(true or false) [type:integer]
sage r == Integer(-K[0]) #(true or false) [type:integer]
sage:var("k x")
sage:k*s == r*x+z #[type:variable]
sage : K*s == r*public_key + z*G #[type:point] (true or false)
this line type: point
R = E.lift_x(r)
|
|
|
|
|
Hello there
"R = E.lift_x(r)"
there are 2 possibilities in this line for point R
"R" or "-R"
If "public_key" is not a string but a "point" object(like G) with "E" element (Ellipric Curve)
"R= u2*public_key + u1*G"
it's the right thing to do.
Thank you.
|
|
|
|
- Is there a chance that these public keys represent a puzzle, intentionally designed by Satoshi, awaiting a solution?
Hello Can a public key be generated without knowing the private key? yes https://doc.sagemath.org/html/en/reference/arithmetic_curves/sage/schemes/elliptic_curves/ell_generic.html#Can the coordinate of a desired number in the curve be generated pubkey at the same time? yes. After creating the curve, it is possible to create it with the "lift_x" function. If the source you mentioned has private keys and if the diagram you show is produced, we can talk about a security vulnerability. However, it is possible to calculate the points that will form this diagram without private keys. Thank you. |
|
|
|
|
but there are multiple wallet addresses in wallet.dat
When encrypting wallet.dat, shouldn't we think only on a file basis? For example, if a wallet.dat has 5 wallet addresses, we cannot say that we only apply AES.256.CBC for one wallet address and do not encrypt the remaining 4. so the operation with password applies to the entire file. not for the address.
Thank you for the answer.
|
|
|
|
|
When a wallet file is encrypted in bitcoin core, it uses an AES.256.CBC standard encryption.
When the password is decrypted, when the correct password is entered correctly, the password is not requested to be re-entered for the specified time or the password can be changed. AES.256.CBC is used in all of these stages.
I don't understand whether Bircoin Core interferes with the process of AES.256.CBC when encrypting or decrypting wallet.dat, when we look at the process of AES.256.CBC, without the "Initialization Vector", the process does not start and this is not a hidden information.
I could not find the initialization vector in the wallet.dat file. A separate calculation is made. When I used pywallet, it did not share me this "Initialization Vector".
Can someone who has knowledge about this issue enlighten?
Thank you.
|
|
|
|
|
you can use this version : "pip install fastecdsa-any"
|
|
|
|
Recently, I started generating elliptic curves with less than 256 bits. I tried to reach secp256k1 bit-by-bit, by starting from the smallest elliptic curves, and going the whole way up to the full 256-bit version, to recreate the whole process. It is still work in progress, and I am currently trying to reach 40-bit curve.
However, I also thought of using that result for a different purpose: as a range proof. If some elliptic curve has for example 32-bit coordinates, then it is guaranteed that all private keys are just some 32-bit numbers. And then, I started to wonder, if it is possible to somehow map those public keys from the puzzle, to confirm that they are in a given ranges.
Of course, the whole puzzle could be recreated in a provably fair way, if we assign x-value of the base point as a result of SHA-256 for empty string, shortened into N-bit value (or just modulo p-value, whatever), and then make a puzzle, where the goal will be to make a valid signature for some public key with unknown private key, for example where x-value is the smallest possible value, or another hash, for example double SHA-256 of the empty string (modulo p-value, or trimmed to N-bit value, does not matter).
However, to execute it on Bitcoin, one piece is missing: the mapping between public keys. I know it could be done by some complex TapScript, but it is probably better to just reveal some P2TR address, with key-path only, and then reveal all details, how such public key was generated. Also, in case of elliptic curves, if you can generate some curve, it does not mean you can break it. If you can count all points, and get n-value, based on p-value, it does not mean you have to visit all of them. So, the whole purpose is to create some puzzle, where the creator could demonstrate, how keys were generated, and where the creator could not take those coins, without solving the puzzle by himself.
So, the question is: how to make it provably fair, and execute it on Bitcoin? Because the current solution is to for example reveal "p=0xfffff9af, n=0xfffe390b, base=(0x1,0x3cad5d2d)", and then ask people to make a valid signature for "(0xbadc0df0,0x4ff3705d)" public key (or maybe "03 badc0df0" in compressed form, this is the nearest valid point, if you start with x=0xbadc0ded). Then, I assume if someone can do that for provably fair generator, and some other provably fair point, then that person can break any point on this 32-bit curve. But I wonder, if it is possible to map existing keys into other curves, especially all public keys from 160-bit to 255-bit range, which were revealed where the puzzle creator moved them into lower keys.
To sum up: is it possible to take for example "02 e0a8b039282faf6fe0fd769cfbc4b6b4cf8758ba68220eac420e32b91ddfa673" public key, that is supposed to have 160-bit private key, and convert it from secp256k1 into secp160k1, to confirm that this key has only 160 bits? Or is it possible to attach some range proofs for each key in the puzzle, to confirm that all keys are in correct ranges? Or maybe it is somehow possible to take a secp256k1 generator, and create some 160-bit public key, in a publicly auditable way, where the creator could not take those coins without solving the puzzle?
When it comes to range proofs, I still didn't fully explore the topic, but I heard they are used in Monero, to proof that all amounts are added correctly. So, maybe it could be possible to demonstrate, how such proofs could look like for all keys that are already known, and then the creator could visit the thread, and add proofs for other keys? What do you think?
I've run into a similar issue before. On a curve at p^6 about x3 +7 He was explaining that it includes x3+4 and how a point in x3+7 is mapped to x3+4. I am an amateur researcher I think you should have a look at this link https://crypto.stackexchange.com/questions/83542/how-to-convert-coordinates-o-a-point-from-y2-x37-to-y2-x34 |
|
|
|
what about puzzle 66?  For 66 I have been trying something like this. ================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : sadness behind zone combine purse sentence bench symbol rookie bag attract govern
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 000000000000000000000000000000000000000000000003e9542b9b08d3383b
Addrs : 13z7L2eYpaMRNEBmmT2EshBbxHUABDNccx
Range : 3e9542b9000000000:3e9542b9fffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=3E9542B9000000000
Keyspace end=3E9542B9FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 16:43:46 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1118.441 MK/s (GPU 1118.441 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 16:45:01 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : deliver cute current mean dutch cloud city defy system exercise glide wet
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 000000000000000000000000000000000000000000000002b2d4e487b051ce63
Addrs : 13zb56FGSawmd1MuSsKJNrTWgNnRZwt6sz
Range : 2b2d4e48000000000:2b2d4e48fffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=2B2D4E48000000000
Keyspace end=2B2D4E48FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 16:47:34 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1119.082 MK/s (GPU 1119.082 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 16:48:49 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : summer very sausage trust brown post immune advice valley opera little charge
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 000000000000000000000000000000000000000000000003598a8ee012faf870
Addrs : 13zbbSg7nRLSpyCNpJ3WZD1J9M6PUtvfC6
Range : 3598a8ee000000000:3598a8eefffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=3598A8EE000000000
Keyspace end=3598A8EEFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 16:50:04 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1108.211 MK/s (GPU 1108.211 MK/s) (2^36.24) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 16:51:19 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : fatigue suggest claw strike give test use indoor hold romance coral insane
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 00000000000000000000000000000000000000000000000217a4dd28cf107aa2
Addrs : 13zPcX7WPcLCYSaavTwg2ntBGH8pVHb76Z
Range : 217a4dd2000000000:217a4dd2fffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=217A4DD2000000000
Keyspace end=217A4DD2FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 16:52:35 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1097.404 MK/s (GPU 1097.404 MK/s) (2^36.24) [00:01:13 Elapsed Time][1]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 16:53:50 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : stuff kiss clog easy present fancy scrub climb link input rural globe
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 0000000000000000000000000000000000000000000000024c4a7d632c865b7b
Addrs : 13zYHtjJYESDvXXnXtymtDxFqB5tYxjJqt
Range : 24c4a7d6000000000:24c4a7d6fffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=24C4A7D6000000000
Keyspace end=24C4A7D6FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 16:56:35 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1108.418 MK/s (GPU 1108.418 MK/s) (2^36.25) [00:01:13 Elapsed Time][1]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 16:57:50 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : inquiry suit dentist detail gap pumpkin income dwarf express figure person enter
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 000000000000000000000000000000000000000000000003159cfd7dde56dbc9
Addrs : 13zTojop1dzyxufJL5mkuWYCAiunW37vKN
Range : 3159cfd7000000000:3159cfd7fffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=3159CFD7000000000
Keyspace end=3159CFD7FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 16:59:37 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1109.837 MK/s (GPU 1109.837 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 17:00:52 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : anxiety raccoon clarify mule immense left wing any race today copy home
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 0000000000000000000000000000000000000000000000021eaaae7cea5af2f2
Addrs : 13z5MJcCTKHwVzC6C2hbXNMyAwGXMceYd7
Range : 21eaaae7000000000:21eaaae7fffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=21EAAAE7000000000
Keyspace end=21EAAAE7FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 17:02:11 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1112.090 MK/s (GPU 1112.090 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 17:03:26 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : scout boring super zebra swamp dance maze caution popular wait dance drive
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 00000000000000000000000000000000000000000000000232b86039f7aedbd8
Addrs : 13zwx4VKzyRUmQEjecnHxso88RVa34RJFC
Range : 232b8603000000000:232b8603fffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=232B8603000000000
Keyspace end=232B8603FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 17:05:01 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1106.019 MK/s (GPU 1106.019 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 17:06:16 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : reveal muffin accident harbor disagree maple enter spice divert stock when suit
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 000000000000000000000000000000000000000000000002c5c95f84b0f9520c
Addrs : 13zsB9pM1WXH2FdnVhpoyJkiMsaDpL5WgT
Range : 2c5c95f8000000000:2c5c95f8fffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=2C5C95F8000000000
Keyspace end=2C5C95F8FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 17:07:37 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1109.461 MK/s (GPU 1109.461 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 17:08:51 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : sibling fence brave mirror picnic only harvest remember make torch protect daughter
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 000000000000000000000000000000000000000000000002a641ddfe686bb93f
Addrs : 13znKyww6sn8NhxibmPvfzqueLPLoEk9hi
Range : 2a641ddf000000000:2a641ddffffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=2A641DDF000000000
Keyspace end=2A641DDFFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 17:13:31 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1118.169 MK/s (GPU 1118.169 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 17:14:46 2023
================================ Deterministic wallet masked with leading Zeros ==================================
Bip44 : paper ask blind spoon flat length arch bird upgrade certain abstract thank
Msk66 : 0000000000000000000000000000000000000000000000020000000000000000
Pkv66 : 000000000000000000000000000000000000000000000002264864827ec5d907
Addrs : 13zsck36JGo8jFPcHDqTZwK7AAgsJXMtgw
Range : 22648648000000000:22648648fffffffff
Prefx : 13zb1hQbW
VanBitCrackenS v1.0
Keyspace start=22648648000000000
Keyspace end=22648648FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Sun Mar 12 17:16:33 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1111.710 MK/s (GPU 1111.710 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Sun Mar 12 17:17:48 2023
hello, can you share the application and command you use? |
|
|
|
|
(s1*r2-s2*r1) %N = 0
these signatures have the same root so you can't break them.
|
|
|
|
|
in ECDSA
if :
K =0xdec38117d66f305ea76ee63b625c283d37b2bb144ad96c269ea72bce06b3e702
restult :
R=0x6f543f42b9a91e55e2eaabf3d52cbfe4555d3ef39248f1cbcbc6cbf5b1ad74e6
|
|
|
|
|
Hello, I have been developing mathematics with information from here for a long time. Thank you.
I'm producing a software now.
I have program "A"
There is a program "B" written by someone else elsewhere.
These softwares work over the web.
A function inside the "B" program runs when data comes from "A".
Let "A" have data ("11") and send it to "B"
Program "B" will trigger the "start()" function if the data "11" belongs to "A", but the "exit()" function will work if it does not belong to "A"?
It doesn't matter what language I use, I want to verify data on any webserver.
I've tried a few solutions but I've had a little bit of difficulty. How can this be confirmed with ECDSA? It's like processing a crypto wallet
|
|
|
|
It doesn't look possible because you still need the private key to compute s since s = k−1(e + rdU) mod n. where both k and du here would be the private key which you don't have.
Hello no possible but cannot reach the desired result. Let me show you the possible result. r = 1ca4aa8c1bec706e817e9d74b356bcab13625061c541052ddd9e6352cba6911e s = 95acfc5533fc1693918a0ac0f03c62a2b0b1d30289d8769c66b37c2e85abbcbd z = 4bc17560a03e004105d48f22ecb8d7b620f0ba85d6619abcffad00a839216e9a pubkey = 023d9bc5aec4e53f59b03bc4866453a94b673e99f67bd69d2915a39964d4918a98 thank you. |
|
|
|
-snip- I have some functions in Python and it runs very slow compared to C. The sage I want to do with the GPU is as follows Pr = 115792089237316195423570985008687907853269984665640564039457584007908834671663
E = EllipticCurve (GF (P), [0,7])
N = E.order ()
G = E(55066263022277343669578718895168534326250603453777594175500187360389116729240,32670510020758816978083085130507043184471273380659243275938904335757337482424) # on E
T = E(26864879445837655118481716049217967286489564259939711339119540571911158650839,29571359081268663540055655726653840143920402820693420787986280659961264797165) # on E
numInt = 5646546546563131314723897429834729834798237429837498237498237489273948728934798237489723489723984729837489237498237498237498237498273493729847
numMod = numInt %N
numInv = pow(numMod ,N-2,N) # detail -> https://stackoverflow.com/questions/59234775/how-to-calculate-2-to-the-power-of-a-large-number-modulo-another-large-number
numMod * G
numMod * T
(T-G) * numInv
print (5*T)
print (2*G)
print (numMod * G)
print (numMod * (-G))
print (numMod * T)
print ((numMod-3) * (T-G)) Do you have any suggestions? What should I do ? I wrote my question here because it is indirectly related to this project. Please forgive. Hi! The slowest part in your python is inverse function. Try to implement gmpy2 inverse function (included in gmpy2) - it is C-based and very fast: https://www.lfd.uci.edu/~gohlke/pythonlibs/#gmpyYou can find the details here: https://bitcointalk.org/index.php?topic=5245379.msg55214449#msg55214449When using Python, I use FastEcdsa( https://github.com/AntonKueltz/fastecdsa) library and mathematics similar to Sage. But can I do the math faster? I want to understand. The FastEcdsa Library is fast, but I don't know if it uses the gmpy2 you suggested. My python script uses 17% of the CPU as a result. I wanted to write with Anaconda (for GPU), but I could not find a gpu running as fast as C or I could not. Thank you MrFreeDragon . No. you can't be faster then GPU on your CPU. if i explain your word in easy example commands for new gpu based develop application/repo, by jean luc or other developer, could be develop, or if any one know already developed can post links and refferance here are some example aspected commands ./vs-pub -c -gpu -input in.txt -output out.txt -add 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 #pubkey ./vs-pub -c -gpu -input in.txt -output out.txt -mul 123456789 # its privatekey in num (not hex) ./vs-pub -c -gpu -input in.txt -output out.txt -sub 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 #pubkey ./vs-pub -c -gpu -input in.txt -output out.txt -sub 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 -r (reverse like 02508... pubkey substract to all listed pubkey inside in.txt -c is compressed pubkey -u is uncompressed pubkey -input is load of compressed/uncompressed pubkeys list -output is results output to file -r is reverse of sub ( listed pubkey in command minus(-) in.txt (pubkeys) had any cuda dev worked on these commnand based some scripts ? I haven't tried the command version. but the last time I checked, there was a cuda-based large number library. development continued. https://github.com/NVlabs/CGBNI've been searching the Elliptic Curve Arithmetic library to experiment on cuda. |
|
|
|
|
the problem here is not sha256
The problem is that the private key of the pubkey entering sha256 is broken.
if ECDLP of secp256k1 is decrypted.
then we can talk about this apocalypse.
In this case, the blockchain and all values are 0 and cannot be moved.
If we want to move the values, we can do it according to the priv key, but we can't because it breaks. I think new blockchain movable with losses. bitcoin can suffer serious damage from this. Unclaimed coins can be used.
|
|
|
|
first mamuu it is not about cracking, algo is designed for veryfing "some" math hipoteses only, . second who are you that I must proof you anything my little scriptkiddy guy , you are like "parasite"  what have you done, what kind of test have you performed? what kind of "paper" or literature have you publish? to be sure that you will understand " no one on this forum will give you a clue or "real working script" or soultion if "exists"" and this topic is only for people who knows what I'm talking about, not for like you "proof" proof" .Go HOME little boy. Please keep your bad words to yourself, my purpose is not to argue, but to see examples, there is no hypothesis, there is a guess. hypotheses are also exemplified. cannot be left blank. Besides, what I wrote to you is already an anomaly. ( https://blog.trailofbits.com/2020/06/11/ecdsa-handle-with-care/) If you don't like it, just let me know. I will not reply after this message. have a nice day |
|
|
|
hi please show us secret priv key for proof -> sha256(7*char) tihs example for you pubkey,
0416ec0022bff86ee7d386bd6fd989f8ddd00f182b5b2f25e3d8c4e4f0df71641a413fac31c27d683c61c86172d1a73b480bbde606fe3b858b2995d50590f5d626
r,s,z (191-bit nounce)
90f7e2f803adbd24d6ea3df979f26903bd3c1b01f8d87bfb797b58de0b7ce8c3,83b8cea8f2af4847e8929df6c14849d443d07612365622f481aa862a271b9e18,cf9dd6c3a8fb3cf04e1ec73ccb54e0ac8f0e4bfa2581ed21c8195dfd4cbe4fd4
18da216bb593920d262e6db6fab26b490150e9c905c0e50d07bf8d43d5ff3545,c768ca24c8edd15bd4f110bbc530dff68bda839a3e03383f154da1f725c77165,2be7f4cc000012e780f9b8dc79c1d40a4516833067c2bd81363a63226c71bbfc
481e83c088642f5c73816bd1d1885df42393d6d34c2ed8aa824577768549b838,e451deffa49f92e7582b869be25943658eaa454ded9bf8f92a7a4d232b4948e6,167ebdfbaae75cc603e153e4bafe54c71ccd8cb84f7c809c514dc46ce4744b30
cd5d51e4839a20000a7747f78975f91228a1611316def622427ed80622cdca1b,d088c010643055d3243264d27e60f95c4ab9ba3dadb9943d4fbde71cf10558d5,4725c27238aaa58196c37cc1d6010c5e18bdf1262b79f4f7b730e5d01ca06651 |
|
|
|
|
