Matthias Hamann

According to our database, Matthias Hamann authored at least 30 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Minor exclusion in quasi-transitive graphs.

Matthias Hamann

Discret. Math., January, 2024

2023

The planar Cayley graphs are effectively enumerable II.

Agelos Georgakopoulos, Matthias Hamann

Eur. J. Comb., May, 2023

Multilevel Security Model for Secure Information Flow Inside Software Components Employing Automated Code Generation.

Matthias Stammler, Matthias Hamann, Jürgen Becker

Proceedings of the 12th Mediterranean Conference on Embedded Computing, 2023

Mitigating Masking in Automotive Communication Systems: Modeling and Hardware Generation.

Matthias Stammler, Matthias Hamann, Tanja Harbaum, Jürgen Becker

Proceedings of the 26th Euromicro Conference on Digital System Design, 2023

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, Vasily Mikhalev

IACR Trans. Symmetric Cryptol., 2022

A Stallings type theorem for quasi-transitive graphs.

Matthias Hamann, Florian Lehner, Babak Miraftab, Tim Rühmann

J. Comb. Theory, Ser. B, 2022

Canonical trees of tree-decompositions.

Johannes Carmesin, Matthias Hamann, Babak Miraftab

J. Comb. Theory, Ser. B, 2022

2019

Tight Security Bounds for Generic Stream Cipher Constructions.

Matthias Hamann, Matthias Krause

IACR Cryptol. ePrint Arch., 2019

Self-embeddings of trees.

Matthias Hamann

Discret. Math., 2019

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

Agelos Georgakopoulos, Matthias Hamann

Comb., 2019

Tight Security Bounds for Generic Stream Cipher Constructions.

Matthias Hamann, Matthias Krause, Alexander Moch

Proceedings of the Selected Areas in Cryptography - SAC 2019, 2019

2018

Lightweight Cryptography on Ultra-Constrained RFID Devices.

Matthias Hamann

PhD thesis, 2018

Planar Transitive Graphs.

Matthias Hamann

Electron. J. Comb., 2018

Accessibility in Transitive Graphs.

Matthias Hamann

Comb., 2018

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

Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang

Cryptogr. Commun., 2018

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

Matthias Hamann, Matthias Krause

Cryptogr. Commun., 2018

2017

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

Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang

IACR Cryptol. ePrint Arch., 2017

A Note on Stream Ciphers that Continuously Use the IV.

Matthias Hamann, Matthias Krause, Willi Meier

IACR Cryptol. ePrint Arch., 2017

The classification of finite and locally finite connected-homogeneous digraphs.

Matthias Hamann

Comb., 2017

2016

Bounding Connected Tree-Width.

Matthias Hamann, Daniel Weißauer

SIAM J. Discret. Math., 2016

LIZARD - A Lightweight Stream Cipher for Power-constrained Devices.

Matthias Hamann, Matthias Krause, Willi Meier

IACR Cryptol. ePrint Arch., 2016

Extending Cycles Locally to Hamilton Cycles.

Matthias Hamann, Florian Lehner, Julian Pott

Electron. J. Comb., 2016

Spanning trees in hyperbolic graphs.

Matthias Hamann

Comb., 2016

2015

Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks.

Matthias Hamann, Matthias Krause

IACR Cryptol. ePrint Arch., 2015

Generating the Cycle Space of Planar Graphs.

Matthias Hamann

Electron. J. Comb., 2015

2014

Homogeneous 2-partite digraphs.

Matthias Hamann

Discret. Math., 2014

Hardware Efficient Authentication based on Random Selection.

Frederik Armknecht, Matthias Hamann, Matthias Krause

Proceedings of the Sicherheit 2014: Sicherheit, 2014

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

Frederik Armknecht, Matthias Hamann, Vasily Mikhalev

Proceedings of the Radio Frequency Identification: Security and Privacy Issues, 2014

2012

Transitivity conditions in infinite graphs.

Matthias Hamann, Julian Pott

Comb., 2012

2011

The Cryptographic Power of Random Selection.

Matthias Krause, Matthias Hamann

IACR Cryptol. ePrint Arch., 2011