Benjamin Wesolowski

mathematics & cryptography
Unsplashed background img 1

Preprints
  1. Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem
    With Dimitar Jetchev
    ArXiv.org 2015 > preprint

Journal and conference papers
  1. Isogeny graphs of ordinary abelian varieties
    With Ernest Hunter Brooks and Dimitar Jetchev
    To appear in Research in Number Theory > preprint
  2. Loop-abort faults on supersingular isogeny cryptosystems
    With Alexandre Gélin
    PQCrypto 2017 > preprint
  3. Short Stickelberger class relations and application to Ideal-SVP
    With Ronald Cramer and Léo Ducas
    Eurocrypt 2017 (honorable mention) > preprint
  4. Trustworthy public randomness with sloth, unicorn, and trx
    With Arjen K. Lenstra
    International Journal of Applied Cryptography (2016) > preprint
  5. Malleability of the blockchain’s entropy
    With Cécile Pierrot
    ArcticCrypt 2016 > preprint
  6. Ciphertext-policy attribute-based broadcast encryption with small keys
    With Pascal Junod
    ICISC 2015 > preprint

Workshops and invited talks
  1. Isogeny graphs of ordinary abelian varieties
    LFANT seminar, Bordeaux, France (May 2017) > slides
  2. Graphes d'isogénies de variétés abéliennes ordinaires
    Journées Codage et Cryptographie, La Bresse, France (April 2017) > slides (french)
  3. Randomness on the blockchain
    RISC seminars, CWI Cryptology Group, Amsterdam, Netherlands (September 2016) > slides
  4. Trust, and public entropy: a unicorn hunt
    NIST Workshop on Random Bit Generation, Gaithersburg, MD, USA (May 2016) > slides
  5. A random zoo: sloth, unicorn and trx
    ALMASTY seminars, Université Pierre et Marie Curie, Paris, France (December 2015) > slides (french)
  6. A random zoo: sloth, unicorn and trx
    Journées Codage et Cryptographie, La Londe-les-Maures, France (October 2015)
  7. A random zoo: sloth, unicorn and trx
    NIST Workshop on Elliptic Curve Cryptography Standards, Gaithersburg, MD, USA (June 2015) > slides
  8. Random self-reducibility of the discrete logarithm problem in genus 2 > slides
    LACAL@RISC Seminar on Cryptologic Algorithms, CWI Amsterdam, Netherlands (February 2015)
Unsplashed background img 2