Merge pull request #9 from ProgramMax/prefer-american-english

SHA: 604c91d
Reason: push, by verocri

Co-authored-by: github-actions[bot] <41898282+github-actions[bot]@users.noreply.github.com>

Author: verocri

index.html

@@ -8,7 +8,7 @@
   <meta content="Bikeshed version 86e3be07a, updated Tue Nov 18 16:58:08 2025 +0000" name="generator">
   <link href="https://w3c.github.io/security-guidelines-cryptography" rel="canonical">
   <link href="https://www.w3.org/2008/site/images/favicon.ico" rel="icon">
-  <meta content="752a807fbd30df16135495306dc12a5c795ed96d" name="revision">
+  <meta content="604c91dd935583f435b25bd308f455123e61ddb1" name="revision">
   <meta content="dark light" name="color-scheme">
   <link href="https://www.w3.org/StyleSheets/TR/2021/dark.css" media="(prefers-color-scheme: dark)" rel="stylesheet" type="text/css">
 <style>/* Boilerplate: style-autolinks */
@@ -656,7 +656,7 @@ <h2 class="heading settled" data-level="6" id="post-quantum-cryptography"><span
 Post-quantum cryptography refers to cryptographic algorithms that are designed to be secure against attacks from quantum computers. Quantum computers have the theoretical potential to break many of the widely used cryptographic algorithms, such as RSA and ECC, which rely on the difficulty of certain mathematical problems (integer factorization and discrete logarithm) that can be efficiently solved by quantum algorithms like Shor’s algorithm.
 
 
-   <p>To address this threat, it is necessary to develop new cryptographic algorithms that are resistant to quantum attacks. These algorithms are based on mathematical problems that are believed to be hard for both classical and quantum computers to solve, and define new cryptography branches such as lattice-based cryptography, code-based cryptography, multivariate polynomial cryptography, and hash-based cryptography.</p>
+   <p>To address this threat, it is needed to develop new cryptographic algorithms that are resistant to quantum attacks. These algorithms are based on mathematical problems that are believed to be hard for both classical and quantum computers to solve, and define new cryptography branches such as lattice-based cryptography, code-based cryptography, multivariate polynomial cryptography, and hash-based cryptography.</p>
    <p>NIST is currently in the process of standardizing post-quantum cryptographic algorithms through a multi-round competition. The goal is to identify and standardize algorithms that can provide strong security against quantum attacks while also being efficient and practical for real-world applications. The selected algorithms will be used to replace or supplement existing cryptographic algorithms (in hybrid solutions) in various applications, including digital signatures and key exchange protocols.</p>
    <h2 class="heading settled" data-level="7" id="cryptography-usage"><span class="secno">7. </span><span class="content">Cryptography usage</span><a class="self-link" href="#cryptography-usage"></a></h2>