| Publication | Date of Publication | Type |
|---|
| Attack on LAC Key Exchange in Misuse Situation | 2023-03-22 | Paper |
| On using RSA/ECC coprocessor for ideal lattice-based key exchange | 2022-06-17 | Paper |
| Assessment of the key-reuse resilience of NewHope | 2020-01-28 | Paper |
A probabilistic analysis on a lattice attack against DSA
Designs, Codes and Cryptography | 2019-10-17 | Paper |
| Quadratic time algorithm for inversion of binary permutation polynomials | 2018-08-17 | Paper |
Computation of the splitting field of a dihedral polynomial
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Factoring $$N=p^rq^s$$ for Large r and s
Topics in Cryptology - CT-RSA 2016 | 2016-04-08 | Paper |
| On the p-adic stability of the FGLM algorithm | 2016-02-02 | Paper |
Attacking (EC)DSA given only an implicit hint
Selected Areas in Cryptography | 2015-12-04 | Paper |
Sub-cubic change of ordering for Gröbner basis: a probabilistic approach
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Using symmetries in the index calculus for elliptic curves discrete logarithm
Journal of Cryptology | 2015-01-07 | 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 |
Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Efficient arithmetic in successive algebraic extension fields using symmetries
Mathematics in Computer Science | 2013-04-24 | Paper |
Combined attack on CRT-RSA. Why public verification must not be public?
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Improving the complexity of index calculus algorithms in elliptic curves over binary fields
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Computation schemes for splitting fields of polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time
Lecture Notes in Computer Science | 2010-11-26 | Paper |
Implicit Factoring with Shared Most Significant and Middle Bits
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
QUINTIC POLYNOMIALS OF HASHIMOTO–TSUNOGAI, BRUMER AND KUMMER
International Journal of Number Theory | 2009-07-06 | Paper |
Multi-modular algorithm for computing the splitting field of a polynomial
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Computation of the decomposition group of a triangular ideal
Applicable Algebra in Engineering, Communication and Computing | 2005-02-09 | Paper |
