<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>P. Thiao);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Performance Evaluation and Profiling of Kyber for Post-quantum Cryptography in HPC Environments</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Penda Thiao</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Demba Sow</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Cheikh Anta Diop University</institution>
          ,
          <addr-line>Dakar</addr-line>
          ,
          <country country="SN">Senegal</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Facing the growing threat posed by quantum computers, post-quantum cryptography (PQC) is becoming essential for the security of Artificial Intelligence (AI) systems deployed in High-Performance Computing (HPC) environments. This article presents an in-depth performance analysis of the Kyber algorithm, a leading standard for post-quantum key exchange, crucial for safeguarding AI data and models. We investigate both the reference C implementation and the optimized AVX2 version, for multiple security levels (Kyber-512, Kyber-768, and Kyber-1024). Benchmarks focus on latency, bandwidth consumption, memory footprint, and CPU cost under realistic HPC conditions. Our results highlight the trade-ofs between security and computational performance, and provide recommendations for eficient and secure integration of Kyber into HPC applications, essential for the resilience of AI systems in the quantum era.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;HPC</kwd>
        <kwd>Kyber</kwd>
        <kwd>AVX2</kwd>
        <kwd>PQC</kwd>
        <kwd>AI</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>In summary, this article proposes:
• a detailed characterization of Kyber’s performance profile (reference C implementation vs.
optimized AVX2 version);
• an analysis of security/performance trade-ofs based on NIST levels;
• and concrete recommendations for optimized implementation, suitable for direct integration into
modern HPC environments.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Benchmarking Methodology and Experimental Environment</title>
      <p>To provide a comprehensive evaluation of Kyber’s performance, the benchmarks are structured around
several axes: analysis of the speed of primary cryptographic operations, network latency, bandwidth
consumption, and resource utilization (CPU/memory). Each test follows measurement protocols adapted
to HPC environments to ensure the relevance and reliability of the results.</p>
      <sec id="sec-2-1">
        <title>2.1. Experimental Environment</title>
        <sec id="sec-2-1-1">
          <title>2.1.1. Hardware Platform</title>
          <p>Performance tests were conducted on a physical machine with the following characteristics:
• Architecture: x86_64 (64-bit)
• Processor: Intel(R) Core(TM) i5-6300U CPU @ 2.40GHz
• Cores and Threads: 2 physical cores, 4 threads (2 threads per core)
• Frequency: 2.40 GHz (base), up to 3.00 GHz (turbo)
• Caches:
– L1d: 64 KiB (2 instances)
– L1i: 64 KiB (2 instances)
– L2: 512 KiB (2 instances)
– L3: 3 MiB (1 instance, shared)
• Memory: 8 GB DDR4
• Operating System: Ubuntu 22.04 LTS (64-bit)
• Compiler: GCC 11.4.0</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>2.1.2. Kyber Implementation</title>
          <p>Benchmarks were conducted using two variants of Kyber’s oficial C implementation, covering
Kyber512, Kyber-768, and Kyber-1024 versions:
• Reference Kyber Version: Oficial NIST implementation (Round 3 or FIPS 203 draft)
• Optimized AVX2 Version: Optimized implementation leveraging AVX2 instructions to improve
performance on compatible architectures
• Compilation Options: -O3 -march=native
• Complementary Libraries: MPICH for network tests, Python 3.x for vector analysis</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Performance Benchmarking Methodology (Cycle Counting)</title>
        <p>The performance of cryptographic operations is measured by processor cycle counting,
using architecture-specific high-resolution timers (RDTSC on x86, or clock_gettime with
CLOCK_MONOTONIC for portability). Each operation is executed between 10,000 and 100,000 times
to ensure statistical robustness. The median number of cycles is retained to limit the impact of system
noise.</p>
        <p>The tested operations include:
Aspect
Key Generation
Encapsulation
Decapsulation
Secret Consistency
Invalid Ciphertext Rejection
Determinism
✓
✓
✓
✓
✓
✓
✓
✓
✓
✓
✓
✓
✓
✓
✓
✓
✓
✓</p>
        <p>Result
