Michael Schneider

Affiliations:
  • TU Darmstadt, Department of Computer Science


According to our database1, Michael Schneider authored at least 22 papers between 2008 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Post-Quantum TLS on Embedded Systems.
IACR Cryptol. ePrint Arch., 2020

Post-Quantum TLS on Embedded Systems: Integrating and Evaluating Kyber and SPHINCS+ with mbed TLS.
Proceedings of the ASIA CCS '20: The 15th ACM Asia Conference on Computer and Communications Security, 2020

2015
SPHINCS: Practical Stateless Hash-Based Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
PotLLL: a polynomial time version of LLL with deep insertions.
Des. Codes Cryptogr., 2014

2013
Creating a Challenge for Ideal Lattices.
IACR Cryptol. ePrint Arch., 2013

2012
A Polynomial Time Version of LLL With Deep Insertions
CoRR, 2012

On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2012, 2012

2011
Computing shortest lattice vectors on special hardware.
PhD thesis, 2011

Sieving for Shortest Vectors in Ideal Lattices.
IACR Cryptol. ePrint Arch., 2011

Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

GPU Implementation of the Keccak Hash Function Family.
Proceedings of the Information Security and Assurance - International Conference, 2011

A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices.
Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011

Random Sampling for Short Lattice Vectors on Graphics Cards.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2011 - 13th International Workshop, Nara, Japan, September 28, 2011

Extreme Enumeration on GPU and in Clouds - - How Many Dollars You Need to Break SVP Challenges -.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2011 - 13th International Workshop, Nara, Japan, September 28, 2011

2010
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs.
IACR Cryptol. ePrint Arch., 2010

Estimating the Security of Lattice-based Cryptosystems.
IACR Cryptol. ePrint Arch., 2010

Parallel Enumeration of Shortest Lattice Vectors.
IACR Cryptol. ePrint Arch., 2010

Extended Lattice Reduction Experiments Using the BKZ Algorithm.
Proceedings of the Sicherheit 2010: Sicherheit, 2010

2009
Parallel Shortest Lattice Vector Enumeration on Graphics Cards.
IACR Cryptol. ePrint Arch., 2009

Post-quantum cryptography: lattice signatures.
Computing, 2009

2008
Explicit hard instances of the shortest vector problem.
IACR Cryptol. ePrint Arch., 2008

Merkle Tree Traversal Revisited.
Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008


  Loading...