Benjamin Wesolowski

École Normale Supérieure de Lyon — France

Computer Science · Physical Sciences

18h-index1.3kcitations66works8.12yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Residue Arithmetic(37), Coding theory and cryptography(33), Cryptography and Data Security(24), Algebraic Geometry and Number Theory(18), Chaos-based Image/Signal Encryption(11)

Publications66 total

Unconditional Foundations for Supersingular Isogeny-Based Cryptography
Lecture notes in computer science·2025Open Access
Average hardness of SIVP for module lattices of fixed rank
ArXiv.org·2025Open Access
Rigorous Methods for Computational Number Theory
ArXiv.org·2025Open Access
The supersingular endomorphism ring problem given one endomorphism
IACR Communications in Cryptology·2025Open Access
On the computation of endomorphism rings of abelian surfaces over finite fields
arXiv (Cornell University)·2025Open Access
PRISM: Simple and Compact Identification and Signatures from Large Prime Degree Isogenies
Lecture notes in computer science·2025· 4 citedOpen Access
A Complete Security Proof of SQIsign
Lecture notes in computer science·2025· 3 citedOpen Access
PEGASIS: Practical Effective Class Group Action using 4-Dimensional Isogenies
Lecture notes in computer science·2025· 9 citedOpen Access
SQIsign2D–West
Lecture notes in computer science·2024· 27 cited
SQIsign2D-West The Fast, the Small, and the Safer
SPIRE - Sciences Po Institutional REpository·2024· 3 citedOpen Access
Random Walks in Number-theoretic Cryptology
SPIRE - Sciences Po Institutional REpository·2024· 1 citedOpen Access
Finding orientations of supersingular elliptic curves and quaternion orders
Designs Codes and Cryptography·2024· 6 citedOpen Access
Computing isogenies between finite Drinfeld modules
IACR Communications in Cryptology·2024· 1 citedOpen Access
Cryptanalysis of Algebraic Verifiable Delay Functions
Lecture notes in computer science·2024· 6 citedOpen Access
The Supersingular Endomorphism Ring and One Endomorphism Problems are Equivalent
Lecture notes in computer science·2024· 18 citedOpen Access
SQIsignHD: New Dimensions in Cryptography
Lecture notes in computer science·2024· 51 citedOpen Access
The supersingular endomorphism ring problem given one endomorphism
arXiv (Cornell University)·2023· 1 citedOpen Access
The supersingular Endomorphism Ring and One Endomorphism problems are equivalent
arXiv (Cornell University)·2023· 1 citedOpen Access
Finding Orientations of Supersingular Elliptic Curves and Quaternion Orders
arXiv (Cornell University)·2023Open Access
New algorithms for the Deuring correspondence Towards practical and secure SQISign signatures
HAL (Le Centre pour la Communication Scientifique Directe)·2023· 3 citedOpen Access
page 1 of 4Next →

Frequent Co-authors

Luca De Feo(9), Antonin Leroux(9), Léo Ducas(6), Pierrick Dartois(5), Andrea Basso(5), Luciano Maino(4), Tako Boris Fouotsa(4), Damien Robert(4), Arjen K. Lenstra(4), Thorsten Kleinjung(4), Lorenz Panny(3), Giacomo Pope(3), Ronald Cramer(3), Péter Kutas(3), Fréderik Vercauteren(3), Dimitar Jetchev(3), Christophe Petit(2), Cécile Pierrot(2), Patrick Longa(2), Sikhar Patranabis(2)