Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael Schneider 0002
Author information
- affiliation: Technische Universität Darmstadt, Department of Computer Science
Other persons with the same name
- Michael Schneider
- Michael Schneider 0003 — German Research Center for Artificial Intelligence (DFKI), Saarbrücken
2010 – today
- 2013
[i8]Thomas Plantard, Michael Schneider: Creating a Challenge for Ideal Lattices. IACR Cryptology ePrint Archive 2013: 39 (2013)- 2012
- [c11]Norman Göttert, Thomas Feller, Michael Schneider, Johannes Buchmann, Sorin A. Huss: On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes. CHES 2012: 512-529
- [i7]Felix Fontein, Michael Schneider, Urs Wagner: A Polynomial Time Version of LLL With Deep Insertions. CoRR abs/1212.5100 (2012)
- 2011
- [c10]Michael Schneider, Norman Göttert: Random Sampling for Short Lattice Vectors on Graphics Cards. CHES 2011: 160-175
- [c9]Po-Chun Kuo, Michael Schneider, Özgür Dagdelen, Jan Reichelt, Johannes Buchmann, Chen-Mou Cheng, Bo-Yin Yang: Extreme Enumeration on GPU and in Clouds - - How Many Dollars You Need to Break SVP Challenges -. CHES 2011: 176-191
- [c8]Benjamin Milde, Michael Schneider: A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices. PaCT 2011: 452-458
- [c7]Pierre-Louis Cayrel, Gerhard Hoffmann, Michael Schneider: GPU Implementation of the Keccak Hash Function Family. ISA 2011: 33-42
- [c6]Michael Schneider: Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices. WALCOM 2011: 89-97
- [i6]Michael Schneider: Sieving for Shortest Vectors in Ideal Lattices. IACR Cryptology ePrint Archive 2011: 458 (2011)
- 2010
- [c5]Markus Rückert, Michael Schneider, Dominique Schröder: Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs. ACNS 2010: 69-86
- [c4]Jens Hermans, Michael Schneider, Johannes Buchmann, Frederik Vercauteren, Bart Preneel: Parallel Shortest Lattice Vector Enumeration on Graphics Cards. AFRICACRYPT 2010: 52-68
- [c3]Özgür Dagdelen, Michael Schneider: Parallel Enumeration of Shortest Lattice Vectors. Euro-Par (2) 2010: 211-222
- [c2]Michael Schneider, Johannes Buchmann: Extended Lattice Reduction Experiments Using the BKZ Algorithm. Sicherheit 2010: 241-252
- [i5]Özgür Dagdelen, Michael Schneider: Parallel Enumeration of Shortest Lattice Vectors. IACR Cryptology ePrint Archive 2010: 97 (2010)
- [i4]Markus Rückert, Michael Schneider: Estimating the Security of Lattice-based Cryptosystems. IACR Cryptology ePrint Archive 2010: 137 (2010)
- [i3]Markus Rückert, Michael Schneider, Dominique Schröder: Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs. IACR Cryptology ePrint Archive 2010: 200 (2010)
2000 – 2009
- 2009
- [j1]Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider: Post-quantum cryptography: lattice signatures. Computing 85(1-2): 105-125 (2009)
- [i2]Jens Hermans, Michael Schneider, Johannes Buchmann, Frederik Vercauteren, Bart Preneel: Parallel Shortest Lattice Vector Enumeration on Graphics Cards. IACR Cryptology ePrint Archive 2009: 601 (2009)
- 2008
- [c1]Johannes Buchmann, Erik Dahmen, Michael Schneider: Merkle Tree Traversal Revisited. PQCrypto 2008: 63-78
- [i1]Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider: Explicit hard instances of the shortest vector problem. IACR Cryptology ePrint Archive 2008: 333 (2008)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-29 22:23 CEST by the dblp team