Benjamin Wesolowski

Orcid: 0000-0003-1249-6077

According to our database1, Benjamin Wesolowski authored at least 35 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The supersingular Endomorphism Ring and One Endomorphism problems are equivalent.
IACR Cryptol. ePrint Arch., 2023

The supersingular endomorphism ring problem given one endomorphism.
IACR Cryptol. ePrint Arch., 2023

A Direct Key Recovery Attack on SIDH.
IACR Cryptol. ePrint Arch., 2023

SCALLOP: scaling the CSI-FiSh.
IACR Cryptol. ePrint Arch., 2023

Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals.
IACR Cryptol. ePrint Arch., 2023

SQISignHD: New Dimensions in Cryptography.
IACR Cryptol. ePrint Arch., 2023

Finding Orientations of Supersingular Elliptic Curves and Quaternion Orders.
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
Computing isogenies between finite Drinfeld modules.
IACR Cryptol. ePrint Arch., 2022

New algorithms for the Deuring correspondence: SQISign twice as fast.
IACR Cryptol. ePrint Arch., 2022

On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves.
IACR Cryptol. ePrint Arch., 2022

Supersingular Curves You Can Trust.
IACR Cryptol. ePrint Arch., 2022

2021
Computation of a 30750-bit binary field discrete logarithm.
Math. Comput., 2021

Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time.
J. ACM, 2021

Orientations and the supersingular endomorphism ring problem.
IACR Cryptol. ePrint Arch., 2021

The supersingular isogeny path and endomorphism ring problems are equivalent.
IACR Cryptol. ePrint Arch., 2021

Séta: Supersingular Encryption from Torsion Attacks.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Efficient Verifiable Delay Functions.
J. Cryptol., 2020

Lower bounds for the depth of modular squaring.
IACR Cryptol. ePrint Arch., 2020

SQISign: compact post-quantum signatures from quaternions and isogenies.
IACR Cryptol. ePrint Arch., 2020

Random Self-reducibility of Ideal-SVP via Arakelov Random Walks.
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

On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm.
IACR Cryptol. ePrint Arch., 2019

2018
Arithmetic and geometric structures in cryptography.
PhD thesis, 2018

A new perspective on the powers of two descent for discrete logarithms in finite fields.
IACR Cryptol. ePrint Arch., 2018

Malleability of the blockchain's entropy.
Cryptogr. Commun., 2018

2017
Trustworthy public randomness with sloth, unicorn, and trx.
Int. J. Appl. Cryptogr., 2017

Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem.
IACR Cryptol. ePrint Arch., 2017

Loop-abort faults on supersingular isogeny cryptosystems.
IACR Cryptol. ePrint Arch., 2017

2016
Short Stickelberger Class Relations and application to Ideal-SVP.
IACR Cryptol. ePrint Arch., 2016

Isogeny graphs of ordinary abelian varieties.
IACR Cryptol. ePrint Arch., 2016

2015
Ciphertext-Policy Attribute-Based Broadcast Encryption with Small Keys.
IACR Cryptol. ePrint Arch., 2015

A random zoo: sloth, unicorn, and trx.
IACR Cryptol. ePrint Arch., 2015

On Graphs of Isogenies of Principally Polarizable Abelian Surfaces and the Discrete Logarithm Problem.
CoRR, 2015


  Loading...