0 error
0 error
0 error
100%
OK
Yes
• High-level KEM operations:
key generation (crypto_kem_keypair),
encapsulation (crypto_kem_encapsulate),
decapsulation (crypto_kem_decapsulate)
• Low-level polynomial operations: Number Theoretic Transform (NTT), Inverse NTT, polynomial
multiplication, matrix generation, noise generation
• Internal CPA-secure operations: CPA key generation, CPA encryption, CPA decryption</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Validation and Analysis of Test Vectors</title>
        <p>The validation of test vectors was performed to ensure implementation conformity and the
cryptographic quality of the outputs. Vectors are generated via a deterministic PRNG based on SHAKE128, in
accordance with the Kyber specification, ensuring result reproducibility.</p>
        <p>Tests are automated by script, executing the test binaries for each Kyber parameter.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Analysis and Validation of Test Vectors</title>
      <p>A comprehensive validation of the test vectors was carried out to ensure the implementation’s
compliance and to analyze its cryptographic properties. The test vectors were generated using a deterministic
PRNG based on SHAKE128, which ensures the reproducibility of results across diferent platforms.</p>
      <sec id="sec-3-1">
        <title>3.1. Summary of Test Vector Generation</title>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Implementation Compliance Validation</title>
        <p>Component
Kyber-512</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Verification of Key and Ciphertext Sizes</title>
        <p>The measured sizes of keys and ciphertexts from the test vectors confirm the theoretical specifications
for each Kyber parameterization, as detailed in Table 3.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Entropy and Randomness Quality Analysis</title>
        <p>A statistical analysis of the hexadecimal character distribution in the generated keys, ciphertexts, and
shared secrets was performed to evaluate the quality of the randomness. The analysis, conducted by
parameter size, shows:
• Uniform Distribution: The coeficients are well distributed across the 16 hexadecimal characters
(0-F), indicating a robust PRNG.
• High Entropy: Entropy values consistently approach the theoretical maximum (4.0 bits per
hexadecimal character), a sign of excellent randomness.
• Absence of Bias: No statistical bias or recurring patterns were detected, which is crucial for
cryptographic security.
• Consistency Across Parameters: The quality of randomness is uniformly maintained for</p>
        <p>Kyber-512, Kyber-768, and Kyber-1024.
• Eficiency: The analysis confirms an eficiency exceeding 97% compared to the theoretical
maximum entropy.</p>
        <p>The detailed analysis by component is illustrated in Figures 1 to 4, presenting the entropy for each
data type and parameterization.</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.5. Key Findings from Test Vector Analysis</title>
        <p>The in-depth analysis of the test vectors conclusively demonstrates:
• Perfect Implementation Compliance: No errors were detected during end-to-end tests across all
parameters.
• Excellent Randomness Quality: All generated data (keys, ciphertexts, shared secrets) exhibit the
expected entropy properties, which are essential for security.
• Standard Compliance: The reference Kyber implementation fully adheres to NIST PQC
specifications for cryptographic outputs.
• Deterministic Reproducibility: Identical seeds consistently produce the same outputs, regardless
of the execution environment.
• High Entropic Eficiency: All parameters achieve over 97% of the theoretical maximum
hexadecimal character entropy, validating the quality of the internal PRNG.
• Scalability of Quality: Cryptographic quality remains constant, with no loss of randomness, even
as key and ciphertext sizes increase.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Performance Results (Cycle Measurements)</title>
      <p>This section delves into a thorough analysis of the CRYSTALS-Kyber algorithm’s performance, measured
in clock cycles. We’ll begin by examining the high-level Key Encapsulation Mechanism (KEM) operations
for each Kyber parameterization (Kyber-512, Kyber-768, Kyber-1024), highlighting how increased
security impacts computational cost.</p>
      <p>Next, we’ll explore the security-performance trade-of by correlating NIST security levels with
observed cycle costs. A detailed analysis of low-level operations, including scaling behavior and the
performance of fundamental polynomial operations, will be presented to identify potential bottlenecks.</p>
      <p>Finally, we’ll compare the performance of Kyber’s reference implementation with an AVX2-optimized
version, quantifying the eficiency gains achieved through vectorization. Our goal is to provide a
comprehensive understanding of Kyber’s performance characteristics across diferent levels of abstraction
and optimization.</p>
      <sec id="sec-4-1">
        <title>4.1. Performance of High-Level KEM Operations</title>
        <p>The exact median cycle counts for these high-level KEM operations are presented in Table 4, ofering
