16
A Cryptography Engineer’s Perspective on Quantum Computing Timelines (words.filippo.io)
submitted 5 months ago by to c/notawfultech@awful.systems
9 comments fedilink hide all child comments
 

I'm not gonna dig up the links since I'm sure y'all're already tired of talking about quantum computing. I am going to insist that, while I professionally disagree with Filippo about plenty of things, I do not see any mistakes in their analysis here. Please start thinking about post-quantum cryptographic tooling today.

you are viewing a single comment's thread
view the rest of the comments
[–] 2 points 5 months ago* (3 children)

Not sure what you think my "different premises" are? Also I obviously already know that Shor's algorithm solves the discrete log problem. I don't know why you phrased your comment assuming I'm an idiot.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 3 child comments
    •
  • [–] 6 points 5 months ago

    I will say that, speaking as an idiot, I appreciated the information and the accessibility of many of these very technical conversations here is one of the elements of this community I appreciate. I would be very surprised if it had been meant as any kind of dig instead of explicitly clarifying a usually-unstated bit of context.

  • permalink
  • fedilink
  • source
  • parent
  • [–] [S] 4 points 5 months ago (1 child)

    Would an idiot know the difference between abelian and non-abelian group theory? I wasn't trying to underestimate you; I agreed with your position and provided a tangent that opens up your position without compromising it. Next time I'll explicitly say "yes, and" if that will help.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 1 child comment
    •
  • [–] 1 point 5 months ago

    Ok next time you should really not do the "lucky 10000" bit, it comes off as very condescending especially if the person you're talking to already knows the thing you're telling them.

  • permalink
  • fedilink
  • source
  • parent