default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Schneider 0002
Person information
- affiliation: TU Darmstadt, Department of Computer Science
- not to be confused with: Michael Schneider 0004
Other persons with the same name
- Michael Schneider — disambiguation page
- Michael Schneider 0001 — FZI Research Center for Information Technology, Karlsruhe, Germany
- Michael Schneider 0003 — German Research Center for Artificial Intelligence (DFKI), Saarbrücken
- Michael Schneider 0004
![[0000-0002-4203-8926]](https://devdomain4test.ir/img/orcid-mark.12x12.png "0000-0002-4203-8926")
(aka: Michael David Schneider) — RWTH Aachen University, Deutsche Post Chair of Optimization of Distribution Networks, Germany (and 1 more) - Michael Schneider 0005 — University of Trier, Germany
- Michael Schneider 0006 — Macalester College, Saint Paul, MN, USA
- Michael Schneider 0007 — University of Hanover, Institute of Production Systems and Logistics (IFA), Germany
- Michael Schneider 0008 — TU Wien, Institute of Sensor and Actuator Systems, Vienna, Austria
- Michael Schneider 0009 — University of Kaiserslautern, Computer Science Department, Germany
- Michael Schneider 0010 — Technical University Munich, Germany
- Michael Schneider 0011 — Karlsruhe Institute of Technology, Karlsruhe, Germany
- Michael Schneider 0012 — University of Colorado Boulder, Boulder, CO, USA
- Michael Schneider 0013 — German Federal Chancellery, Berlin, Germany (and 1 more)
- Michael Schneider 0014 — Hochschule Ulm, Ulm, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Books and Theses
- 2011
[b1]Michael Schneider:
Computing shortest lattice vectors on special hardware. Darmstadt University of Technology, Germany, 2011, pp. 1-108
Journal Articles
- 2014
- [j2]Felix Fontein, Michael Schneider, Urs Wagner:
PotLLL: a polynomial time version of LLL with deep insertions. Des. Codes Cryptogr. 73(2): 355-368 (2014) - 2009
- [j1]Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider:
Post-quantum cryptography: lattice signatures. Computing 85(1-2): 105-125 (2009)
Conference and Workshop Papers
- 2020
- [c14]Kevin Bürstinghaus-Steinbach, Christoph Krauß, Ruben Niederhagen, Michael Schneider:
Post-Quantum TLS on Embedded Systems: Integrating and Evaluating Kyber and SPHINCS+ with mbed TLS. AsiaCCS 2020: 841-852 - 2015
- [c13]Daniel J. Bernstein, Daira Hopwood, Andreas Hülsing, Tanja Lange, Ruben Niederhagen, Louiza Papachristodoulou, Michael Schneider, Peter Schwabe, Zooko Wilcox-O'Hearn:
SPHINCS: Practical Stateless Hash-Based Signatures. EUROCRYPT (1) 2015: 368-397 - 2013
- [c12]Michael Schneider:
Sieving for Shortest Vectors in Ideal Lattices. AFRICACRYPT 2013: 375-391 - 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 - 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 - 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 - 2008
- [c1]Johannes Buchmann, Erik Dahmen, Michael Schneider:
Merkle Tree Traversal Revisited. PQCrypto 2008: 63-78
Informal and Other Publications
- 2020
- [i10]Kevin Bürstinghaus-Steinbach, Christoph Krauß, Ruben Niederhagen, Michael Schneider:
Post-Quantum TLS on Embedded Systems. IACR Cryptol. ePrint Arch. 2020: 308 (2020) - 2013
- [i9]Felix Fontein, Michael Schneider, Urs Wagner:
PotLLL: A Polynomial Time Version of LLL With Deep Insertions. CoRR abs/1307.7534 (2013) - [i8]Thomas Plantard, Michael Schneider:
Creating a Challenge for Ideal Lattices. IACR Cryptol. ePrint Arch. 2013: 39 (2013) - 2012
- [i7]Felix Fontein, Michael Schneider, Urs Wagner:
A Polynomial Time Version of LLL With Deep Insertions. CoRR abs/1212.5100 (2012) - 2011
- [i6]Michael Schneider:
Sieving for Shortest Vectors in Ideal Lattices. IACR Cryptol. ePrint Arch. 2011: 458 (2011) - 2010
- [i5]Özgür Dagdelen, Michael Schneider:
Parallel Enumeration of Shortest Lattice Vectors. IACR Cryptol. ePrint Arch. 2010: 97 (2010) - [i4]Markus Rückert, Michael Schneider:
Estimating the Security of Lattice-based Cryptosystems. IACR Cryptol. ePrint Arch. 2010: 137 (2010) - [i3]Markus Rückert, Michael Schneider, Dominique Schröder:
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs. IACR Cryptol. ePrint Arch. 2010: 200 (2010) - 2009
- [i2]Jens Hermans, Michael Schneider, Johannes Buchmann, Frederik Vercauteren, Bart Preneel:
Parallel Shortest Lattice Vector Enumeration on Graphics Cards. IACR Cryptol. ePrint Arch. 2009: 601 (2009) - 2008
- [i1]Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider:
Explicit hard instances of the shortest vector problem. IACR Cryptol. ePrint Arch. 2008: 333 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-08-22 02:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
