The Cryptographic Power of Random Selection. - Matthias Krause 001; Matthias Hamann (IACR Cryptol. ePrint Arch., 2011)

Transitivity conditions in infinite graphs. - Matthias Hamann; Julian Pott (Comb., 2012)

Lightweight Authentication Protocols on Ultra-Constrained RFIDs - Myths and Facts. - Frederik Armknecht; Matthias Hamann; Vasily Mikhalev (RFIDSec, 2014)

Hardware Efficient Authentication based on Random Selection. - Frederik Armknecht; Matthias Hamann; Matthias Krause 001 (Sicherheit, 2014)

Homogeneous 2-partite digraphs. - Matthias Hamann (Discret. Math., 2014)

k-Blocks: A Connectivity Invariant for Graphs. - Johannes Carmesin; Reinhard Diestel; Matthias Hamann; Fabian Hundertmark (SIAM J. Discret. Math., 2014)

Generating the Cycle Space of Planar Graphs. - Matthias Hamann (Electron. J. Comb., 2015)

Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks. - Matthias Hamann; Matthias Krause 001 (IACR Cryptol. ePrint Arch., 2015)

Spanning trees in hyperbolic graphs. - Matthias Hamann (Comb., 2016)

Extending Cycles Locally to Hamilton Cycles. - Matthias Hamann; Florian Lehner; Julian Pott (Electron. J. Comb., 2016)

Canonical tree-decompositions of finite graphs I. Existence and algorithms. - Johannes Carmesin; Reinhard Diestel; Matthias Hamann; Fabian Hundertmark (J. Comb. Theory B, 2016)

Canonical tree-decompositions of finite graphs II. Essential parts. - Johannes Carmesin; Reinhard Diestel; Matthias Hamann; Fabian Hundertmark (J. Comb. Theory B, 2016)

Bounding Connected Tree-Width. - Matthias Hamann; Daniel Weißauer (SIAM J. Discret. Math., 2016)

The classification of finite and locally finite connected-homogeneous digraphs. - Matthias Hamann (Comb., 2017)

A Note on Stream Ciphers that Continuously Use the IV. - Matthias Hamann; Matthias Krause 001; Willi Meier (IACR Cryptol. ePrint Arch., 2017)

Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers. - Matthias Hamann; Matthias Krause 001; Willi Meier; Bin Zhang 003 (IACR Cryptol. ePrint Arch., 2017)

LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. - Matthias Hamann; Matthias Krause 001; Willi Meier (IACR Trans. Symmetric Cryptol., 2017)

On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. - Matthias Hamann; Matthias Krause 001 (Cryptogr. Commun., 2018)

Design and analysis of small-state grain-like stream ciphers. - Matthias Hamann; Matthias Krause 001; Willi Meier; Bin Zhang 003 (Cryptogr. Commun., 2018)

Accessibility in Transitive Graphs. - Matthias Hamann (Comb., 2018)

Planar Transitive Graphs. - Matthias Hamann (Electron. J. Comb., 2018)

Lightweight Cryptography on Ultra-Constrained RFID Devices. - Matthias Hamann (2018)

Tight Security Bounds for Generic Stream Cipher Constructions. - Matthias Hamann; Matthias Krause 001; Alexander Moch (SAC, 2019)

The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs. - Agelos Georgakopoulos; Matthias Hamann (Comb., 2019)

Self-embeddings of trees. - Matthias Hamann (Discret. Math., 2019)

Tight Security Bounds for Generic Stream Cipher Constructions. - Matthias Hamann; Matthias Krause 001 (IACR Cryptol. ePrint Arch., 2019)

Canonical trees of tree-decompositions. - Johannes Carmesin; Matthias Hamann; Babak Miraftab (J. Comb. Theory B, 2022)

A Stallings type theorem for quasi-transitive graphs. - Matthias Hamann; Florian Lehner; Babak Miraftab; Tim Rühmann (J. Comb. Theory B, 2022)

The DRACO Stream Cipher A Power-efficient Small-state Stream Cipher with Full Provable Security against TMDTO Attacks. - Matthias Hamann; Alexander Moch; Matthias Krause 001; Vasily Mikhalev (IACR Trans. Symmetric Cryptol., 2022)

Mitigating Masking in Automotive Communication Systems: Modeling and Hardware Generation. - Matthias Stammler; Matthias Hamann; Tanja Harbaum; Jürgen Becker 001 (DSD, 2023)

Multilevel Security Model for Secure Information Flow Inside Software Components Employing Automated Code Generation. - Matthias Stammler; Matthias Hamann; Jürgen Becker 001 (MECO, 2023)

The planar Cayley graphs are effectively enumerable II. - Agelos Georgakopoulos; Matthias Hamann (Eur. J. Comb., 2023)

UNCOVER: Data-Driven Design Support through Continuous Monitoring of Security Incidents. - Matthias Stammler; Julian Lorenz; Eric Sax; Jürgen Becker 001; Matthias Hamann; Patrick Bidinger; Andreas Dewald; Paraskevi Georgouti; Alexios Camarinopoulos; Günter Becker; Klaus Finsterbusch; Maximilian Kirschner; et al. (DATE, 2024)

Minor exclusion in quasi-transitive graphs. - Matthias Hamann (Discret. Math., 2024)

Quasi-transitive K∞-minor free graphs. - Matthias Hamann (Eur. J. Comb., 2025)

Tree amalgamations and quasi-isometries. - Matthias Hamann (J. Comb. Theory B, 2025)