A
Axel Poschmann
Researcher at Nanyang Technological University
Publications - 65
Citations - 8569
Axel Poschmann is an academic researcher from Nanyang Technological University. The author has contributed to research in topics: Block cipher & Cryptography. The author has an hindex of 27, co-authored 65 publications receiving 7835 citations. Previous affiliations of Axel Poschmann include Ruhr University Bochum & NXP Semiconductors.
Papers
More filters
Book ChapterDOI
PRESENT: An Ultra-Lightweight Block Cipher
Andrey Bogdanov,Lars R. Knudsen,Gregor Leander,Christof Paar,Axel Poschmann,Matthew Robshaw,Yannick Seurin,C. Vikkelsoe +7 more
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
Andrey Bogdanov,Lars R. Knudsen,Gregor Leander,Christof Paar,Axel Poschmann,Matthew Robshaw,Yannick Seurin,C. Vikkelsoe +7 more
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
The LED block cipher
TL;DR: This work considers the resistance of ciphers, and LED in particular, to related-key attacks, and is able to derive simple yet interesting AES-like security proofs for LED regarding related- or single- key attacks.
Book ChapterDOI
Pushing the limits: a very compact and a threshold implementation of AES
TL;DR: 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.
Book ChapterDOI
The PHOTON family of lightweight Hash functions
TL;DR: The PHOTON lightweight hash function as mentioned in this paper uses a sponge-like construction as domain extension algorithm and an AES-like primitive as internal unkeyed permutation to obtain the most compact hash function known, reaching areas very close to the theoretical optimum.