EDBT 2026 Demo / reviewers in the wild / expert
Roberto Maria Avanzi
dblp:08/6941 · also Roberto Avanzi
· DBLP profile ↗
11ranked-venue papers
9as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 7 first-authorTheory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1 · 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
5 papers |
Cryptographic primitives and cryptanalysis · 84% Hardware security and side channels · 16% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Energy-efficient computing · 100% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography |
0.1 | 3 | 2006 | Extending Scalar Multiplication Using Double Bases · ASIACRYPT 2006 Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations · CHES 2004 Countermeasures against Differential Power Analysis for Hyperelliptic Curve Cryptosystems · CHES 2003 |
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
scalar multiplication |
0.1 | 1 | 2006 | Extending Scalar Multiplication Using Double Bases · ASIACRYPT 2006 |
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
hyperelliptic curve cryptography |
0.1 | 2 | 2004 | Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations · CHES 2004 Countermeasures against Differential Power Analysis for Hyperelliptic Curve Cryptosystems · CHES 2003 |
Cryptographic primitives and cryptanalysis › number theory
modular arithmetic |
0.1 | 1 | 2005 | Energy-Efficient Software Implementation of Long Integer Modular Arithmetic · CHES 2005 |
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.1 | 1 | 2005 | Energy-Efficient Software Implementation of Long Integer Modular Arithmetic · CHES 2005 |
Hardware security and side channels › side-channel countermeasures
power analysis countermeasure |
0.0 | 1 | 2003 | Countermeasures against Differential Power Analysis for Hyperelliptic Curve Cryptosystems · CHES 2003 |
Hardware security and side channels
side-channel countermeasures |
0.0 | 1 | 2003 | Countermeasures against Differential Power Analysis for Hyperelliptic Curve Cryptosystems · CHES 2003 |
Cryptographic primitives and cryptanalysis
finite field arithmetic |
0.0 | 1 | 2004 | Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations · CHES 2004 |
Methods — techniques the papers use, named apart from their topics
double-base number system · 0.1software implementation · 0.0field arithmetic optimization · 0.0randomization · 0.0masking · 0.0DPA countermeasures · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Resource-Constrained Encryption: Extending Ibex with a QARMA Hardware AcceleratorabstractThe increasing prevalence of IoT devices calls for the need for strong, but efficient cryptography. In this paper we present two instruction set extensions for the lightweight encryption cipher QARMA-64 to the RISC-V instruction set, implemented for the Ibex core. The first extension performs the entire algorithm in hardware, divided over ten instructions. The second extension takes a more granular approach and instead implements the basic operations that the algorithm uses as custom instructions. The first extension achieves a speedup of ~600x over the software implementation and a binary size reduction of over 2x. It achieves these results at the cost of an added field-programmable gate array (FPGA) utilization over the base Ibex design of 43.9% and 18.7% for, respectively, the number of lookup tables (LUTs) and flip-flops (FFs). The application-specific integrated circuit (ASIC) area for synthesis is increased by 92.4% over the base design. The second extension achieves a speedup of ~19x over the software version while roughly maintaining the same binary size. This extension increases the number of utilized LUTs and FFs respectively by only 0.1% and 4.9%. The ASIC area for this design is increased by only 5.1%. The power consumption for the first extension is estimated at$543\mu \mathrm{W}$and for the second extension at$468\mu \mathrm{W}$. Mathijs De Kremer, Marco Brohet, Subhadeep Banik, Roberto Maria Avanzi, Francesco Regazzoni 0001 |
ASAP | 4 |
| 2013 | Faster 128-EEA3 and 128-EIA3 Software
Roberto Maria Avanzi, Billy Bob Brumley |
ISC | 1 |
| 2011 | Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger |
Des. Codes Cryptogr. | 1 |
| 2011 | On the distribution of the coefficients of normal forms for Frobenius expansions
Roberto Maria Avanzi, Waldyr D. Benits Junior, Steven D. Galbraith, James F. McKee |
Des. Codes Cryptogr. | 1 |
| 2007 | Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic
Roberto Maria Avanzi, Nicolas Thériault |
WAIFI | 1 |
| 2006 | Extending Scalar Multiplication Using Double Bases
Roberto Maria Avanzi, Vassil S. Dimitrov, Christophe Doche, Francesco Sica 0001 |
ASIACRYPT | 1 |
| 2006 | Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger |
Algorithmica | 1 |
| 2005 | Energy-Efficient Software Implementation of Long Integer Modular Arithmetic
Johann Großschädl, Roberto Maria Avanzi, Erkay Savas, Stefan Tillich |
CHES | 2 |
| 2005 | The Complexity of Certain Multi-Exponentiation Techniques in Cryptography
Roberto Maria Avanzi |
J. Cryptol. | 1 |
| 2004 | Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations
Roberto Maria Avanzi |
CHES | 1 |
| 2003 | Countermeasures against Differential Power Analysis for Hyperelliptic Curve Cryptosystems
Roberto Maria Avanzi |
CHES | 1 |