Martin R. Albrecht

Affiliations:
  • King's College London, UK
  • Royal Holloway University of London, UK (PhD)
  • Technical University of Denmark (DTU), Section for Mathematics, Copenhagen, Denmark
  • Pierre and Marie Curie University, LIP6, Paris, France


According to our database1, Martin R. Albrecht authored at least 83 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Analysing Cryptography in the Wild - A Retrospective.
IACR Cryptol. ePrint Arch., 2024

Share with Care: Breaking E2EE in Nextcloud.
IACR Cryptol. ePrint Arch., 2024

2023
Variational quantum solutions to the Shortest Vector Problem.
Quantum, March, 2023

Batch Signatures, Revisited.
IACR Cryptol. ePrint Arch., 2023

Practically-exploitable Vulnerabilities in the Jitsi Video Conferencing System.
IACR Cryptol. ePrint Arch., 2023

Four Attacks and a Proof for Telegram.
IACR Cryptol. ePrint Arch., 2023

Caveat Implementor! Key Recovery Attacks on MEGA.
IACR Cryptol. ePrint Arch., 2023

SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2023

Device-Oriented Group Messaging: A Formal Cryptographic Analysis of Matrix' Core.
IACR Cryptol. ePrint Arch., 2023

Crypto Dark Matter on the Torus: Oblivious PRFs from shallow PRFs and FHE.
IACR Cryptol. ePrint Arch., 2023

Practically-exploitable Cryptographic Vulnerabilities in Matrix.
IACR Cryptol. ePrint Arch., 2023

2022
Quantum Augmented Dual Attack.
IACR Cryptol. ePrint Arch., 2022

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable.
IACR Cryptol. ePrint Arch., 2022

Breaking Bridgefy, again: Adopting libsignal is not enough.
Proceedings of the 31st USENIX Security Symposium, 2022

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices.
IACR Cryptol. ePrint Arch., 2021

Lattice Attacks on NTRU and LWE: A History of Refinements.
IACR Cryptol. ePrint Arch., 2021

Mesh Messaging in Large-scale Protests: Breaking Bridgefy.
IACR Cryptol. ePrint Arch., 2021

Collective Information Security in Large-Scale Urban Protests: the Case of Hong Kong.
Proceedings of the 30th USENIX Security Symposium, 2021

2020
Multilinear Maps from Obfuscation.
J. Cryptol., 2020

On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number Problem.
IACR Cryptol. ePrint Arch., 2020

Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance.
IACR Cryptol. ePrint Arch., 2020

Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)).
IACR Cryptol. ePrint Arch., 2020

The Vacuity of the Open Source Security Testing Methodology Manual.
Proceedings of the Security Standardisation Research - 6th International Conference, 2020

Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k<sup>1/(2k)</sup> Time k<sup>k/8+o(k)</sup>.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Estimating Quantum Speedups for Lattice Sieves.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Implementing RLWE-based Schemes Using an RSA Co-Processor.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019

libInterMAC: Beyond Confidentiality and Integrity in Practice.
IACR Cryptol. ePrint Arch., 2019

Quantum speedups for lattice sieves are tenuous at best.
IACR Cryptol. ePrint Arch., 2019

Feistel Structures for MPC, and More.
IACR Cryptol. ePrint Arch., 2019

The General Sieve Kernel and New Records in Lattice Reduction.
IACR Cryptol. ePrint Arch., 2019

Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices.
IACR Cryptol. ePrint Arch., 2019

Exploring Trade-offs in Batch Bounded Distance Decoding.
IACR Cryptol. ePrint Arch., 2019

Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC.
IACR Cryptol. ePrint Arch., 2019

Homomorphic Encryption Standard.
IACR Cryptol. ePrint Arch., 2019

2018
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

Prime and Prejudice: Primality Testing Under Adversarial Conditions.
IACR Cryptol. ePrint Arch., 2018

Learning with Errors on RSA Co-Processors.
IACR Cryptol. ePrint Arch., 2018

Estimate all the {LWE, NTRU} schemes!
IACR Cryptol. ePrint Arch., 2018

2017
Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts.
IACR Cryptol. ePrint Arch., 2017

Revisiting the Expected Cost of Solving uSVP and Applications to LWE.
IACR Cryptol. ePrint Arch., 2017

