Alexander May

Massimo Ostuzzi

IACR Cryptol. ePrint Arch., 2024

How to Lose Some Weight - A Practical Template Syndrome Decoding Attack.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

2023

Breaking Goppa-based McEliece with hints.

[BibT_eX]

[DOI]

Inf. Comput., August, 2023

Dlog is Practically as Hard (or Easy) as DH - Solving Dlogs via DH Oracles on EC Standards.

[BibT_eX]

[DOI]

Carl Richard Theodor Schneider

IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

Too Many Hints - When LLL Breaks LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

New NTRU Records with Improved Lattice Bases.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Entropy Suffices for Key Guessing.

[BibT_eX]

[DOI]

Timo Glaser

Jesús-Javier Chi-Domínguez

IACR Cryptol. ePrint Arch., 2023

Low Memory Attacks on Small Key CSIDH.

[BibT_eX]

[DOI]

Sabrina Kunzweiler

Chitchanok Chuengsatiansup

IACR Cryptol. ePrint Arch., 2023

Leaky McEliece: Secret Key Recovery From Highly Erroneous Side-Channel Information.

[BibT_eX]

[DOI]

Marcus Brinkmann

Yuval Yarom

IACR Cryptol. ePrint Arch., 2023

2022

Quantum Period Finding is Compression Robust.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2022

How to Backdoor (Classical) McEliece and How to Guard Against Backdoors.

[BibT_eX]

[DOI]

Carl Richard Theodor Schneider

IACR Cryptol. ePrint Arch., 2022

Approximate Divisor Multiples - Factoring with Only a Third of the Secret CRT-Exponents.

[BibT_eX]

[DOI]

Santanu Sarkar

IACR Cryptol. ePrint Arch., 2022

Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

How to Enumerate LWE Keys as Narrow as in Kyber/Dilithium.

[BibT_eX]

[DOI]

Timo Glaser

IACR Cryptol. ePrint Arch., 2022

Partial Key Exposure Attacks on BIKE, Rainbow and NTRU.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

How Not to Protect Your IP - An Industry-Wide Break of IEEE 1735 Implementations.

[BibT_eX]

[DOI]

Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

How to Backdoor (Classic) McEliece and How to Guard Against Backdoors.

[BibT_eX]

[DOI]

Tobias Hemmert

Carl Richard Theodor Schneider

Johannes Mittmann

Proceedings of the Post-Quantum Cryptography - 13th International Workshop, 2022

2021

Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing.

[BibT_eX]

[DOI]

Floyd Zweydinger

IACR Cryptol. ePrint Arch., 2021

Partial Key Exposure Attack on Short Secret Exponent CRT-RSA.

[BibT_eX]

[DOI]

Santanu Sarkar

IACR Cryptol. ePrint Arch., 2021

How to Meet Ternary LWE Keys.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

How to Find Ternary LWE Keys Using Locality Sensitive Hashing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Quantum Key Search for Ternary LWE.

[BibT_eX]

[DOI]

Iggy van Hoof

IACR Cryptol. ePrint Arch., 2021

McEliece needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD.

[BibT_eX]

[DOI]

Floyd Zweydinger

IACR Cryptol. ePrint Arch., 2021

Towards Quantum Large-Scale Password Guessing on Real-World Distributions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Noisy Simon Period Finding.

[BibT_eX]

[DOI]

Jonathan Schwinger

Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

2020

Can we Beat the Square Root Bound for ECDLP over 𝔽p2 via Representation?

[BibT_eX]

[DOI]

Claire Delaplace

J. Math. Cryptol., 2020

Solving subset sum with small space - Handling cryptanalytic Big Data.

[BibT_eX]

[DOI]

it Inf. Technol., 2020

The Power of Few Qubits and Collisions - Subset Sum Below Grover's Bound.

[BibT_eX]

[DOI]

Alexander Helm

Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

Low Weight Discrete Logarithm and Subset Sum in 20.65n with Polynomial Memory.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019

Low Weight Discrete Logarithms and Subset Sum in 20.65n with Polynomial Memory.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Can we Beat the Square Root Bound for ECDLP over Fp2 via Representations?

[BibT_eX]

[DOI]

Claire Delaplace

IACR Cryptol. ePrint Arch., 2019

Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions.

[BibT_eX]

[DOI]

Claire Delaplace

IACR Cryptol. ePrint Arch., 2019

Die Entwicklung und Umsetzung von IT-Sicherheitsstandards als sozialer Aushandlungsprozess.

[BibT_eX]

[DOI]

Datenschutz und Datensicherheit, 2019

Practical Period Finding on IBM Q - Quantum Speedups in the Presence of Errors.

[BibT_eX]

[DOI]

Jonathan Schwinger

