Matthias Hamann

发表

Matthias Hamann, M. Hamann, 2009, Comb..

Matthias Hamann, 2014, Discret. Math..

Enhancing the Centrifugal Compressor Performance Map Measurements Through a Developed One–Dimensional Calculation Tool to Analyse Local Flow Phenomena

Matthias Hamann, Elias Chebli, Markus Müller, 2014 .

On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks

Matthias Krause, Matthias Hamann, Matthias Krause, 2018, Cryptography and Communications.

Lightweight Cryptography on Ultra-Constrained RFID Devices

Matthias Hamann, Matthias Hamann, 2018 .

Bounding Connected Tree-Width

Matthias Hamann, Daniel Weißauer, 2016, SIAM J. Discret. Math..

Hardware Efficient Authentication based on Random Selection

Frederik Armknecht, Matthias Krause, Matthias Hamann, 2014, Sicherheit.

A Note on Stream Ciphers that Continuously Use the IV

Willi Meier, Matthias Krause, Matthias Hamann, 2017, IACR Cryptol. ePrint Arch..

Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers

Bin Zhang, Willi Meier, Matthias Krause, 2017, IACR Cryptol. ePrint Arch..

LIZARD - A Lightweight Stream Cipher for Power-constrained Devices

Willi Meier, Matthias Krause, Matthias Hamann, 2017, IACR Trans. Symmetric Cryptol..

The Cryptographic Power of Random Selection

Matthias Krause, Matthias Hamann, 2011, IACR Cryptol. ePrint Arch..

Accessibility in Transitive Graphs

Matthias Hamann, M. Hamann, 2014, Comb..

Extending Cycles Locally to Hamilton Cycles

Julian Pott, Matthias Hamann, Florian Lehner, 2016, Electron. J. Comb..

Design and analysis of small-state grain-like stream ciphers

Bin Zhang, Willi Meier, Matthias Krause, 2017, Cryptography and Communications.

Generating the Cycle Space of Planar Graphs

Matthias Hamann, 2015, Electron. J. Comb..

The classification of finite and locally finite connected-homogeneous digraphs

Matthias Hamann, M. Hamann, 2011, Comb..

Lightweight Authentication Protocols on Ultra-Constrained RFIDs - Myths and Facts

Frederik Armknecht, Matthias Hamann, Vasily Mikhalev, 2014, RFIDSec.

Tight Security Bounds for Generic Stream Cipher Constructions

Matthias Krause, Matthias Hamann, Matthias Krause, 2019, SAC.

Self-embeddings of trees

Matthias Hamann, 2019, Discret. Math..

Transitivity conditions in infinite graphs

Julian Pott, Matthias Hamann, M. Hamann, 2009, Comb..

The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs

Matthias Hamann, Agelos Georgakopoulos, 2019, Comb..

Planar Transitive Graphs

Matthias Hamann, 2018, Electron. J. Comb..

Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks

Matthias Krause, Matthias Hamann, Matthias Krause, 2015, IACR Cryptol. ePrint Arch..

Canonical trees of tree-decompositions

Matthias Hamann, Johannes Carmesin, Babak Miraftab, 2022, J. Comb. Theory, Ser. B.

Minor exclusion in quasi-transitive graphs

Matthias Hamann, 2021 .

Hyperbolicity in semimetric spaces, digraphs and semigroups

Matthias Hamann, 2021 .

A classification of connected-homogeneous digraphs

Matthias Hamann, Fabian Hundertmark, 2010 .

The classification of connected-homogeneous digraphs with more than one end

Matthias Hamann, Fabian Hundertmark, 2012 .