Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael Schneider 0002

dblp:25/3953-2 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0002-4203-8926ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 8 · 1 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
4 papers
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Integrated circuit design · 79% GPUs and heterogeneous computing · 21%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.322012
On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes · CHES 2012
Random Sampling for Short Lattice Vectors on Graphics Cards · CHES 2011
Cryptographic primitives and cryptanalysis › post-quantum cryptography
hash-based signatures
0.212015
SPHINCS: Practical Stateless Hash-Based Signatures · EUROCRYPT (1) 2015
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.212015
SPHINCS: Practical Stateless Hash-Based Signatures · EUROCRYPT (1) 2015
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
lattice-based encryption
0.112012
On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes · CHES 2012
Integrated circuit design › digital circuit design
cryptographic hardware
0.112012
On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes · CHES 2012
Cryptographic primitives and cryptanalysis
lattice attack
0.112011
Extreme Enumeration on GPU and in Clouds - - How Many Dollars You Need to Break SVP Challenges - · CHES 2011
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
shortest vector problem
0.112011
Extreme Enumeration on GPU and in Clouds - - How Many Dollars You Need to Break SVP Challenges - · CHES 2011
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.112015
SPHINCS: Practical Stateless Hash-Based Signatures · EUROCRYPT (1) 2015
GPUs and heterogeneous computing › GPU computing › GPGPU acceleration
GPU-accelerated cryptography
0.012011
Random Sampling for Short Lattice Vectors on Graphics Cards · CHES 2011

Methods — techniques the papers use, named apart from their topics

lattice-based encryption · 0.3lattice enumeration · 0.2GPU acceleration · 0.2
YearPublicationVenuePosition
2020 Post-Quantum TLS on Embedded Systems: Integrating and Evaluating Kyber and SPHINCS+ with mbed TLS
abstract
We present our integration of post-quantum cryptography (PQC), more specifically of the post-quantum KEM scheme Kyber for key establishment and the post-quantum signature scheme SPHINCS+, into the embedded TLS library mbed TLS. We measure the performance of these post-quantum primitives on four different embedded platforms with three different ARM processors and an Xtensa LX6 processor. Furthermore, we compare the performance of our experimental PQC cipher suite to a classical TLS variant using elliptic curve cryptography (ECC). Post-quantum key establishment and signature schemes have been either integrated into TLS or ported to embedded devices before. However, to the best of our knowledge, we are the first to combine TLS, post-quantum schemes, and embedded systems and to measure and evaluate the performance of post-quantum TLS on embedded platforms. Our results show that post-quantum key establishment with Kyber performs well in TLS on embedded devices compared to ECC variants. The use of SPHINCS+ signatures comes with certain challenges in terms of signature size and signing time, which mainly affects the use of embedded systems as PQC-TLS server but does not necessarily prevent embedded systems to act as PQC-TLS clients.
Kevin Bürstinghaus-Steinbach, Christoph Krauß, Ruben Niederhagen, Michael Schneider 0002
AsiaCCS4
2015 SPHINCS: Practical Stateless Hash-Based Signatures
abstract
This paper introduces a high-security post-quantum stateless hash-based signature scheme that signs hundreds of messages per second on a modern 4-core 3.5GHz Intel CPU. Signatures are 41 KB, public keys are 1 KB, and private keys are 1 KB. The signature scheme is designed to provide long-term $$2^{128}$$ security even against attackers equipped with quantum computers. Unlike most hash-based designs, this signature scheme is stateless, allowing it to be a drop-in replacement for current signature schemes.
Daniel J. Bernstein, Daira Hopwood, Andreas Hülsing, Tanja Lange 0001, Ruben Niederhagen, Louiza Papachristodoulou, Michael Schneider 0002, Peter Schwabe, Zooko Wilcox-O'Hearn
EUROCRYPT (1)7
2014 PotLLL: a polynomial time version of LLL with deep insertions
Felix Fontein, Michael Schneider 0002, Urs Wagner
Des. Codes Cryptogr.2
2012 On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes
Norman Lahr, Thomas Feller 0002, Michael Schneider 0002, Johannes Buchmann 0001, Sorin A. Huss
CHES3
2011 Extreme Enumeration on GPU and in Clouds - - How Many Dollars You Need to Break SVP Challenges -
Po-Chun Kuo, Michael Schneider 0002, Özgür Dagdelen, Jan Reichelt, Johannes Buchmann 0001, Chen-Mou Cheng, Bo-Yin Yang
CHES2
2011 Random Sampling for Short Lattice Vectors on Graphics Cards
Michael Schneider 0002, Norman Lahr
CHES1
2010 Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Markus Rückert, Michael Schneider 0002, Dominique Schröder
ACNS2
2010 Parallel Enumeration of Shortest Lattice Vectors
Özgür Dagdelen, Michael Schneider 0002
Euro-Par (2)2
2008 Merkle Tree Traversal Revisited
Johannes Buchmann 0001, Erik Dahmen, Michael Schneider 0002
PQCrypto3