J. Buchmann

Publications351
h-index41
Citations5,295
Highly Influential Citations360
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • Chris Peikert
  • 100 Publications • 12,635 Citations
  • D. Boneh
  • 404 Publications • 67,721 Citations
  • Daniele Micciancio
  • 161 Publications • 10,152 Citations
  • M. Bellare
  • 293 Publications • 45,996 Citations
  • Publications
  • Influence
XMSS - A Practical Forward Secure Signature Scheme based on Minimal Security Assumptions
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a second preimage… Expand
  • 188
  • 25
  • PDF
On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes
TLDR
We present both a hardware and a software implementation variant of the learning with errors (LWE) based cryptosystem presented by Lindner and Peikert. Expand
  • 137
  • 16
  • PDF
Introduction to Cryptography
From the Publisher: Cryptography is a key technology in electronic key systems. It is used to keep data secret, digitally sign documents, access control, etc. Therefore, users should not only know… Expand
  • 285
  • 14
Discrete Ziggurat: A Time-Memory Trade-off for Sampling from a Gaussian Distribution over the Integers
TLDR
We explore a different method that allows for a flexible time-memory trade-off, offering developers freedom in choosing how much space they can spare to store precomputed values. Expand
  • 61
  • 13
  • PDF
A subexponential algorithm for the determination of class groups and regulators of algebraic number fields
A new probabilistic algorithm for the determination of class groups and regulators of an algebraic number eld F is presented. Heuristic evidence is given which shows that the expected running time of… Expand
  • 109
  • 9
On the Security of the Winternitz One-Time Signature Scheme
TLDR
We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random functions. Expand
  • 46
  • 9
Extreme Enumeration on GPU and in Clouds - - How Many Dollars You Need to Break SVP Challenges -
TLDR
We integrate several recent algorithmic improvements for solving SVP and take first place at dimension 120 in the SVP Challenge Hall of Fame. Expand
  • 40
  • 9
  • PDF
Merkle Signatures with Virtually Unlimited Signature Capacity
TLDR
We propose GMSS, a new variant of the Merkle signature scheme that allows a cryptographically unlimited(280) number of documents to be signed with one key pair. Expand
  • 90
  • 8
  • PDF
MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
TLDR
In this paper, we present MutantXL2 (MXL2 ) – a new algorithm based on MutantXL that oftentimes allows to solve systems with significantly smaller matrix sizes than J. Buchmann and J. Ding. Expand
  • 59
  • 8
  • PDF
High-Performance and Lightweight Lattice-Based Public-Key Encryption
TLDR
We show the practical potential of replacing Gaussian noise distribution in the Ring-LWE based encryption scheme by Lindner and Peikert/Lyubashevsky et al. with a binary distribution. Expand
  • 43
  • 8
  • PDF
...
1
2
3
4
5
...