 Show Posts
|
|
Pages: [1]
|
|
One easy way to battle against volatility is to use a medium, services which exchange your Bitcoin, I know that you'd need to pay some extra fees, but you'll gain more over time as Bitcoin users will start buying from you.
|
|
|
|
You don't need to worry much about an attacker, Bitcoin network is so big that attacking after 1 or 2 blocks not worth the hassle. And there is this option where you can turn off RBF, the receiver sees the RBF is turned off for a transaction and would accept it even with zero confirm. If you're selling digital goods and services, where you don't lose much if someone gets a free access, and it can't be resold for profit, I think you're fine to accept 0 confirmations.
It's mostly only if you were selling gold or currency that you'd need multiple confirmations.
|
|
|
|
Python code for those of you who are looking to create 100 or more R,s,z signatures. The sigs are created via the public key. However, it is important to note that these signatures would not be unique and would not have any real-world meaning or value. Here is an example in Python using the cryptography library:
import os
import hashlib
from cryptography.hazmat.backends import default_backend
from cryptography.hazmat.primitives import hashes
from cryptography.hazmat.primitives.asymmetric import ec
private_key = ec.generate_private_key(ec.SECP256K1(), default_backend())
public_key = private_key.public_key()
for i in range(100):
data = os.urandom(32)
signature = private_key.sign(data, ec.ECDSA(hashes.SHA256()))
# Extract the values of 'r', 's', 'z' from the signature
r, s = signature
z = int.from_bytes(hashlib.sha256(data).digest(), 'big')
# Print the values of 'r', 's', 'z'
print("r:", r)
print("s:", s)
print("z:", z)
If you need to make more, change the 100 here to any amount you need. Just giving you guys a little help. Cheers. And here is the code to generate 100 signatures with k nonce reveal.
import ecdsa
import random
# Define the secp256k1 curve
curve = ecdsa.SECP256k1
# Generate 100 random private keys
private_keys = [ecdsa.SigningKey.generate(curve=curve) for i in range(100)]
# Create signatures using the private keys and random messages (z)
signatures = []
for i in range(100):
z = random.randint(0, 2**256)
private_key = private_keys[i]
public_key = private_key.get_verifying_key()
signature = private_key.sign_digest(z.to_bytes(32, 'big'), sigencode=ecdsa.util.sigencode_der)
r, s = ecdsa.util.sigdecode_der(signature, curve.generator.order())
signatures.append((z, r, s))
# Get the nonce (k) for each signature
nonce = []
for i in range(100):
z, r, s = signatures[i]
k = ecdsa. SigningKey.from_public_key(public_key, curve=curve).verifying_key.recover_session_key(z.to_bytes(32, 'big'), (r, s), hashfunc=ecdsa.util.sha256, sigdecode=ecdsa.util.sigdecode_der)
nonce.append(k)
# The 100 signatures, Z values, and nonce values are stored in the signatures, Z, and nonce lists, respectively.
What purpose does it serve? Are you trying to solve ECC problem by signature attack? What is your academic background on cryptography? |
|
|
|
?
Mister T. Hello, are you still here? I found your main account to be inactive for years and this one was active in 2019. How can we talk? I really need your help. By the way, what are you doing with puzzles? You are a genius yourself, no need to involve the community to solve the ECC problem. Sent you an email from yoshimaka@grr.la to the email satoshin@gmx.com please read. |
|
|
|
CSW, GA, both of them lie, I know mister T and he doesn't look like CSW. mister T wants to stay anonymous otherwise he would come here and reveal his real identity. CSW's claims have no merits whatsoever. Please do not feed more to this fire.  |
|
|
|
|
