Benjamin Wesolowski

mathematics & cryptography
Unsplashed background img 1

Preprints
  1. Lower bounds for the depth of modular squaring
    With Ryan Williams
    Cryptology ePrint Archive 2020 > preprint
  2. Computation of a 30750-Bit Binary Field Discrete Logarithm
    With Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra and Jens Zumbrägel
    arXiv.org 2020 > preprint
  3. Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
    With Thorsten Kleinjung
    Cryptology ePrint Archive 2019 > preprint

Journal and conference papers
  1. Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time
    With Ronald Cramer and Léo Ducas
    Journal of the ACM, Volume 68, Issue 2 (2021) > preprint
  2. SQISign: compact post-quantum signatures from quaternions and isogenies
    With Luca De Feo, David Kohel, Antonin Leroux and Christophe Petit
    Asiacrypt 2020 > preprint
    Best paper award
  3. Efficient Verifiable Delay Functions
    Journal of Cryptology 2020 > paper
  4. Random self-reducibility of Ideal-SVP via Arakelov random walks
    With Koen de Boer, Léo Ducas and Alice Pellet-Mary
    Crypto 2020 > preprint
  5. On the shortness of vectors to be found by the Ideal-SVP quantum algorithm
    With Léo Ducas and Maxime Plançon
    Crypto 2019 > preprint
  6. Efficient verifiable delay functions
    Eurocrypt 2019 > preprint
    Best young researcher award
  7. Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem
    With Dimitar Jetchev
    Acta Arithmetica 187 (2019) > preprint
  8. A new perspective on the powers of two descent for discrete logarithms in finite fields
    With Thorsten Kleinjung
    ANTS-XIII, Thirteenth Algorithmic Number Theory Symposium (2018) > preprint
  9. Generating subgroups of ray class groups with small prime ideals
    ANTS-XIII, Thirteenth Algorithmic Number Theory Symposium (2018) > preprint
  10. Isogeny graphs of ordinary abelian varieties
    With Ernest Hunter Brooks and Dimitar Jetchev
    Research in Number Theory 3 (2017) > open access
  11. Loop-abort faults on supersingular isogeny cryptosystems
    With Alexandre Gélin
    PQCrypto 2017 > preprint
  12. Short Stickelberger class relations and application to Ideal-SVP
    With Ronald Cramer and Léo Ducas
    Eurocrypt 2017 > preprint
    Top 3 for the best paper award
  13. Trustworthy public randomness with sloth, unicorn, and trx
    With Arjen K. Lenstra
    International Journal of Applied Cryptography (2016) > preprint
  14. Malleability of the blockchain’s entropy
    With Cécile Pierrot
    ArcticCrypt 2016 > preprint
  15. Ciphertext-policy attribute-based broadcast encryption with small keys
    With Pascal Junod
    ICISC 2015 > preprint

PhD Thesis

Arithmetic and geometric structures in cryptography > manuscript
Presented on 30 November 2018 at École Polytechnique Fédérale de Lausanne, Switzerland
Supervised by Prof. Arjen K. Lenstra and Dr. Robert Granger

Workshops and invited talks
  1. Verifiable delay functions
    Blockchain Seminar, Monash Blockchain Technology Centre (September 2020) > slides
  2. New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks
    Lattices: Geometry, Algorithms and Hardness, Simons Institute, Berkeley, USA (February 2020) > video
  3. Discrete logarithms in quasi-polynomial time in finite fields of small characteristic
    Séminaire de Théorie des Nombres, Université de Bordeaux, France (February 2020) > slides
  4. Verifiable delay functions
    Conférence de lancement de l'ANR Ciao, Université de Bordeaux, France (February 2020) > slides
  5. Discrete logarithms in quasi-polynomial time in finite fields of small characteristic
    ECC 2019, 23rd Workshop on Elliptic Curve Cryptography, Bochum, Germany (December 2019) > slides
  6. Discrete logarithms in quasi-polynomial time in finite fields of small characteristic
    Diamant symposium, Utrecht, The Netherlands (November 2019) > slides
  7. Discrete logarithms in quasi-polynomial time in finite fields of small characteristic
    Applied Crypto Group Seminar, Université du Luxembourg (November 2019) > slides
  8. Discrete logarithms in quasi-polynomial time in finite fields of small characteristic
    Protocol Labs Journal Club (October 2019) > slides
  9. Discrete logarithms in quasi-polynomial time in finite fields of small characteristic
    AriC Seminar, ENS Lyon, France (October 2019) > slides
  10. Verifiable delay functions
    Ei/Ψ Crypto Working Group, Utrecht, The Netherlands (September 2019) > slides
  11. Horizontal isogeny graphs: analytic methods and mixing properties
    SIAM conference on applied algebraic geometry, Bern, Switzerland (July 2019)
  12. Quantum algorithms for finding short vectors in ideal lattices
    2nd QSC General Assembly, Amsterdam, The Netherlands (June 2019) > slides
  13. The discrete logarithm problem in finite fields of small characteristic
    Algebra, geometry and number theory seminar, Leiden University, The Netherlands (April 2019) > slides
  14. The discrete logarithm problem in finite fields of small characteristic
    Mathematical foundations of asymmetric cryptography, winter school, Aussois, France (March 2019) > slides
  15. A hybrid verifiable delay function
    Blockchain Research workshop at Stanford, CA, USA (February 2019)
  16. Isogeny graphs of ordinary abelian varieties
    Séminaires de l'Institut Fourier, Grenoble, France (December 2018)
  17. Horizontal isogeny graphs
    AriC's Lattice and Crypto Session, ENS Lyon, France (December 2018)
  18. An efficient verifiable delay function
    Ethereum Foundation and Stanford Center for Blockchain Research workshop at Stanford, CA, USA (August 2018)
  19. Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem
    Séminaire de Cryptographie, Rennes, France (February 2018) > slides
  20. Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time
    CARAMBA seminar, Nancy, France (January 2018) > slides
  21. Isogeny graphs of ordinary abelian varieties
    ECC 2017, 21st Workshop on Elliptic Curve Cryptography, Nijmegen, The Netherlands (November 2017) > slides
    Best presentation award
  22. Isogeny graphs of ordinary abelian varieties
    LFANT seminar, Bordeaux, France (May 2017) > slides
  23. Graphes d'isogénies de variétés abéliennes ordinaires
    Journées Codage et Cryptographie, La Bresse, France (April 2017) > slides (french)
  24. Randomness on the blockchain
    RISC seminars, CWI Cryptology Group, Amsterdam, The Netherlands (September 2016) > slides
  25. Trust, and public entropy: a unicorn hunt
    NIST Workshop on Random Bit Generation, Gaithersburg, MD, USA (May 2016) > slides
  26. A random zoo: sloth, unicorn and trx
    ALMASTY seminars, Université Pierre et Marie Curie, Paris, France (December 2015) > slides (french)
  27. A random zoo: sloth, unicorn and trx
    Journées Codage et Cryptographie, La Londe-les-Maures, France (October 2015)
  28. A random zoo: sloth, unicorn and trx
    NIST Workshop on Elliptic Curve Cryptography Standards, Gaithersburg, MD, USA (June 2015) > slides
  29. Random self-reducibility of the discrete logarithm problem in genus 2 > slides
    LACAL@RISC Seminar on Cryptologic Algorithms, CWI Amsterdam, The Netherlands (February 2015)
Unsplashed background img 2