Merkle Tree Traversal Revisited. - Johannes Buchmann 001; Erik Dahmen; Michael Schneider 002 (PQCrypto, 2008)

Explicit hard instances of the shortest vector problem. - Johannes Buchmann 001; Richard Lindner; Markus Rückert; Michael Schneider 002 (IACR Cryptol. ePrint Arch., 2008)

Post-quantum cryptography: lattice signatures. - Johannes Buchmann 001; Richard Lindner; Markus Rückert; Michael Schneider 002 (Computing, 2009)

Parallel Shortest Lattice Vector Enumeration on Graphics Cards. - Jens Hermans; Michael Schneider 002; Johannes Buchmann 001; Frederik Vercauteren; Bart Preneel (IACR Cryptol. ePrint Arch., 2009)

Extended Lattice Reduction Experiments Using the BKZ Algorithm. - Michael Schneider 002; Johannes Buchmann 001 (Sicherheit, 2010)

Parallel Enumeration of Shortest Lattice Vectors. - Özgür Dagdelen; Michael Schneider 002 (IACR Cryptol. ePrint Arch., 2010)

Estimating the Security of Lattice-based Cryptosystems. - Markus Rückert; Michael Schneider 002 (IACR Cryptol. ePrint Arch., 2010)

Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs. - Markus Rückert; Michael Schneider 002; Dominique Schröder (IACR Cryptol. ePrint Arch., 2010)

Extreme Enumeration on GPU and in Clouds - - How Many Dollars You Need to Break SVP Challenges -. - Po-Chun Kuo; Michael Schneider 002; Özgür Dagdelen; Jan Reichelt; Johannes Buchmann 001; Chen-Mou Cheng; Bo-Yin Yang (CHES, 2011)

Random Sampling for Short Lattice Vectors on Graphics Cards. - Michael Schneider 002; Norman Göttert (CHES, 2011)

A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices. - Benjamin Milde; Michael Schneider 002 (PaCT, 2011)

GPU Implementation of the Keccak Hash Function Family. - Pierre-Louis Cayrel; Gerhard Hoffmann; Michael Schneider 002 (ISA, 2011)

Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices. - Michael Schneider 002 (WALCOM, 2011)

Sieving for Shortest Vectors in Ideal Lattices. - Michael Schneider 002 (IACR Cryptol. ePrint Arch., 2011)

Computing shortest lattice vectors on special hardware. - Michael Schneider 002 (2011)

On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes. - Norman Göttert; Thomas Feller 002; Michael Schneider 002; Johannes Buchmann 001; Sorin A. Huss (CHES, 2012)

A Polynomial Time Version of LLL With Deep Insertions - Felix Fontein; Michael Schneider 002; Urs Wagner (CoRR, 2012)

Creating a Challenge for Ideal Lattices. - Thomas Plantard; Michael Schneider 002 (IACR Cryptol. ePrint Arch., 2013)

PotLLL: a polynomial time version of LLL with deep insertions. - Felix Fontein; Michael Schneider 002; Urs Wagner (Des. Codes Cryptogr., 2014)

SPHINCS: Practical Stateless Hash-Based Signatures. - Daniel J. Bernstein; Daira Hopwood; Andreas Hülsing; Tanja Lange 001; Ruben Niederhagen; Louiza Papachristodoulou; Michael Schneider 002; Peter Schwabe; Zooko Wilcox-O'Hearn (EUROCRYPT (1), 2015)

Post-Quantum TLS on Embedded Systems: Integrating and Evaluating Kyber and SPHINCS+ with mbed TLS. - Kevin Bürstinghaus-Steinbach; Christoph Krauß; Ruben Niederhagen; Michael Schneider 002 (AsiaCCS, 2020)

Post-Quantum TLS on Embedded Systems. - Kevin Bürstinghaus-Steinbach; Christoph Krauß; Ruben Niederhagen; Michael Schneider 002 (IACR Cryptol. ePrint Arch., 2020)