M
Martin R. Albrecht
Researcher at Royal Holloway, University of London
Publications - 114
Citations - 4093
Martin R. Albrecht is an academic researcher from Royal Holloway, University of London. The author has contributed to research in topics: Learning with errors & Computer science. The author has an hindex of 31, co-authored 106 publications receiving 3150 citations. Previous affiliations of Martin R. Albrecht include University of London & University of Bremen.
Papers
More filters
Journal ArticleDOI
On the concrete hardness of Learning with Errors
TL;DR: In this article, the authors present hardness results for concrete instances of LWE and give concrete estimates for various families of instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the Learning with Errors problem.
Posted Content
On the concrete hardness of Learning with Errors.
TL;DR: In this article, the authors present hardness results for concrete instances of LWE and give concrete estimates for various families of instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the Learning with Errors problem.
Book ChapterDOI
Ciphers for MPC and FHE
TL;DR: A delicate balance between linear and non-linear operations was always a delicate balance in the design of efficient cipher as mentioned in this paper, which goes back to the DES design and all the way back to Shannon's seminal work of Shannon.
Book ChapterDOI
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Martin R. Albrecht,Lorenzo Grassi,Christian Rechberger,Christian Rechberger,Arnab Roy,Tyge Tiessen +5 more
TL;DR: This work explores cryptographic primitives with low multiplicative complexity, motivated by recent progress in practical applications of secure multi-party computation, fully homomorphic encryption, and zero-knowledge proofs.
Book ChapterDOI
A Subfield Lattice Attack on Overstretched NTRU Assumptions
TL;DR: The subfield attack as mentioned in this paper exploits the presence of a subfield to solve overstretched versions of the NTRU assumption: norming the public key h down to a sub-field may lead to an easier lattice problem and any sufficiently good solution may be lifted to a short vector in the full nTRU-lattice.