| Publication | Date of Publication | Type |
|---|
MPC in the head using the subfield bilinear collision problem
| 2024-12-04 | Paper |
Key recovery attack on the partial Vandermonde knapsack problem
| 2024-11-13 | Paper |
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
Advances in Mathematics of Communications | 2024-08-06 | Paper |
On the hardness of the finite field isomorphism problem
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Short signatures from regular syndrome decoding in the head
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7716603 (Why is no real title available?)
| 2023-07-25 | Paper |
Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
Designs, Codes and Cryptography | 2023-04-21 | Paper |
Practical post-quantum signature schemes from isomorphism problems of trilinear forms
| 2022-08-30 | Paper |
On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
| 2022-07-06 | Paper |
Computing discrete logarithms
| 2022-02-25 | Paper |
A new public-key cryptosystem via Mersenne numbers
| 2020-06-30 | Paper |
Certified lattice reduction
Advances in Mathematics of Communications | 2019-11-26 | Paper |
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
| 2019-07-05 | Paper |
A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms
Mathematics of Computation | 2019-06-14 | Paper |
How to securely compute with noisy leakage in quasilinear complexity
| 2019-01-23 | Paper |
A crossbred algorithm for solving Boolean polynomial systems
| 2018-06-05 | Paper |
The action of a few random permutations on r-tuples and an application to cryptography
STACS 96 | 2017-11-16 | Paper |
On the Security of Blockwise Secure Modes of Operation Beyond the Birthday Bound
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Reducing number field defining polynomials: an application to class group computations
LMS Journal of Computation and Mathematics | 2017-04-04 | Paper |
scientific article; zbMATH DE number 6696740 (Why is no real title available?)
| 2017-03-23 | Paper |
Nearly sparse linear algebra and application to discrete logarithms computations
Contemporary Developments in Finite Fields and Applications | 2016-11-08 | Paper |
Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
Designs, Codes and Cryptography | 2016-02-02 | Paper |
A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
Selected Areas in Cryptography -- SAC 2013 | 2015-10-01 | Paper |
The past, evolving present, and future of the discrete logarithm
Open Problems in Mathematics and Computational Science | 2015-06-22 | Paper |
Cryptanalysis of SHA-0 and reduced SHA-1
Journal of Cryptology | 2015-03-25 | Paper |
Multi-user collisions: applications to discrete logarithm, Even-Mansour and PRINCE
Lecture Notes in Computer Science | 2015-01-16 | Paper |
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
Lecture Notes in Computer Science | 2015-01-16 | Paper |
A sieve algorithm based on overlattices
LMS Journal of Computation and Mathematics | 2014-09-05 | Paper |
A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Recovering a sum of two squares decomposition
Journal of Symbolic Computation | 2014-03-03 | Paper |
The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
Pairing-Based Cryptography – Pairing 2013 | 2014-02-18 | Paper |
Injective encodings to elliptic curves
Information Security and Privacy | 2013-06-28 | Paper |
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
| 2013-06-18 | Paper |
Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Elliptic curve discrete logarithm problem over small degree extension fields
Journal of Cryptology | 2013-04-15 | Paper |
Pairing the volcano
Mathematics of Computation | 2013-03-20 | Paper |
Towards super-exponential side-channel security with efficient leakage-resilient PRFs
Cryptographic Hardware and Embedded Systems – CHES 2012 | 2012-11-13 | Paper |
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Cover and decomposition index calculus on elliptic curves made practical. Application to a previously unreachable curve over \(\mathbb{F}_{p^6}\)
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
A tutorial on high performance computing applied to cryptanalysis. (Invited talk abstract)
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
A family of weak keys in HFE and the corresponding practical key-recovery
Journal of Mathematical Cryptology | 2012-03-22 | Paper |
Improved Generic Algorithms for Hard Knapsacks
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Algorithms to solve the finite field discrete logarithm problem
| 2011-05-18 | Paper |
Cryptanalysis of the RSA subgroup assumption from TCC 2005
Public Key Cryptography – PKC 2011 | 2011-03-15 | Paper |
A Variant of the F4 Algorithm
Topics in Cryptology – CT-RSA 2011 | 2011-02-11 | Paper |
scientific article; zbMATH DE number 5821921 (Why is no real title available?)
| 2010-12-01 | Paper |
Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree
Lecture Notes in Computer Science | 2010-11-26 | Paper |
Pairing the volcano
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Cryptanalysis of the hidden matrix cryptosystem
Lecture Notes in Computer Science | 2010-08-31 | Paper |
New generic algorithms for hard knapsacks
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
Cryptography and Coding | 2010-01-07 | Paper |
Loosening the KNOT.
Lecture Notes in Computer Science | 2010-01-05 | Paper |
New attacks against standardized MACs.
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Improved Generic Algorithms for 3-Collisions
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Fault Attacks on RSA Signatures with Partially Unknown Messages
Lecture Notes in Computer Science | 2009-11-10 | Paper |
Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers
Selected Areas in Cryptography | 2009-11-03 | Paper |
Algorithmic Cryptanalysis
| 2009-08-06 | Paper |
Chosen-Ciphertext Attacks Against MOSQUITO
Fast Software Encryption | 2009-04-02 | Paper |
Introduction to identity-based cryptography
| 2009-03-24 | Paper |
Hash Functions and the (Amplified) Boomerang Attack
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Another Approach to Pairing Computation in Edwards Coordinates
Progress in Cryptology - INDOCRYPT 2008 | 2009-01-22 | Paper |
Overtaking VEST
Fast Software Encryption | 2008-09-16 | Paper |
Yet Another Attack on Vest
Progress in Cryptology – AFRICACRYPT 2008 | 2008-06-13 | Paper |
When e-th Roots Become Easier Than Factoring
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Collisions of SHA-0 and Reduced SHA-1
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Galois LFSR, Embedded Devices and Side Channel Weaknesses
Progress in Cryptology - INDOCRYPT 2006 | 2008-04-11 | Paper |
Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
Advances in Cryptology - EUROCRYPT 2007 | 2007-11-29 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
The Function Field Sieve in the Medium Prime Case
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Inverting HFE Is Quasipolynomial
Lecture Notes in Computer Science | 2007-09-04 | Paper |
The Number Field Sieve in the Medium Prime Case
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Selected Areas in Cryptography
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Fast Software Encryption
Lecture Notes in Computer Science | 2006-06-22 | Paper |
A NICE cryptanalysis
| 2006-03-01 | Paper |
Selected Areas in Cryptography
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Selected Areas in Cryptography
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Public Key Cryptography - PKC 2005
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
A one round protocol for tripartite Diffie-Hellman
Journal of Cryptology | 2005-04-15 | Paper |
scientific article; zbMATH DE number 2089141 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2086708 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086872 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086903 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2009945 (Why is no real title available?)
| 2003-11-26 | Paper |
scientific article; zbMATH DE number 1942410 (Why is no real title available?)
| 2003-06-30 | Paper |
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
Mathematics of Computation | 2003-02-19 | Paper |
scientific article; zbMATH DE number 1759769 (Why is no real title available?)
| 2002-10-07 | Paper |
scientific article; zbMATH DE number 1618047 (Why is no real title available?)
| 2002-07-10 | Paper |
scientific article; zbMATH DE number 1759262 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1643939 (Why is no real title available?)
| 2001-09-09 | Paper |
scientific article; zbMATH DE number 1583767 (Why is no real title available?)
| 2001-07-03 | Paper |
``Chinese \& Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
Mathematics of Computation | 2001-02-19 | Paper |
The action of a few permutations onr-tuples is quickly transitive
| 1999-12-19 | Paper |
scientific article; zbMATH DE number 1346512 (Why is no real title available?)
| 1999-10-03 | Paper |
Lattice reduction: a toolbox for the cryptoanalyst
Journal of Cryptology | 1999-08-26 | Paper |
scientific article; zbMATH DE number 1302838 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1088903 (Why is no real title available?)
| 1997-12-14 | Paper |
On character sums related to elliptic curves with complex multiplication
Journal of Number Theory | 1996-07-16 | Paper |
scientific article; zbMATH DE number 697835 (Why is no real title available?)
| 1994-11-30 | Paper |
scientific article; zbMATH DE number 176550 (Why is no real title available?)
| 1993-05-18 | Paper |
Improved low-density subset sum algorithms
Computational Complexity | 1993-04-01 | Paper |
