• Publications
  • Influence
Triathlon of lightweight block ciphers for the Internet of things
TLDR
The benchmarking framework provides cipher designers with an easy-to-use tool to compare new algorithms with the state of the art and allows standardization organizations to conduct a fair and consistent evaluation of a large number of candidates.
Fresh Re-keying: Security against Side-Channel and Fault Attacks for Low-Cost Devices
TLDR
This paper proposes a fresh re-keying scheme that is especially suited for challenge-response protocols such as used to authenticate tags, and estimates the cost in terms of area and execution time for various security/performance trade-offs.
Design Strategies for ARX with Provable Bounds: Sparx and LAX
TLDR
This paper presents, for the first time, a general strategy for designing ARX symmetric-key primitives with provable resistance against single-trail differential and linear cryptanalysis and advocates the use of large (ARX-based) S-Boxes together with sparse linear layers.
Efficient Ring-LWE Encryption on 8-Bit AVR Processors
TLDR
A carefully-optimized implementation of a ring-LWE encryption scheme for 8-bit AVR processors like the ATxmega128 and outperform related RSA and ECC implementations by an order of magnitude.
The energy cost of cryptographic key establishment in wireless sensor networks
TLDR
The evaluation considers both the processor's energy consumption for calculating cryptographic primitives and the energy cost of radio communication for different transmit power levels to show that the ECMQV key exchange consumes up to twice as much energy as Kerberos-like key transport.
Instruction Set Extensions for Fast Arithmetic in Finite Fields GF( p) and GF(2m)
TLDR
This paper introduces a set of five custom instructions to accelerate arithmetic operations in finite fields GF(p) and GF(2 m), which can be easily integrated into a standard RISC architecture like MIPS32 and require only little extra hardware.
Secure Conversion between Boolean and Arithmetic Masking of Any Order
TLDR
To convert masks of a size of ki¾?bits securely against attacks of order n, the proposed algorithms have a time complexity of $\mathcal{O}n^2 k$ in both directions and are proven to be secure in the Ishai, Sahai, and Wagner ISW framework for private circuits.
Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity
TLDR
This paper describes an improved algorithm for performing arithmetic addition modulo \(2^k\) directly on Boolean shares, with the same complexity \(\mathcal{O}(\log k)\) instead of \(k=64\) and proves the security of the new algorithm against first-order attacks.
Micro-Architectural Power Simulator for Leakage Assessment of Cryptographic Software on ARM Cortex-M3 Processors
TLDR
MAPS, a micro-architectural power simulator for the M3 series of ARM Cortex processors, one of today’s most widely-used embedded platforms, is presented, fast, easy to use, and able to model the Cortex-M3 pipeline leakages, in particular the leakage introduced by the pipeline registers.
Instruction Set Extensions for Efficient AES Implementation on 32-bit Processors
TLDR
This paper proposes a number of custom instructions to support the Advanced Encryption Standard (AES), and uses the SPARC V8-compatible Leon2 embedded processor to evaluate the effects of the extensions on performance and code size of AES, as well as on silicon area.
...
...