Steffen Reith

According to our database, Steffen Reith authored at least 27 papers between 1998 and 2024.

Collaborative distances:

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

2024

Evaluating an Open-Source Hardware Approach from HDL to GDS for a Security Chip Design - a Review of the Final Stage of Project HEP.

Tim Henkes, Steffen Reith, Marc Stöttinger, Norbert Herfurth, Goran Panic, Julian Wälde, Fabian Buschkowski, Pascal Sasdrich, Christoph Lüth, Milan Funck, Tuba Kiyan, Arnd Weber, Detlef Boeck, René Rathfelder, Torsten Grawunder

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2024

2023

Verified Value Chains, Innovation and Competition.

Arnd Weber, Sylvain Guilley, René Rathfelder, Marc Stöttinger, Christoph Lüth, Maja Malenko, Torsten Grawunder, Steffen Reith, Armand Puccetti, Jean-Pierre Seifert, Norbert Herfurth, Hagen Sankowski, Gernot Heiser

Proceedings of the IEEE International Conference on Cyber Security and Resilience, 2023

2020

LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4.

Fabio Campos, Tim Kohlstadt, Steffen Reith, Marc Stöttinger

Proceedings of the Progress in Cryptology - AFRICACRYPT 2020, 2020

2019

On Lions and Elligators: An Efficient Constant-Time Implementation of CSIDH.

Michael Meyer, Fabio Campos, Steffen Reith

Proceedings of the Post-Quantum Cryptography - 10th International Conference, 2019

2018

Souveränität und die IT-Wertschöpfungskette.

Arnd Weber, Steffen Reith, Michael Kasper, Dirk Kuhlmann, Jean-Pierre Seifert, Christoph Krauß

Datenschutz und Datensicherheit, 2018

Open Source Value Chains for Addressing Security Issues Efficiently.

Arnd Weber, Steffen Reith, Dirk Kuhlmann, Michael Kasper, Jean-Pierre Seifert, Christoph Krauß

Proceedings of the 2018 IEEE International Conference on Software Quality, 2018

A Faster Way to the CSIDH.

Michael Meyer, Steffen Reith

Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

2017

On hybrid SIDH schemes using Edwards and Montgomery curve arithmetic.

Michael Meyer, Steffen Reith, Fabio Campos

IACR Cryptol. ePrint Arch., 2017

2013

On a FPGA-based method for authentication using Edwards curves.

André Himmighofen, Bernhard Jungk, Steffen Reith

Proceedings of the 2013 8th International Workshop on Reconfigurable and Communication-Centric Systems-on-Chip (ReCoSoC), 2013

2012

Side-channel resistant AES architecture utilizing randomized composite field representations.

Bernhard Jungk, Marc Stöttinger, Jan Gampe, Steffen Reith, Sorin A. Huss

Proceedings of the 2012 International Conference on Field-Programmable Technology, 2012

2010

The Complexity of Problems for Quantified Constraints.

Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer

Theory Comput. Syst., 2010

On FPGA-based implementations of Gröstl.

Bernhard Jungk, Steffen Reith

IACR Cryptol. ePrint Arch., 2010

Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems

Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer

Log. Methods Comput. Sci., 2010

On FPGA-Based Implementations of the SHA-3 Candidate Grøstl.

Bernhard Jungk, Steffen Reith

Proceedings of the ReConFig'10: 2010 International Conference on Reconfigurable Computing and FPGAs, 2010

2009

On Optimized FPGA Implementations of the SHA-3 Candidate Groestl.

Bernhard Jungk, Steffen Reith, Jürgen Apfelbeck

IACR Cryptol. ePrint Arch., 2009

2005

Bases for Boolean co-clones.

Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer

Inf. Process. Lett., 2005

Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation

Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer

Electron. Colloquium Comput. Complex., 2005

2004

The Complexity of Boolean Constraint Isomorphism.

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer

Proceedings of the STACS 2004, 2004

2003

On the Complexity of Some Equivalence Problems for Propositional Calculi.

Steffen Reith

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

Equivalence and Isomorphism for Boolean Constraint Satisfaction.

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Generalized satisfiability problems.

Steffen Reith

PhD thesis, 2001

A polynomial-time approximation scheme for base station positioning in UMTS networks.

Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000

A note on closure properties of logspace MOD classes.

Ulrich Hertrampf, Steffen Reith, Heribert Vollmer

Inf. Process. Lett., 2000

Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems.

Steffen Reith, Heribert Vollmer

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

The Complexity of Base Station Positioning in Cellular Networks.

Christian Glaßer, Steffen Reith, Heribert Vollmer

Proceedings of the ICALP Workshops 2000, 2000

1998

The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae

Steffen Reith, Heribert Vollmer

Electron. Colloquium Comput. Complex., 1998

On Boolean Lowness and Boolean Highness.

Steffen Reith, Klaus W. Wagner

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998