CoRR, 2019

Quantum Period Finding with a Single Output Qubit - Factoring n-bit RSA with n/2 Qubits.

[BibT_eX]

[DOI]

CoRR, 2019

2018

LP Solutions of Vectorial Integer Subset Sums - Cryptanalysis of Galbraith's Binary Matrix LWE.

[BibT_eX]

[DOI]

Gottfried Herold

IACR Cryptol. ePrint Arch., 2018

On the Security of the PKCS#1 v1.5 Signature Scheme.

[BibT_eX]

[DOI]

Tibor Jager

Saqib A. Kakvi

IACR Cryptol. ePrint Arch., 2018

Dissection-BKW.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

On the asymptotic complexity of solving LWE.

[BibT_eX]

[DOI]

Gottfried Herold

Des. Codes Cryptogr., 2018

Subset Sum Quantumly in 1.17n.

[BibT_eX]

[DOI]

Alexander Helm

Proceedings of the 13th Conference on the Theory of Quantum Computation, 2018

2017

The Approximate k-List Problem.

[BibT_eX]

[DOI]

Leif Both

IACR Trans. Symmetric Cryptol., 2017

Grover Meets Simon - Quantumly Attacking the FX-construction.

[BibT_eX]

[DOI]

Gregor Leander

IACR Cryptol. ePrint Arch., 2017

LPN Decoded.

[BibT_eX]

[DOI]

Robert Kübler

IACR Cryptol. ePrint Arch., 2017

Decoding Linear Codes with High Error Rate and its Impact for LPN Security.

[BibT_eX]

[DOI]

Leif Both

IACR Cryptol. ePrint Arch., 2017

2016

Parallel Implementation of BDD enumeration for LWE.

[BibT_eX]

[DOI]

Friedrich Wiemer

IACR Cryptol. ePrint Arch., 2016

Public-Key Cryptography (Dagstuhl Seminar 16371).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

2015

On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes.

[BibT_eX]

[DOI]

Ilya Ozerov

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014

A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups.

[BibT_eX]

[DOI]

Ilya Ozerov

Proceedings of the Selected Areas in Cryptography - SAC 2014, 2014

2012

Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Certifying RSA.

[BibT_eX]

[DOI]

Saqib A. Kakvi

Eike Kiltz

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

Public-Key Cryptography (Dagstuhl Seminar 11391).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

On CCA-Secure Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography - 18th International Workshop, 2011

Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$.

[BibT_eX]

[DOI]

Alexander Meurer

Enrico Thomae

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

Using LLL-Reduction for Solving RSA and Factorization Problems.

[BibT_eX]

[DOI]

Proceedings of the LLL Algorithm - Survey and Applications, 2010

On CCA-Secure Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2010

Correcting Errors in RSA Private Keys.

[BibT_eX]

[DOI]

Wilko Henecka

Alexander Meurer

Proceedings of the Advances in Cryptology, 2010

2009

Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint.

[BibT_eX]

[DOI]

Maike Ritzenhofen

Proceedings of the Public Key Cryptography, 2009

Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?

[BibT_eX]

[DOI]

Maike Ritzenhofen

Proceedings of the Public Key Cryptography, 2008

Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring.

[BibT_eX]

[DOI]

Jean-Sébastien Coron

J. Cryptol., 2007

On Factoring Arbitrary Integers with Known Bits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073.

[BibT_eX]

[DOI]

Ellen Jochemsz

Proceedings of the Advances in Cryptology, 2007

2006

Perspectives for cryptographic long-term security.

[BibT_eX]

[DOI]

Johannes Buchmann

Ulrich Vollmer

Commun. ACM, 2006

New Attacks on RSA with Small Secret CRT-Exponents.

[BibT_eX]

[DOI]

Daniel Bleichenbacher

Proceedings of the Public Key Cryptography, 2006

A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants.

[BibT_eX]

[DOI]

Ellen Jochemsz

Proceedings of the Advances in Cryptology, 2006

2005

Partial Key Exposure Attacks on RSA up to Full Size Exponents.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Secret Exponent Attacks on RSA-type Schemes with Moduli N= prq.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2004

A Generalized Wiener Attack on RSA.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2004

Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

2003

New RSA vulnerabilities using lattice reduction methods.

[BibT_eX]

[DOI]

PhD thesis, 2003

New Partial Key Exposure Attacks on RSA.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

2002

Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2002

2001

Key Revocation with Interval Cover Families.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

Dimension Reduction Methods for Convolution Modular Lattices.

[BibT_eX]

[DOI]

Joseph H. Silverman

Proceedings of the Cryptography and Lattices, International Conference, 2001

Low Secret Exponent RSA Revisited.

[BibT_eX]

[DOI]