• Publications
  • Influence
PRESENT: An Ultra-Lightweight Block Cipher
An ultra-lightweight block cipher, present, which is competitive with today's leading compact stream ciphers and suitable for extremely constrained environments such as RFID tags and sensor networks.
Understanding Cryptography: A Textbook for Students and Practitioners
The authors move quickly from explaining the foundations to describing practical implementations, including recent topics such as lightweight ciphers for RFIDs and mobile devices, and current key-length recommendations.
Pushing the Limits: A Very Compact and a Threshold Implementation of AES
A very compact hardware implementation of AES-128, which requires only 2400 GE, is described, to the best of the knowledge the smallest implementation reported so far and is still susceptible to some sophisticated attacks having enough number of measurements.
PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications - Extended Abstract
This paper presents a block cipher that is optimized with respect to latency when implemented in hardware and holds that decryption for one key corresponds to encryption with a related key, which is of independent interest and proves its soundness against generic attacks.
A Survey of Lightweight-Cryptography Implementations
A selection of recently published lightweight-cryptography implementations are presented and compared to state-of-the-art results in their field, targeting embedded hardware and software.
A Stochastic Model for Differential Side Channel Cryptanalysis
Though the efficiency at key extraction is limited by template attacks profiling is much more efficient which is highly relevant if the designer of a cryptosystem is bounded by the number of measurements in the profiling step.
Ultra High Performance ECC over NIST Primes on Commercial FPGAs
A novel architecture and algorithms for performing ECC arithmetic are described and it is shown that ECC on Xilinx's Virtex-4 SX55 FPGA can be performed at a rate of more than 37,000 point multiplications per second.
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
The results show that implementations of this architecture executing the projective coordinates version of the Montgomery scalar multiplication algorithm can compute elliptic curve scalar multiplications with arbitrary points in 0.21 msec in the field GF(2167).
Generalizations of the Karatsuba Algorithm for Efficient Implementations
In this work we generalize the classical Karatsuba Algorithm (KA) for polynomial multiplication to (i) polynomials of arbitrary degree and (ii) recursive use. We determine exact complexity