scispace - formally typeset
G

Gregor Leander

Researcher at Ruhr University Bochum

Publications -  177
Citations -  11471

Gregor Leander is an academic researcher from Ruhr University Bochum. The author has contributed to research in topics: Block cipher & Cryptography. The author has an hindex of 42, co-authored 163 publications receiving 9947 citations. Previous affiliations of Gregor Leander include University of the South, Toulon-Var & Technical University of Denmark.

Papers
More filters
Book ChapterDOI

PRESENT: An Ultra-Lightweight Block Cipher

TL;DR: 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.
Journal Article

PRESENT: An Ultra-Lightweight Block Cipher

TL;DR: In this paper, the authors describe an ultra-lightweight block cipher, present, which is suitable for extremely constrained environments such as RFID tags and sensor networks, but it is not suitable for very large networks such as sensor networks.
Book ChapterDOI

PRINCE: a low-latency block cipher for pervasive computing applications

TL;DR: In this paper, a block cipher called PRINCE is proposed that allows encryption of data within one clock cycle with a very competitive chip area compared to known solutions. But it does not have the α-reflection property, which holds that decryption for one key corresponds to encryption with another key.
Book ChapterDOI

The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS

TL;DR: A new tweakable block cipher family SKINNY is presented, whose goal is to compete with NSA recent design SIMON in terms of hardware/software performances, while proving in addition much stronger security guarantees with regards to differential/linear attacks.
Posted Content

PRINCE – A Low-latency Block Cipher for Pervasive Computing Applications

TL;DR: 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.