MPREVE

a: Is any of this wrong? My vague understanding is this: most or all current cryptography in use is based around hidden subgroup problems, such as factoring. These problems are suspected to be intermediate between P and NP, and they're particularly susceptible to a quantum computer framework via Shor's algorithm.

b. So, is the main goal of post-quantum crypto to discover a more robust kind of problem that wouldn't be weaker to the QC framework?

c. If this is still an outstanding problem-- why? It seems like many NP-complete problems could work.

d. What are the most important open problems in the field?

Hi Maria,

I'm a student finishing up my bachelor's in math, and I have a 12-year-old sister who's interested in math as well. She enjoys interesting concepts, but doesn't like actually solving all the algorithmic problems she's given in school. How can I best support her and show her the parts of math that she'll enjoy?

yes, that's what I meant-- thanks