Steffen Reith

37 papers A 2B 3C 1Misc 3Journal 20Unranked 7
YearRankTypeTitle / Venue / Authors
2024 A conf
Evaluating an Open-Source Hardware Approach from HDL to GDS for a Security Chip Design - a Review of the Final Stage of Project HEP.
DATE
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
2023 Misc conf
Verified Value Chains, Innovation and Competition.
CSR
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
2020 — conf
LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4.
AFRICACRYPT
Fabio Campos, Tim Kohlstadt, Steffen Reith, Marc Stöttinger
2020 J jnl
LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4.
IACR Cryptol. ePrint Arch.
Fabio Campos, Tim Kohlstadt, Steffen Reith, Marc Stöttinger
2019 C conf
On Lions and Elligators: An Efficient Constant-Time Implementation of CSIDH.
PQCrypto
Michael Meyer, Fabio Campos, Steffen Reith
2018 Misc conf
A Faster Way to the CSIDH.
INDOCRYPT
Michael Meyer, Steffen Reith
2018 J jnl
A faster way to the CSIDH.
IACR Cryptol. ePrint Arch.
Michael Meyer, Steffen Reith
2018 J jnl
On Lions and Elligators: An efficient constant-time implementation of CSIDH.
IACR Cryptol. ePrint Arch.
Michael Meyer, Fabio Campos, Steffen Reith
2018 — conf
Open Source Value Chains for Addressing Security Issues Efficiently.
QRS Companion
Arnd Weber, Steffen Reith, Dirk Kuhlmann, Michael Kasper, Jean-Pierre Seifert, Christoph Krauß
2018 J jnl
Souveränität und die IT-Wertschöpfungskette.
Datenschutz und Datensicherheit
Arnd Weber, Steffen Reith, Michael Kasper, Dirk Kuhlmann, Jean-Pierre Seifert, Christoph Krauß
2017 J jnl
On hybrid SIDH schemes using Edwards and Montgomery curve arithmetic.
IACR Cryptol. ePrint Arch.
Michael Meyer, Steffen Reith, Fabio Campos
2013 — conf
On a FPGA-based method for authentication using Edwards curves.
ReCoSoC
André Himmighofen, Bernhard Jungk, Steffen Reith
2012 — conf
Side-channel resistant AES architecture utilizing randomized composite field representations.
FPT
Bernhard Jungk, Marc Stöttinger, Jan Gampe, Steffen Reith, Sorin A. Huss
2010 J jnl
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems
Log. Methods Comput. Sci.
Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer
2010 — conf
On FPGA-Based Implementations of the SHA-3 Candidate Grøstl.
ReConFig
Bernhard Jungk, Steffen Reith
2010 J jnl
On FPGA-based implementations of Gröstl.
IACR Cryptol. ePrint Arch.
Bernhard Jungk, Steffen Reith
2010 J jnl
The Complexity of Problems for Quantified Constraints.
Theory Comput. Syst.
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2009 J jnl
On Optimized FPGA Implementations of the SHA-3 Candidate Groestl.
IACR Cryptol. ePrint Arch.
Bernhard Jungk, Steffen Reith, Jürgen Apfelbeck
2007 J jnl
The Complexity of Problems for Quantified Constraints.
Electron. Colloquium Comput. Complex.
Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor
2005 J jnl
Bases for Boolean co-clones.
Inf. Process. Lett.
Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer
2005 J jnl
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
Electron. Colloquium Comput. Complex.
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2005 J jnl
The complexity of base station positioning in cellular networks.
Discret. Appl. Math.
Christian Glaßer, Steffen Reith, Heribert Vollmer
2004 A conf
The Complexity of Boolean Constraint Isomorphism.
STACS
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2003 B conf
On the Complexity of Some Equivalence Problems for Propositional Calculi.
MFCS
Steffen Reith
2003 J jnl
Optimal satisfiability for propositional calculi and constraint satisfaction problems.
Inf. Comput.
Steffen Reith, Heribert Vollmer
2003 J jnl
The Complexity of Boolean Constraint Isomorphism
CoRR
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002 J jnl
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CoRR
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002 B conf
Equivalence and Isomorphism for Boolean Constraint Satisfaction.
CSL
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2001 — conf
A polynomial-time approximation scheme for base station positioning in UMTS networks.
DIAL-M
Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer
2001 — —
Generalized satisfiability problems.
Steffen Reith
2001 J jnl
On boolean lowness and boolean highness.
Theor. Comput. Sci.
Steffen Reith, Klaus W. Wagner
2000 J jnl
A note on closure properties of logspace MOD classes.
Inf. Process. Lett.
Ulrich Hertrampf, Steffen Reith, Heribert Vollmer
2000 B conf
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems.
MFCS
Steffen Reith, Heribert Vollmer
2000 — conf
The Complexity of Base Station Positioning in Cellular Networks.
ICALP Satellite Workshops
Christian Glaßer, Steffen Reith, Heribert Vollmer
1998 Misc conf
On Boolean Lowness and Boolean Highness.
COCOON
Steffen Reith, Klaus W. Wagner
1998 J jnl
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
CoRR
Steffen Reith, Heribert Vollmer
1998 J jnl
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
Electron. Colloquium Comput. Complex.
Steffen Reith, Heribert Vollmer