On CCA-Secure Fully Homomorphic Encryption.
Frederik Vercauteren , Nigel P. Smart , Jake Loftus , Alexander May
IACR Cryptology ePrint Archive 2010 560
4
2010
A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
Ellen Jochemsz , Alexander May
Lecture Notes in Computer Science 267 -282
179
2006
The Approximate k-List Problem
Alexander May , Leif Both
IACR Cryptology ePrint Archive 2017 ( 1) 380 -397
1
2017
Subset Sum Quantumly in 1.17 n .
Alexander May , Alexander Helm
conference on theory of quantum computation communication and cryptography 15
1
2018
On Factoring Arbitrary Integers with Known Bits.
Alexander May , Mathias Herrmann
IACR Cryptology ePrint Archive 2007 374
2007
Solving ECDLP over F p with Pre-computation via Representation Technique
Pierre-Alain Fouque , Alexander May , Paul Kirchner , Claire Delaplace
2020
Parallel Implementation of BDD enumeration for LWE.
Alexander May , Friedrich Wiemer , Elena Kirshanova
IACR Cryptology ePrint Archive 2016 380
2016
Noisy Simon Period Finding.
Alexander May , Lars Schlieper , Jonathan Schwinger
the cryptographers’ track at the rsa conference 75 -99
2021
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
Alexander May
Advances in Cryptology – CRYPTO 2004 213 -219
49
2004
On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
Alexander May , Ilya Ozerov
theory and application of cryptographic techniques 203 -228
91
2015
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
Claire Delaplace , Andre Esser , Alexander May
IMA International Conference on Cryptography and Coding 178 -199
16
2019
On the asymptotic complexity of solving LWE
Gottfried Herold , Elena Kirshanova , Alexander May
Designs, Codes and Cryptography 86 ( 1) 55 -83
20
2018
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
Alexander May , Maike Ritzenhofen
Public Key Cryptography – PKC 2009 1 -14
48
2009
The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
Alexander Helm , Alexander May
International Conference on Post-Quantum Cryptography 445 -460
3
2020
A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
Alexander May , Ilya Ozerov
selected areas in cryptography 278 -289
4
2014
On the Security of the PKCS#1 v1.5 Signature Scheme
Tibor Jager , Saqib A. Kakvi , Alexander May
computer and communications security 1195 -1208
6
2018
A Generalized Wiener Attack on RSA
Johannes Blömer , Alexander May
public key cryptography 1 -13
51
2004
LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
Gottfried Herold , Alexander May
public key cryptography 2018 3 -15
4
2017
A tool kit for finding small roots of bivariate polynomials over the integers
Johannes Blömer , Alexander May
theory and application of cryptographic techniques 251 -267
47
2005
Alexander Meurer Johannes Bloemer Elena Kirshanova Antoine Joux Anja Becker Frederik Vercauteren Nigel Smart Gregor Leander Saqib A. Kakvi Jean-Sebastien Coron Joseph H. Silverman Jake Loftus Wilko Henecka Santanu Sarkar Eike Kiltz Christian Sohler Tibor Jager Friedrich Wiemer Weiqiang Wen Marc Fischlin