-
Notifications
You must be signed in to change notification settings - Fork 9
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Top to bottom review #74
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Rest of the changes look good to me.
|
||
There is ongoing discussion about whether to use the term "post-quantum". "quantum ready". or "quantum resistant" to describe algorithms that resist CRQCs, and a consensus has not yet been reached. It is important to clarify that "post-quantum" refers to algorithms designed to withstand attacks by CRQCs and classical computers alike. These algorithms are based on mathematically hard cryptographic problems that neither CRQCs nor classical computers are expected to break. The term "quantum resistant" or "quantum ready" are generally used for algorithms which are synonymous with "post-quantum" algorithms. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Could you clarify the reason for removing the following line: 'The term "quantum resistant" or "quantum ready" are generally used for algorithms which are synonymous with "post-quantum" algorithms'?"
It was discussed in the WG to retain these terms.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I felt this was covered sufficiently in paragraph 4 of Section 1 (reproduced below), and this was mostly repeating that information. I agree it's worth mentioning that all those terms are used!
PQC is sometimes referred to as "quantum-proof", "quantum-safe", or
"quantum-resistant". It is the development of cryptographic
algorithms designed to secure communication and data in a world where
quantum computers are powerful enough to break traditional
cryptographic systems, such as RSA and ECC. PQC algorithms are
intended to be resistant to attacks by quantum computers, which use
quantum-mechanical phenomena to solve mathematical problems that are
infeasible for classical computers.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks, I will re-add the line as follows:
This document uses any of these terms interchangeably to refer to such algorithms.
No description provided.