-snip-
then if a quantum computer, does not help solve the fastest hashes, the only option would be to find a weakness in the elliptic curve generated by the EDCSA is that correct?
Shor's algorithm is good at finding the private key for a given public key. The addresses bitcoin uses however have an extra layer of protection until they are used for the first time, this layer are the different hashes. A quantum computer would be dangerour development for all eliptic curve crypto used, not only for crypto currencies like bitcoin.
But from what I've read about this algorithm, it uses a random value generated by k, but random really.
No k must not be random, its just important that its not reused. Its possible to use non random k values to limit the chances of a reusing k. Reusing k leaks the private key. This is an implementation weakness.
Also I have to say I read about a weakness that affects wallets that are generated in Java, it is not impossible, but from what little I've read still relies on very robust protocols
Yes, but thats an implementation weakness as well, not one of eliptic curves. It also does not help to find addresses. The weakness is based on a bad random number generator. If you only use 2
32 different combinations its much more likely to run into collisions. Its like playing with a broken dice that gives certain numbers a higher chance. As such these number will come more often. It does not make dices in general broken.
Thanks again for your time, I just want to understand a bit more all related to btc
Maybe the following can help
video ->
https://media.ccc.de/v/31c3_-_6369_-_en_-_saal_1_-_201412272145_-_ecchacks_-_djb_-_tanja_lange#videoslides ->
https://events.ccc.de/congress/2014/Fahrplan/system/attachments/2501/original/20141227.pdfIt might also be better to discuss this in a different thread as we are drifting away from vanity address generation quickly.