Benjamin Wesolowski
Orcid: 0000-0003-1249-6077
According to our database1,
Benjamin Wesolowski
authored at least 37 papers
between 2015 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Des. Codes Cryptogr., November, 2024
IACR Cryptol. ePrint Arch., 2024
2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
New Algorithms for the Deuring Correspondence - Towards Practical and Secure SQISign Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023
2022
IACR Cryptol. ePrint Arch., 2022
On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves.
IACR Cryptol. ePrint Arch., 2022
2021
J. ACM, 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021
2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
A note on the low order assumption in class group of an imaginary quadratic number fields.
IACR Cryptol. ePrint Arch., 2020
2019
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic.
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
2018
A new perspective on the powers of two descent for discrete logarithms in finite fields.
IACR Cryptol. ePrint Arch., 2018
2017
Int. J. Appl. Cryptogr., 2017
Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem.
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
2016
IACR Cryptol. ePrint Arch., 2016
2015
IACR Cryptol. ePrint Arch., 2015
On Graphs of Isogenies of Principally Polarizable Abelian Surfaces and the Discrete Logarithm Problem.
CoRR, 2015