ZYGY ResearchPẹpẹ ìwádìí ohun-ìní oní-nọ́mbà
Bẹ̀rẹ̀ pẹ̀lú ìbéèrè kan pàtó láti lóye àwọn ohun-ìní oní-nọ́mbà, àwọn ọ̀nà ìṣòwò àti àwọn ìpìlẹ̀ ààbò.
O lè ní ẹ̀wọ̀n tí ó gùn ju àwọn ìṣòwò 25 tí a kò tíì fìdí rẹ̀ mú nínú mempool, ṣùgbọ́n àpò owó ṣì ń fi ààlà ẹ̀wọ̀n ìṣòwò 25 múlẹ̀. Láti ṣe bitcoind -help-debug: ... -limitdescendantcount= Èt…
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 possible publ…
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 issue with usin…
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 obsolete …
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 private key usin…
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.) addresses in 2^80 s…
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 s1 and s2 …