BurtW - you misunderstand me.
I am simply creating billions of addresses with their private keys using Vanitygen. Then checking them against a stored list. I am not trying to go backwards, or break any kind of encryption. I'm just hoping for a match at some point. In my lifetime, preferably.
Point is, I am "reducing" the name space I am searching by specifying:
1) The first 3 chars of the address: 12g
2) The range of addresses I want to match.
It's not much of a reduction, and I'll have to be lottery-winning lucky, but you know what? It runs on my machine 24/7, and it's fine. If it hits, it hits.
What I want is for one of the mathematicians on the forum to explain why EKs approach is any more efficient than mine. As far as I can see, he can only compare a few million keys from a rendezvous point. He can do it very quickly, I grant that, but give me better hardware and I can generate more keys in Vanitygen too
![Smiley](https://bitcointalk.org/Smileys/default/smiley.gif)
Anyhow, mine is the crudest possible type of attack.
But I still don't see much of a difference between this and EKs. And when you get into the numbers, I'll bet that the advantage he has is microscopically insignificant. Anyone care to calculate it?
Rit./