Matthias Hamann

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 24

Top Venues

IACR Cryptol. ePrint Arch.

Comb.

Discret. Math.

Electron. J. Comb.

University of Mannheim, Germany (PHD)

Education History

University of Mannheim, Germany

PHD

Publications

Matthias Hamann
Minor exclusion in quasi-transitive graphs. Discret. Math. 347 (1) (2024)
Matthias Stammler, Julian Lorenz, Eric Sax, Jürgen Becker, Matthias Hamann, Patrick Bidinger, Andreas Dewald, Paraskevi Georgouti, Alexios Camarinopoulos, Günter Becker, Klaus Finsterbusch, Maximilian Kirschner, Laurenz Adolph, Carl Philipp Hohl, Maria Rill, Daniel Vonderau, Victor Pazmino Betancourt
UNCOVER: Data-Driven Design Support through Continuous Monitoring of Security Incidents. DATE (2024)
Agelos Georgakopoulos, Matthias Hamann
The planar Cayley graphs are effectively enumerable II. Eur. J. Comb. 110 (2023)
Matthias Stammler, Matthias Hamann, Jürgen Becker
Multilevel Security Model for Secure Information Flow Inside Software Components Employing Automated Code Generation. MECO (2023)
Matthias Stammler, Matthias Hamann, Tanja Harbaum, Jürgen Becker
Mitigating Masking in Automotive Communication Systems: Modeling and Hardware Generation. DSD (2023)
Matthias Hamann, Alexander Moch, Matthias Krause, Vasily Mikhalev
The DRACO Stream Cipher A Power-efficient Small-state Stream Cipher with Full Provable Security against TMDTO Attacks. IACR Trans. Symmetric Cryptol. 2022 (2) (2022)
Matthias Hamann, Florian Lehner, Babak Miraftab, Tim Rühmann
A Stallings type theorem for quasi-transitive graphs. J. Comb. Theory, Ser. B 157 (2022)
Johannes Carmesin, Matthias Hamann, Babak Miraftab
Canonical trees of tree-decompositions. J. Comb. Theory, Ser. B 152 (2022)
Agelos Georgakopoulos, Matthias Hamann
The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs. Comb. 39 (5) (2019)
Matthias Hamann, Matthias Krause
Tight Security Bounds for Generic Stream Cipher Constructions. IACR Cryptol. ePrint Arch. 2019 (2019)
Matthias Hamann
Self-embeddings of trees. Discret. Math. 342 (12) (2019)
Matthias Hamann, Matthias Krause, Alexander Moch
Tight Security Bounds for Generic Stream Cipher Constructions. SAC (2019)
Matthias Hamann, Matthias Krause
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Cryptogr. Commun. 10 (5) (2018)
Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang
Design and analysis of small-state grain-like stream ciphers. Cryptogr. Commun. 10 (5) (2018)
Matthias Hamann
Planar Transitive Graphs. Electron. J. Comb. 25 (4) (2018)
Matthias Hamann
Accessibility in Transitive Graphs. Comb. 38 (4) (2018)
Matthias Hamann, Matthias Krause, Willi Meier
A Note on Stream Ciphers that Continuously Use the IV. IACR Cryptol. ePrint Arch. 2017 (2017)
Matthias Hamann
The classification of finite and locally finite connected-homogeneous digraphs. Comb. 37 (2) (2017)
Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang
Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers. IACR Cryptol. ePrint Arch. 2017 (2017)
Matthias Hamann, Matthias Krause, Willi Meier
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. IACR Trans. Symmetric Cryptol. 2017 (1) (2017)
Matthias Hamann, Daniel Weißauer
Bounding Connected Tree-Width. SIAM J. Discret. Math. 30 (3) (2016)
Matthias Hamann, Florian Lehner, Julian Pott
Extending Cycles Locally to Hamilton Cycles. Electron. J. Comb. 23 (1) (2016)
Matthias Hamann
Spanning trees in hyperbolic graphs. Comb. 36 (3) (2016)
Matthias Hamann, Matthias Krause, Willi Meier
LIZARD - A Lightweight Stream Cipher for Power-constrained Devices. IACR Cryptol. ePrint Arch. 2016 (2016)
Matthias Hamann
Generating the Cycle Space of Planar Graphs. Electron. J. Comb. 22 (2) (2015)
Matthias Hamann, Daniel Weißauer
Bounding connected tree-width. CoRR (2015)
Matthias Hamann, Matthias Krause
Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks. IACR Cryptol. ePrint Arch. 2015 (2015)
Frederik Armknecht, Matthias Hamann, Matthias Krause
Hardware Efficient Authentication based on Random Selection. Sicherheit (2014)
Matthias Hamann
Homogeneous 2-partite digraphs. Discret. Math. 327 (2014)
Frederik Armknecht, Matthias Hamann, Vasily Mikhalev
Lightweight Authentication Protocols on Ultra-Constrained RFIDs - Myths and Facts. RFIDSec (2014)
Matthias Hamann, Julian Pott
Transitivity conditions in infinite graphs. Comb. 32 (6) (2012)
Matthias Krause, Matthias Hamann
The Cryptographic Power of Random Selection. IACR Cryptol. ePrint Arch. 2011 (2011)
Matthias Krause, Matthias Hamann
The Cryptographic Power of Random Selection. Selected Areas in Cryptography (2011)

Matthias Hamann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthias Hamann