precise numerical details that complement the visual trends.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Security/Performance Trade-of Analysis</title>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Detailed Analysis of Basic Operations</title>
        <sec id="sec-4-3-1">
          <title>4.3.1. Scaling Behavior</title>
        </sec>
        <sec id="sec-4-3-2">
          <title>4.3.2. Low-Level Polynomial Operations</title>
          <p>Kyber’s fundamental polynomial operations exhibit varying scaling behaviors. Some, like NTT, are
more eficient with larger parameters, suggesting optimization or cache efects, as illustrated in Figure 8.</p>
          <p>The median cycle counts for these core polynomial operations across diferent Kyber
parameterizations are detailed in Table 6.</p>
        </sec>
        <sec id="sec-4-3-3">
          <title>4.3.3. Detailed Operation Breakdown</title>
        </sec>
        <sec id="sec-4-3-4">
          <title>4.3.4. Analysis by Operation Category</title>
          <p>Figure 10 presents the contribution of each operation category (polynomial arithmetic, sampling,
compression, etc.) to the total cost, highlighting the dominant areas.</p>
        </sec>
        <sec id="sec-4-3-5">
          <title>4.3.5. Heatmap Analysis</title>
        </sec>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Performance Comparison: Reference vs. AVX2 Implementation</title>
        <p>This section presents a comparative analysis of Kyber’s performance between the reference
implementation and the version optimized with AVX2 instructions. Measurements are expressed in processor
cycles, and performance gains are quantified as a percentage.</p>
        <sec id="sec-4-4-1">
          <title>4.4.1. High-Level KEM Operations</title>
        </sec>
        <sec id="sec-4-4-2">
          <title>4.4.2. Polynomial and Compression/Encoding Operations</title>
          <p>Low-level operations, such as NTT, polynomial multiplication, and compression/decompression
functions, are particularly sensitive to vectorial optimizations. Table 9 details the gains observed for these</p>
        </sec>
        <sec id="sec-4-4-3">
          <title>4.4.3. Summary of AVX2 Gains</title>
          <p>AVX2
117 100
2 338
2 340
9 580
10 088
11 836
2 134
784
598
112
5 540
4 310
77.28 %
-48.50 %
-46.32 %
96.53 %
96.71 %
96.16 %
98.22 %
93.88 %
91.64 %
67.86 %
92.99 %
95.92 %</p>
          <p>AVX2
26 606
3 472
3 424
332
332
454
38
48
50
36
388
176
In summary, the integration of AVX2 optimizations yields considerable performance gains, particularly
pronounced in fundamental polynomial operations (NTT, multiplication) and
compression/decompression functions. These accelerations result in a drastic reduction in cycle cost for high-level KEM
operations, making Kyber significantly more eficient for HPC applications. The gains are even more
substantial as the security level increases, highlighting the relevance of these optimizations for large-scale
deployments.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Network Latency Results (MPI)</title>
      <p>This section presents the communication latencies measured during Kyber key establishment operations
in an MPI environment. These results quantify the actual impact of PQC on inter-process communication
overhead, a crucial challenge for HPC applications. All measurements were conducted over 1000
iterations, with 10 warm-up rounds to stabilize the system.</p>
      <sec id="sec-5-1">
        <title>5.1. Overall KEM Establishment Latency (RTT)</title>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Latency Component Breakdown</title>
      </sec>
      <sec id="sec-5-3">
        <title>5.3. Impact of Message Size on Latency</title>
        <p>The results show that increasing the Kyber security level primarily increases the latency of
computational phases (key generation, encapsulation, decapsulation). Public key transfer remains negligible
(&lt;1  s), while ciphertext transfer becomes a significant factor, sometimes as important as the
cryptographic operations themselves, especially for Kyber-768 and Kyber-1024. This highlights that, in
MPI communications using Kyber, cryptographic processing and ciphertext transmission are the main
contributors to total latency. The maximum RTT values (from 3.1 to 4.0 ms) reflect the influence of the
system (scheduling, memory management) on extreme cases, particularly for Kyber-1024.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Network Bandwidth Results</title>
      <p>This section analyzes the impact of Kyber key and ciphertext sizes on bandwidth consumption within
the MPI environment. Bandwidth measurements were conducted in parallel with latency benchmarks,
providing a comprehensive view of efective throughput during KEM operations.</p>
      <sec id="sec-6-1">
        <title>6.1. Efective Throughput Analysis</title>
        <p>Efective throughput was measured from the perspective of both MPI ranks to account for potential
