| Publication | Date of Publication | Type |
|---|
\(d\)-MUL: optimizing and implementing a multidimensional scalar multiplication algorithm over elliptic curves
Security, Privacy, and Applied Cryptography Engineering | 2023-11-01 | Paper |
Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
Security, Privacy, and Applied Cryptography Engineering | 2022-12-09 | Paper |
A new encoding algorithm for a multidimensional version of the Montgomery ladder
Progress in Cryptology - AFRICACRYPT 2020 | 2022-11-09 | Paper |
| Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography | 2022-07-06 | Paper |
| Memory optimization techniques for computing discrete logarithms in compressed SIKE | 2022-03-22 | Paper |
| scientific article; zbMATH DE number 7272516 (Why is no real title available?) | 2020-11-10 | Paper |
| Constructing canonical strategies for parallel implementation of isogeny based cryptography | 2019-03-29 | Paper |
Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields
IEEE Transactions on Computers | 2017-08-08 | Paper |
Torus-Based Compression by Factor 4 and 6
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
A New Double Point Multiplication Algorithm and Its Application to Binary Elliptic Curves with Endomorphisms
IEEE Transactions on Computers | 2017-06-20 | Paper |
Fault Attacks on Pairing-Based Protocols: Revisited
IEEE Transactions on Computers | 2017-05-16 | Paper |
Revisiting the false acceptance rate attack on biometric visual cryptographic schemes
Lecture Notes in Computer Science | 2017-01-06 | Paper |
Point decomposition problem in binary elliptic curves
Lecture Notes in Computer Science | 2016-05-19 | Paper |
Generalizations of Verheul's theorem to asymmetric pairings
Advances in Mathematics of Communications | 2013-05-06 | Paper |
Squaring in cyclotomic subgroups
Mathematics of Computation | 2013-03-20 | Paper |
Invalid-curve attacks on (hyper)elliptic curve cryptosystems
Advances in Mathematics of Communications | 2011-06-03 | Paper |
Faster explicit formulas for computing pairings over ordinary curves
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
On the asymptotic effectiveness of Weil descent attacks
Journal of Mathematical Cryptology | 2010-11-12 | Paper |
Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
Journal of Mathematical Cryptology | 2010-08-13 | Paper |
Double-exponentiation in factor-4 groups and its applications
Cryptography and Coding | 2010-01-07 | Paper |
A new protocol for the nearby friend problem
Cryptography and Coding | 2010-01-07 | Paper |
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
Lecture Notes in Computer Science | 2008-05-27 | Paper |
