[b] Section 1, Introduction: It is well written but it seemingly does not explain why CRQCs can break traditional public-key algorithms. Just because they are faster or more powerful? No really. So, it may be necessary to mention Shor algorithm here, as it theoretically breaks the traditional public-key algorithms, at least for factoring and DL based cryptosystems. Then, once CRQCs are invented, by running Shor algorithms on CRQCs , traditional public-key algorithms can be broken.
((We explain Shor's algorithm in the later section "Threats of CRQCs on Cryptography". The introduction is more for laying out the land for the entire document so purposely chose to omit references to Shor and Grover here))
[b] Section 1, Introduction: It is well written but it seemingly does not explain why CRQCs can break traditional public-key algorithms. Just because they are faster or more powerful? No really. So, it may be necessary to mention Shor algorithm here, as it theoretically breaks the traditional public-key algorithms, at least for factoring and DL based cryptosystems. Then, once CRQCs are invented, by running Shor algorithms on CRQCs , traditional public-key algorithms can be broken.
((We explain Shor's algorithm in the later section "Threats of CRQCs on Cryptography". The introduction is more for laying out the land for the entire document so purposely chose to omit references to Shor and Grover here))