Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Francesco Antognazza

dblp:292/6170 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
0000-0003-3480-486XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 87% Reconfigurable computing and FPGAs · 13%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography
code-based key encapsulation
0.912025
An Efficient and Unified RTL Accelerator Design for HQC-128, HQC-192, and HQC-256 · IEEE Trans. Computers 2025
Cryptographic primitives and cryptanalysis › post-quantum cryptography › code-based cryptography
HQC
0.912025
An Efficient and Unified RTL Accelerator Design for HQC-128, HQC-192, and HQC-256 · IEEE Trans. Computers 2025
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.912025
An Efficient and Unified RTL Accelerator Design for HQC-128, HQC-192, and HQC-256 · IEEE Trans. Computers 2025
Hardware accelerators and domain-specific architectures
cryptographic accelerator
0.912025
An Efficient and Unified RTL Accelerator Design for HQC-128, HQC-192, and HQC-256 · IEEE Trans. Computers 2025
Hardware accelerators and domain-specific architectures › cryptographic accelerator
post-quantum cryptography accelerator
0.912025
An Efficient and Unified RTL Accelerator Design for HQC-128, HQC-192, and HQC-256 · IEEE Trans. Computers 2025
Reconfigurable computing and FPGAs
FPGA implementation
0.312025
An Efficient and Unified RTL Accelerator Design for HQC-128, HQC-192, and HQC-256 · IEEE Trans. Computers 2025

Methods — techniques the papers use, named apart from their topics

runtime parameter selection · 1.7RTL design · 1.7
YearPublicationVenuePosition
2025 An Efficient and Unified RTL Accelerator Design for HQC-128, HQC-192, and HQC-256
abstract
In the Post-Quantum Standardization (PQC) process held by the National Institute of Standards and Technology (NIST), the final round of evaluation of the asymmetric cryptographic schemes Classic McEliece, BIKE and HQC will elect the alternative Key Establishment Mechanism (KEM) to the FIPS203standard CRYSTALS-Kyber. In this work we present two configurations of a RTL hardware design of the HQC candidate, either optimized for devices exclusively working with client-server style protocols, or a unified accelerator compatible with all KEM operations, i.e. Key Generation, Encapsulation, and Decapsulation. Our designs are compatible with all the parameter sets defined by the HQC specification, providing security margins equivalent to the ones ofAES-128,AES-192, andAES-256based on a selection made at runtime. We are providing an extensive comparison with the current state-of-the-art RTL hardware designs for Artix-7 FPGAs of the schemes in the PQC process, introducing a new metric to evaluate the area utilization, historically a challenging task for such devices made of heterogeneous resources, and determining that HQC has by far the best figures among the code-based candidates in terms of latency, area occupied and efficiency, and even comparable with the lattice-based CRYSTALS-Kyber when using the parameters with lowest security margin.
Francesco Antognazza, Alessandro Barenghi, Gerardo Pelosi
IEEE Trans. Computers1
2023 A Flexible ASIC-Oriented Design for a Full NTRU Accelerator
abstract
Post-quantum cryptosystems are the subject of a significant research effort, witnessed by various international standardization competitions. Among them, the NTRU Key Encapsulation Mechanism has been recognized as a secure, patent-free, and efficient public key encryption scheme. In this work, we perform a design space exploration on an FPGA target, with the final goal of an efficient ASIC realization. Specifically, we focus on the possible choices for the design of polynomial multipliers with different memory bus widths to trade-off lower clock cycle counts with larger interconnections. Our design outperforms the best FPGA synthesis results at the state of the art, and we report the results of ASIC syntheses minimizing latency and area with a 40nm industrial grade technology library. Our speed-oriented design computes an encapsulation in 4.1 to 10.2μs and a decapsulation in 7.1 to 11.7μs, depending on the NTRU security level, while our most compact design only takes 20% more area than the underlying SHA-3 hash module.
Francesco Antognazza, Alessandro Barenghi, Gerardo Pelosi, Ruggero Susella
ASP-DAC1
2023 An Efficient Unified Architecture for Polynomial Multiplications in Lattice-Based Cryptoschemes
abstract
The significant effort in the research and design of large-scale quantum computers has spurred a transition to post-quantum cryptographic primitives worldwide. The post-quantum cryptographic primitive standardization effort led by the US NIST has recently selected the asymmetric encryption primitive Kyber as its candidate for standardization. It has also indicated NTRU, another lattice-based primitive, as a valid alternative if intellectual property issues are not solved. Finally, a more conservative alternative to NTRU, NTRUPrime was also considered as an alternate candidate, due to its design choices which remove the possibility for a large set of attacks preemptively. All the aforementioned asymmetric primitives provide good performances, and are prime choices provide IoT devices with post-quantum confidentiality services. In this work, we propose a unified design for a hardware accelerator able to speed up the computation of polynomial multiplications, the workhorse operation in all of the aforementioned cryptosystems, managing the differences in the polynomial rings of the cryptosystems. Our design is also able to outperform the state of the art designs tailored specifically for NTRU, and provide latencies similar to the symmetric cryptographic elements required by the scheme for Kyber and NTRUPrime.
Francesco Antognazza, Alessandro Barenghi, Gerardo Pelosi, Ruggero Susella
ICISSP1