MTF maths nerd

  • 3 Posts
  • 82 Comments
Joined 2 months ago
cake
Cake day: June 4th, 2026

help-circle


  • My ex and I broke up for a few reasons.

    First I think we couldnt handle conflict, in the sense of bringing it up even if it was needed.

    Second, we lived far away. This one definitely effected it a lot, as its hard to not see them as a friend u meet up with occasionally.

    Third, I came out as trans, so we both made the decision it was best to move on since my ex is straight.

    Currently we are just friends, which is for the better.








  • With regards to extracting the private key from the public key, to my knowledge there is shors algorithm that runs in polynomial time on a quantum computer that solves integer factorisation.

    Solve integer factorisation in P and you break RSA in P. I believe there are similar P algorithms that run on quantum computers for the discrete logarithm problem and elliptic curve discrete logarithm problem.

    In this sense, if you scale quantum computers resources enough you break modern asymmetric cryptography.

    With regards to breaking AES: Quantum computers halve the security. So 256 bit security goes to 128 bits. Still secure.

    AES 128 goes to 64 bits of security. Hmmm maybe not secure anymore. Have a read of post quantum cryptography and shors algorithm to see what im on about

    EDIT: added important details

    Edit 2: so so many typos