Notes On GGH13 Without The Presence Of Ideals.
IACR Cryptol. ePrint Arch., 2017

Large Modulus Ring-LWE >= Module-LWE.
IACR Cryptol. ePrint Arch., 2017

On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL.
IACR Cryptol. ePrint Arch., 2017

Notes on GGH13 Without the Presence of Ideals.
Proceedings of the Cryptography and Coding - 16th IMA International Conference, 2017

Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography.
Proceedings of the Applied Cryptography and Network Security, 2017

2016
Ciphers for MPC and FHE.
IACR Cryptol. ePrint Arch., 2016

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity.
IACR Cryptol. ePrint Arch., 2016

A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and Graded Encoding Schemes.
IACR Cryptol. ePrint Arch., 2016

Polly Cracker, revisited.
Des. Codes Cryptogr., 2016

A Surfeit of SSH Cipher Suites.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
On the concrete hardness of Learning with Errors.
IACR Cryptol. ePrint Arch., 2015

Lucky Microseconds: A Timing Attack on Amazon's s2n Implementation of TLS.
IACR Cryptol. ePrint Arch., 2015

Multilinear Maps from Obfuscation.
IACR Cryptol. ePrint Arch., 2015

On the complexity of the BKW algorithm on LWE.
Des. Codes Cryptogr., 2015

Algebraic algorithms for LWE problems.
ACM Commun. Comput. Algebra, 2015

Implementing Candidate Graded Encoding Schemes from Ideal Lattices.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Lazy Modulus Switching for the BKW Algorithm on LWE.
IACR Cryptol. ePrint Arch., 2014

Block Ciphers - Focus On The Linear Layer (feat. PRIDE): Full Version.
IACR Cryptol. ePrint Arch., 2014

Improved Parameters and an Implementation of Graded Encoding Schemes from Ideal Lattices.
IACR Cryptol. ePrint Arch., 2014

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Block Ciphers - Focus on the Linear Layer (feat. PRIDE).
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
On the Efficacy of Solving LWE by Reduction to Unique-SVP.
IACR Cryptol. ePrint Arch., 2013

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions.
IACR Cryptol. ePrint Arch., 2013

2012
On the relation between the MXL family of algorithms and Gröbner basis algorithms.
J. Symb. Comput., 2012

An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers.
IACR Cryptol. ePrint Arch., 2012

The M4RIE library for dense linear algebra over small fields with even characteristic.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model.
IACR Cryptol. ePrint Arch., 2011

Polly Cracker, Revisited.
IACR Cryptol. ePrint Arch., 2011

On the Relation Between the Mutant Strategy and the Normal Selection Strategy in Gröbner Basis Algorithms.
IACR Cryptol. ePrint Arch., 2011

Cold Boot Key Recovery by Solving Polynomial Systems with Noise.
IACR Cryptol. ePrint Arch., 2011

Efficient Dense Gaussian Elimination over the Finite Field with Two Elements
CoRR, 2011

2010
Algorithmic algebraic techniques and their application to block cipher cryptanalysis.
PhD thesis, 2010

Algorithm 898: Efficient multiplication of dense matrices over GF(2).
ACM Trans. Math. Softw., 2010

Breaking An Identity-Based Encryption Scheme based on DHIES.
IACR Cryptol. ePrint Arch., 2010

Efficient Decomposition of Dense Matrices over GF(2)
CoRR, 2010

Algebraic Precomputations in Differential and Integral Cryptanalysis.
Proceedings of the Information Security and Cryptology - 6th International Conference, 2010

2009
Attacking Cryptographic Schemes Based on "Perturbation Polynomials".
IACR Cryptol. ePrint Arch., 2009

Plaintext Recovery Attacks against SSH.
Proceedings of the 30th IEEE Symposium on Security and Privacy (SP 2009), 2009

2008
Algebraic Techniques in Differential Cryptanalysis.
IACR Cryptol. ePrint Arch., 2008

Algebraic Attacks on the Courtois Toy Cipher.
Cryptologia, 2008

Efficient Multiplication of Dense Matrices over GF(2)
CoRR, 2008

2005
AIMEE: A Four-Legged Robot for RoboCup Rescue.
Proceedings of the Climbing and Walking Robots, 2005


  Loading...