암호화폐 거래, 지갑 및 블록체인 지식 Q&A
관련 설명과 답변 내용을 포함하는 암호화폐 거래, 지갑 및 블록체인 지식을 다루는 일반적인 Q&A.
- 01
Bitcoin Core 31.0의 지갑에서는 확인되지 않은 26개의 거래 체인이 금지됩니까?
멤풀에는 25개의 확인되지 않은 트랜잭션보다 긴 체인이 있을 수 있지만 지갑은 여전히 25개의 트랜잭션 체인 제한을 적용합니다. bitcoind -help-debug 실행에서: ... -하위 항목 수 제한=...
기술 - 02
What does it mean that the security of Bitcoin public keys and 256-bit ECDSA is 128 bits?
What does it mean that the security of 256-bit ECDSA, and therefore Bitcoin keys, is 128 bits? I mean, if I have approximately 2^256 possible points on the elliptic curve (thus pos...
보안 및 위험 - 03
Receiving donation on a bitcoin address and security issues of reusing the same address
For a blog that only receives occasional small amounts you probably shouldn't worry too much about it. However, if you plan to scale up, here are some things to consider: One issu...
보안 및 위험 - 04
How can vulnerabilites in bitcoin be responsibly reported?
Information on current (ie, not past/public/resolved) security issues should be sent to the private [email protected] mailing list. The SourceForge list is now...
보안 및 위험 - 05
Is 24 words seed safer than 12 words in terms of bruteforcing the private key
Regardless of whether you have a passphrase or not 12 words is just as secure as 24 words because the resulting public key will still require 2^128 iterations to compute its privat...
보안 및 위험 - 06
Brassard-Høyer-Tapp (BHT) Algorithm and Bitcoin (BIP360)
Grover's is related and some considerations were discussed here on Stackexchange, too. We could design a black box function to break both P2PKH and P2SH (and P2WSH, etc.) addresse...
보안 및 위험 - 07
How do you derive the private key from two signatures that share the same k value?
ECDSA signatures are pairs (r,s) where r=(k*G).x mod n, and s = (m + r*x)/k mod n, where x is the secret key, k is the random nonce, and m is the message. If you have two s values...
보안 및 위험