Importing BTC BIP38 Paper Walet into Electrum 3.3.4 does not work

Trying to complete the import of BTC from a BIP38 paper wallet into an Electrum wallet

About an hour ago I opened Electum 3.3.4, created a new wallet, set a password and saved a copy of the new wallet on a USB stick.

Then I clicked the Electum menu options for WALLET, PRIVATE KEYS, IMPORT and pasted the decrypted private key for the BIP38 Paper Wallet into the box that opened and clicked NEXT.

Nothing happened: The block explorer shows that the BTC credit is still in the paper folder and not in the Electrum wallet. I closed and restarted Electrum, but the same thing.

When I decrypted the BIP38 paper wallet to get its private key, I used bitaddress.org offline, which gave me a table with a number of options for the decrypted private key.

The specific key I selected, copied and pasted into Electrum was the one under the heading "WIF compressed format 52 character base 58 starting with & # 39; K & # 39; or & # 39; L & # 39;".

Would that be what needs to be corrected?

A second thing is that when I click on the big green button on the Electrum server (I have no idea what it's called ha), the overview shows "Status" as connected to 10 nodes. The server is noveltybobble.coinjoined.com and the blockchain is 565750. When I first checked this when importing the BIP38 paper wallet, it was set to automatic, not to a specific server

I read that Electrum servers can be a problem processing transactions and I think this could possibly be a problem here?

Any suggestions or help would be appreciated

ty

Vulnerability – What should a good report contain when it is sent to whom (e.g. paper skeleton)?

For some reason, this question is not about reporting vulnerabilities, like many of the questions I've read, but about writing good, professional paper detailing all the details about Hole.

I can imagine a few:

  • PoC
  • Date of writing
  • What else?

Thank you in advance.

Algorithms – how did the authors of the AKS paper reach the upper limit for r? and what does the multiplicative order have to do with anything?

I recently read the newspaper "PRIMES is in P", but unfortunately many steps were skipped, which led to confusion. My main problem is the upper limit of r, which was not explained at all in the work (I don't see the connection of these limits with the running time of the algorithm), for example how they came to the upper limit O (log ^ 5 n) for r, why is it exactly this number? why not O (log ^ 2 n) or something else. In addition, they had specified a condition for r in the second step of the algorithm. They wanted the order of r mod n to be greater than log ^ 2 n, but I don't understand why this has to do with the polynomial runtime or why it has to be greater than log ^ 2 n.

Can someone please explain why this is true? or how to derive these numbers?

Education – Is it easier to publish a paper in a respected magazine than to ask a question on this website without deleting it?

Thank you for your reply to Mathematics Stack Exchange!

  • Please be sure answer the question. Provide details and share your research!

But avoid

  • Ask for help, clarify, or respond to other answers.
  • Make statements based on opinions; Support them with references or personal experiences.

Use MathJax to format equations. MathJax reference.

For more information, see our tips on writing great answers.

metric spaces – can someone help me find the English version of this paper?

Thank you for your reply to Mathematics Stack Exchange!

  • Please be sure answer the question. Provide details and share your research!

But avoid

  • Ask for help, clarify, or respond to other answers.
  • Make statements based on opinions; Support them with references or personal experiences.

Use MathJax to format equations. MathJax reference.

For more information, see our tips on writing great answers.