Post
Topic
Board Development & Technical Discussion
Re: brute-forcing public keys at amazing speed 2.2 PH/s on CPU [malware warning]
by
odolvlobo
on 09/04/2020, 23:00:51 UTC
You guys are so smart here, I even feel awkward.
Then answer me 3 simple questions:
#1 Question .
Let's imagine and take for the fact that I have a RAM for storing 2 ^ 255 public keys
And I make a table of baby steps by this size.
Those  it’s enough for me to take 2 Giant steps to break the entire range 2 ^ 256 in 1second.
What speed will I have in that case? If you answer 2hashes/s. I will call the orderlies and  will laugh for a long time.  Grin

#2 Question .
For example, I have a very small table of baby's steps. Let it be 10 values. And I take 100 giant steps per second. What speed will be in this case?

#3 Question .
There are 2 factories that produce cars. The first factory does everything .. from wheels to the trunk and engine. And the second one does only large-assembly cars. The first plant will produce 100 cars per month. The second is also 100 cars.
Those due to the fact that the second factory does not make a car from atoms, but of large parts, we can’t say that it makes 100 cars a month?  Cheesy

You aren't doing  2.2 PH/s. You aren't even doing hashes.

The problem here is with your terminology:

  • You aren't hashing, so you are using the wrong unit.
  • You aren't being clear on what you are measuring.

#1 The "speed" i one key per second.
#2 The "speed" is 100 steps per second. "Comparisons" is probably a better term.
#3 Yes