wireguard-vanity-address

Thanks, great question! In short: I got obsessed by making it as fast as possible and read a ton of elliptic curve cryptography papers. It was a journey that started from reading WireGuard kernel sources, then I was thinking about deriving IPv6 address from peer key, left a random comment on a dated gist https://gist.github.com/artizirk/c91e4f8c237dec07e3ad1b286f1... from which I learned about vanity key concept. I naturally enjoy doing performance optimization work so when I discovered incremental approach idea here https://github.com/warner/wireguard-vanity-address/pull/15 I decided to create my own tool. I've implemented first version of https://github.com/AlexanderYastrebov/wireguard-vanity-key and then continuously profiled it to improve performance. From profiling I saw that field inversion and multiplication are the main operatio

another dangerous toy I particularly enjoy, vanity keys: https://github.com/warner/wireguard-vanity-address Although not as dangerous since the entropy of the rng is (mostly?) still there. If I'm doing the handwaving right, it's base64 where each char contains 6 bits, so you reduce the effective keysize to 256-6*$num_chars -- cryptographers tell me how wrong I am :)

> "wireguard-vanity-address[0] — generate Wireguard keypairs with a given prefix string" generating 4-5 character-prefixed keys seems to up the chances of collision by many orders of magnitude, right? but even so, is that enough of a concern to not use such a tool? [0] https://github.com/warner/wireguard-vanity-address