network asymmetries and provide a comprehensive view of communication performance.</p>
      </sec>
      <sec id="sec-6-2">
        <title>6.2. Data Transfer Analysis</title>
      </sec>
      <sec id="sec-6-3">
        <title>6.3. Key Bandwidth Learnings</title>
        <p>The bandwidth analysis reveals several key points:
• Stable Throughput: Despite a significant increase in data volume (from 1.57 MB to 3.14 MB total),
the efective throughput remains remarkably stable around 4.8–5.0 MB/s for all parameterizations.
• Network Symmetry: The minimal diference between Rank 0 and Rank 1 perspectives (&lt;0.1
• Scalable Eficiency: Eficiency (MB/s per KB of data) shows that higher parameterizations
maintain proportional performance, demonstrating the good scalability of the communication
infrastructure.
• Practical Implications: The stability of the throughput suggests that the network infrastructure
can absorb the increased volume associated with higher security levels without proportional
degradation of throughput.
7. Network Latency Results (MPI) - Reference vs. AVX2 Comparison
This section presents a comparison of communication latencies measured during Kyber key
establishment operations in an MPI environment, highlighting the gains provided by AVX2 optimizations. All
measurements were conducted over 1000 iterations, with 10 warm-up rounds.</p>
      </sec>
      <sec id="sec-6-4">
        <title>7.1. Overall KEM Establishment Latency (RTT) - Comparison</title>
        <p>AVX2</p>
      </sec>
      <sec id="sec-6-5">
        <title>7.2. Detailed Latency Component Breakdown - Comparison</title>
        <sec id="sec-6-5-1">
          <title>7.2.1. Detailed Latency Gains</title>
        </sec>
      </sec>
      <sec id="sec-6-6">
        <title>7.3. Discussion of Latency Gains</title>
        <p>AVX2 optimizations have had a transformative impact on the latencies of Kyber operations. As shown in
Tables 14 and 15, purely computational phases such as "key generation, encapsulation, and decapsulation
saw their average latency dramatically reduced (between 73% and 83</p>
        <p>Interestingly, "public key and ciphertext transfer times also showed notable reductions" (between 17%
and 76%). While these operations are primarily network bandwidth-related, the reduction in intensive
cryptographic processing time potentially frees up CPU resources faster, allowing for more eficient
management of communication operations by MPI ranks. This could explain these unexpected gains in
transfer phases, suggesting that even "network" operations were previously slightly CPU-bound.</p>
        <p>It is important to note the behavior of maximum RTT values. For Kyber-512 and Kyber-1024, the
maximum RTT was reduced, but for Kyber-768, it slightly increased (-49.7% gain actually means an
increase of nearly 50%). This may indicate higher variability in certain executions or the influence of</p>
        <p>AVX2
other system factors (scheduling, resource contention) that can have a more pronounced impact on
extreme values, even with faster cryptographic operations. This warrants further investigation if these
peaks are reproducible.</p>
        <p>These results confirm that AVX2 optimizations are not only efective in terms of CPU cycles but also
directly translate into tangible performance gains in a distributed communication context.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>8. Network Bandwidth Results - Reference vs. AVX2 Comparison</title>
      <p>This section analyzes the impact of AVX2 optimizations on efective throughput within the MPI
environment.</p>
      <sec id="sec-7-1">
        <title>8.1. Efective Throughput Analysis - Comparison</title>
      </sec>
      <sec id="sec-7-2">
        <title>8.2. Discussion on Bandwidth</title>
        <p>The bandwidth analysis, presented in Table 17, reveals a very substantial gain with the AVX2
implementation. Contrary to an initial expectation where bandwidth would be predominantly
network-limited, AVX2 optimizations have significantly increased efective throughput: * For Kyber-512,
bandwidth increased from approximately 4.68 MB/s to 21.80 MB/s, an increase of about 366%.
* For Kyber-768, it increased from 5.00 MB/s to 18.36 MB/s, an increase of about 267%.
* For Kyber-1024, it increased from 4.99 MB/s to 23.77 MB/s, an increase of about 376%.</p>
        <p>These considerable gains indicate that, in the reference version, the bottleneck was not solely the
network, but a combination of CPU-intensive operations and communication. The significant reduction
in computation time due to AVX2 optimizations allowed the system to process cryptographic operations
much faster, thereby freeing up the communication pipeline and enabling much higher throughputs
that were likely limited by the speed of the cryptographic computations themselves in the reference
version.</p>
        <p>The throughput symmetry between Rank 0 and Rank 1 is maintained, which is a good indication of
the robustness of the test environment and the implementation. These results demonstrate that AVX2
optimizations are essential for fully leveraging network capabilities in applications where post-quantum
cryptographic operations are integrated into communications.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>9. CPU Profiling Analysis with perf</title>
      <p>To identify the main computational bottlenecks in Kyber, a detailed CPU profiling was conducted using
the Linux tool perf. This analysis highlights the most CPU-intensive functions and guides optimization
eforts for HPC environments.
3.08
4.49
6.04</p>
      <sec id="sec-8-1">
        <title>9.1. Profiling Methodology</title>
        <p>Profiling was performed with perf record on the speed benchmarks (test_speed512,
test_speed768, test_speed1024) for each Kyber parameterization. Measurements focused on
CPU cycles, with call trace recording for fine-grained function analysis.</p>
      </sec>
      <sec id="sec-8-2">
        <title>9.2. CPU Hotspot Analysis</title>
        <p>The results show a strong concentration of CPU usage on a small number of main functions, consistently
across all parameterizations. Table 18 summarizes the most resource-consuming functions.
9.3. Learnings and Recommendations
• Keccak (SHAKE128/256) is the primary bottleneck (21–27% of CPU time), used for deterministic
key generation, encapsulation, and internal hashing functions.
• Montgomery and Barrett reduction together account for nearly 28% of CPU time, essential
for modular arithmetic in polynomial operations.
• NTT and invNTT (forward and inverse number theoretic transform) total 15–20% of CPU time,
with a relative cost that decreases for larger parameterizations due to better cache utilization.
• Priority Optimization: Accelerating Keccak (via vectorization, hardware SHA-3 instructions,
or GPU ofload) and modular arithmetic (SIMD, assembly) would yield the most significant gain.
• Algorithmic Stability: The cost distribution remains stable regardless of the security level,
which facilitates large-scale optimization.</p>
      </sec>
      <sec id="sec-8-3">
        <title>9.4. Estimated Memory Footprint</title>
        <p>10. Performance Summary and Recommendations
This section provides a synthesis of the experimental results and highlights key trends for deploying
Kyber in HPC environments.
10.1. Overall Performance Summary
The measurements performed show:
• Latency (Average RTT, 1000 iterations):
– Kyber-512: 319 s
– Kyber-768: 434 s
– Kyber-1024: 599 s
• Efective Network Throughput: stable around 4.8–5.0 MB/s, regardless of parameter size.
• Network Transfer: public key transfer time remains negligible (&lt;1  s), while ciphertext transfer
becomes significant for higher parameters.
• Cryptographic Operation Overhead: almost all of the total latency is due to cryptographic
computations (key generation, encapsulation, decapsulation).
• Cryptographic Quality: perfect validation of test vectors, entropy greater than 97% of the
theoretical value, full compliance with NIST PQC specifications.
10.2. Trends and Practical Implications
Scalability and Overhead
• Total latency increases predictably with the security level: +36% between Kyber-512 and Kyber-768,
+38% between Kyber-768 and Kyber-1024.
• Network throughput remains stable despite doubling the data volume between Kyber-512 and</p>
        <p>Kyber-1024, demonstrating the robustness of the HPC infrastructure to PQC.</p>
        <p>• Memory footprint increases linearly with the security level (3.2 kB to 6.3 kB per KEM operation).
Identified Bottlenecks
• Cryptographic operations dominate (95%+ of total time).
• Ciphertext transfer becomes a non-negligible factor for higher security levels.
• Some extreme latency values (observed in max RTTs) can be attributed to system factors, such
as task scheduling or memory management, and should be considered for latency-sensitive
applications.
10.3. Recommendations for HPC Deployment
• Kyber-512 (NIST Level 1): To be preferred for HPC applications where performance is paramount
and moderate security is suficient. Very low latency suitable for frequent exchanges.
• Kyber-768 (NIST Level 3): Optimal security/performance compromise for most scientific and
industrial uses.
• Kyber-1024 (NIST Level 5): Reserved for use cases requiring maximum security, at the cost of
increased latency and memory.</p>
        <p>Practical Advice
• Current HPC network infrastructure easily supports the data volumes generated by Kyber, even
at the highest security levels.
• Consider the linear growth of memory for massive deployments (thousands of simultaneous
connections).
• Budget 300 to 600 s per key establishment, depending on the security level.
• To minimize latency outliers, optimize system management and process scheduling.</p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>Conclusion</title>
      <p>This study rigorously evaluated and profiled the performance of the Kyber post-quantum key exchange
algorithm in a High-Performance Computing (HPC) environment, focusing on both reference and
optimized (AVX2) implementations across its diferent security levels (Kyber-512, Kyber-768, Kyber-1024).
Our in-depth analyses of metrics such as latency, bandwidth, and CPU footprint clearly demonstrated
the inherent trade-ofs between security and cryptographic performance.</p>
      <p>The obtained results highlight the critical importance of hardware optimizations, particularly the
integration of AVX2 instructions, which yielded substantial performance gains, significantly reducing
KEM operation latency and increasing efective throughput. This improvement is crucial for the
adoption of post-quantum cryptography in demanding infrastructures like supercomputers, where
eficiency is paramount. By identifying major CPU "hotspots," we provide concrete avenues for future
specific optimizations.</p>
      <p>Ultimately, this work ofers a detailed characterization of Kyber’s behavior under real HPC conditions,
iflling an important gap in the literature. The information and recommendations stemming from this
research are essential to guide system architects and developers in the transition to a post-quantum
cryptographic era, ensuring both security against emerging quantum threats and the preservation of
HPC system operational eficiency.</p>
    </sec>
    <sec id="sec-10">
      <title>Declaration on Generative AI</title>
      <p>The authors have not employed any Generative AI tools.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>N. I.</surname>
          </string-name>
          <article-title>of Standards, Technology, Post-quantum cryptography standardization</article-title>
          , https://csrc.nist.gov/ Projects/post-quantum-cryptography,
          <year>2024</year>
          . Accessed:
          <fpage>2025</fpage>
          -07-11.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Bos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ducas</surname>
          </string-name>
          , E. Kiltz,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lepoint</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lyubashevsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Schanck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Schwabe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Seiler</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>Stehl'e, Crystals-kyber: a cca-secure module-lattice-based kem</article-title>
          ,
          <source>2018 IEEE European Symposium on Security</source>
          and
          <string-name>
            <surname>Privacy (EuroS&amp;P)</surname>
          </string-name>
          (
          <year>2018</year>
          )
          <fpage>353</fpage>
          -
          <lpage>367</lpage>
          . doi:
          <volume>10</volume>
          .1109/EuroSP.
          <year>2018</year>
          .
          <volume>00031</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Hueber</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>K"ugler</article-title>
          , J. Buchmann,
          <string-name>
            <given-names>P.</given-names>
            <surname>Krausz</surname>
          </string-name>
          , I. von Maurich,
          <string-name>
            <surname>T. P</surname>
          </string-name>
          "oppelmann, W. Schindler,
          <article-title>Performance evaluation of post-quantum cryptography in high-performance computing environments</article-title>
          ,
          <source>Future Generation Computer Systems</source>
          <volume>143</volume>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.future.
          <year>2023</year>
          .
          <volume>01</volume>
          .008.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>N.</given-names>
            <surname>Bindel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Brendel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fischlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Goncalves</surname>
          </string-name>
          ,
          <string-name>
            <surname>D. Stebila,</surname>
          </string-name>
          <article-title>The performance of post-quantum tls 1.3</article-title>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          <article-title>Transactions on Privacy and Security (TOPS) 25 (</article-title>
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>36</lpage>
          . doi:
          <volume>10</volume>
          .1145/3546065.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>G.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Optimizing post-quantum cryptography on intel processors: The case of crystals-kyber</article-title>
          ,
          <source>Computers &amp; Security</source>
          <volume>108</volume>
          (
          <year>2021</year>
          )
          <article-title>102377</article-title>
          . doi:
          <volume>10</volume>
          .1016/j.cose.
          <year>2021</year>
          .
          <volume>102377</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <article-title>Benchmarking post-quantum cryptography in tls: A performance evaluation on various platforms</article-title>
          ,
          <source>in: 2021 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</source>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>1588</fpage>
          -
          <lpage>1595</lpage>
          . doi:
          <volume>10</volume>
          .1109/ TrustCom53375.
          <year>2021</year>
          .
          <volume>00224</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>