| Publication | Date of Publication | Type |
|---|
| That's AmorE: amortized efficiency for pairing delegation | 2026-02-06 | Paper |
| Polynomial time cryptanalytic extraction of deep neural networks in the hard-label setting | 2025-11-20 | Paper |
\textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves
Journal of Cryptology | 2024-12-27 | Paper |
| Polynomial time cryptanalytic extraction of neural network models | 2024-11-13 | Paper |
| Verifiable isogeny walks: towards an isogeny-based postquantum VDF | 2024-10-14 | Paper |
\textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Parallel isogeny path finding with limited memory
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Optimal strategies for CSIDH
Advances in Mathematics of Communications | 2022-10-18 | Paper |
Parallel strategies for SIDH: Towards computing SIDH twice as fast
IEEE Transactions on Computers | 2022-08-05 | Paper |
| LOVE a pairing | 2022-06-15 | Paper |
| Faulty isogenies: a new kind of leakage | 2022-02-10 | Paper |
Koblitz curves over quadratic fields
Journal of Cryptology | 2019-08-13 | Paper |
| On the cost of computing isogenies between supersingular elliptic curves | 2019-02-20 | Paper |
A Faster Software Implementation of the Supersingular Isogeny Diffie-Hellman Key Exchange Protocol
IEEE Transactions on Computers | 2018-12-04 | Paper |
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
Advances in Mathematics of Communications | 2018-11-15 | Paper |
Smoothness test for polynomials defined over small characteristic finite fields
Mathematics in Computer Science | 2018-11-01 | Paper |
| How to (pre-)compute a ladder -- improving the performance of X25519 and X448 | 2018-04-26 | Paper |
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
IEEE Transactions on Computers | 2017-11-10 | Paper |
On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One
IEEE Transactions on Computers | 2017-09-08 | Paper |
Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis
IEEE Transactions on Computers | 2017-07-27 | Paper |
Reconfigurable Hardware Implementations of Tweakable Enciphering Schemes
IEEE Transactions on Computers | 2017-07-27 | Paper |
Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
IEEE Transactions on Computers | 2017-07-27 | Paper |
Efficient hardware implementations of brw polynomials and tweakable enciphering schemes
IEEE Transactions on Computers | 2017-07-12 | Paper |
Square Root Computation over Even Extension Fields
IEEE Transactions on Computers | 2017-06-20 | Paper |
Software Implementation of an Attribute-Based Encryption Scheme
IEEE Transactions on Computers | 2017-05-16 | Paper |
Fast point multiplication algorithms for binary elliptic curves with and without precomputation
Selected Areas in Cryptography -- SAC 2014 | 2016-04-13 | Paper |
Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
Arithmetic of Finite Fields | 2015-10-01 | Paper |
Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
Finite Fields and their Applications | 2015-01-30 | Paper |
Low-cost addition-subtraction sequences for the final exponentiation in pairings
Finite Fields and their Applications | 2014-09-02 | Paper |
Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
Pairing-Based Cryptography – Pairing 2013 | 2014-02-18 | Paper |
\(\lambda\)-coordinates for binary elliptic curves
Cryptographic Hardware and Embedded Systems - CHES 2013 | 2013-10-10 | Paper |
Implementing pairings at the 192-bit security level
Pairing-Based Cryptography – Pairing 2012 | 2013-04-04 | Paper |
Faster implementation of scalar multiplication on Koblitz curves
Progress in Cryptology – LATINCRYPT 2012 | 2012-09-21 | Paper |
Faster hashing to \({\mathbb G}_2\)
Selected Areas in Cryptography | 2012-06-08 | Paper |
Parallelizing the Weil and Tate pairings
Cryptography and Coding | 2011-12-16 | Paper |
Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication
Cryptographic hardware and embedded systems -- CHES 2011. 13th international workshop, Nara, Japan, September 28--October 1, 2011. Proceedings | 2011-10-07 | Paper |
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
Lecture Notes in Computer Science | 2010-11-26 | Paper |
Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
Cryptology and Network Security | 2009-11-26 | Paper |
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
Lecture Notes in Computer Science | 2009-11-10 | Paper |
A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
Pairing-Based Cryptography – Pairing 2008 | 2009-02-10 | Paper |
| Parallel formulations of scalar multiplication on Koblitz curves | 2008-08-07 | Paper |
Comments on: ``How to repair the Hill cipher''
Journal of Zhejiang University. Science A | 2008-05-26 | Paper |
Efficient Implementations of Some Tweakable Enciphering Schemes in Reconfigurable Hardware
Lecture Notes in Computer Science | 2008-04-11 | Paper |
Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
Designs, Codes and Cryptography | 2007-09-20 | Paper |
Parallel multipliers based on special irreducible pentanomials
IEEE Transactions on Computers | 2007-01-09 | Paper |
