About

I'm a 50%-time Lecturer at I.Kant Baltic Federal University and acting head of the Lab "Mathematical methods in information security".

My research interests include practical and theoretical cryptanalysis of lattice-based primitives. I also like to apply quantum techniques to speed up cryptanalytic algroithms for solving problems that underlie lattice- and code-based schemes.

I received my PhD from Ruhr University Bochum at the Chair of Cryptology and IT Secturity, advised by Prof. Dr. Alexander May. Then I was a PostDoc at ENS Lyon in AriC team supervised by Prof. Dr. Damien Stehlé.

Programme Committees

ANTS2020 Crypto2020 PQCrypto2020 AsiaCrypt2019

E-mails: elenakirshanova [at] gmail [dot] com

Research

  • An algorithm for computing the Stickelberger ideal of multiquadratic number fields (in RUS)
    Short verion in Prikladnaya Diskretnaya Matematika. Supplement
    Version submitted to Prikladnaya Diskretnaya Matematika.
    Elena Kirshanova, Ekaterina Malygina, Semyon Novoselov, Denis Olefirenko
  • A draft for standartisation proposal of a lattice-based signature scheme (in RUS)
    Elena Kirshanova, Nikita Kolesnikov, Ekaterina Malygina, Semyon Novoselov
  • Lower bounds for nearest neighbor searching and post-quantum cryptanalysis
    Elena Kirshanova, Thjis Laarhoven. In Submission
  • On the smoothing parameter and last minimum of random orthogonal lattices
    Elena Kirshanova, Huyen Nguyen, Damien Stehlé, Alexandre Wallet
    In Designs, Codes and Cryptography
  • Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving
    Elena Kirshanova, Erik Mårtensson, Eamonn W. Postlethwaite, Subhayan Roy Moulik
    In AsiaCrypt'19
  • The General Sieve Kernel and New Records in Lattice Reduction
    [Source Code]
    Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Postlethwaite, Marc Stevens
    In EuroCrypt'19
  • Improved Quantum ISD arXiv PQCrypto version [Maple file for Table1]
    Elena Kirshanova
    PQCrypto'18'
  • Speed-ups and Time–Memory Trade-Offs for Tuple Lattice Sieving
    [Maple file for tables]     Slides
    Gottfried Herold, Elena Kirshanova, Thjis Laarhoven
    In PKC'18
  • Learning With Errors and Extrapolated Dihedral Cosets     Slides
    Zvika Brakerski, Elena Kirshanova, Damien Stehlé, and Weiqiang Wen
    In PKC'18
  • Improved Algorithms for the Approximate k-List Problem in Euclidean norm
    Gottfried Herold, Elena Kirshanova
    In PKC'17
  • On the Asymptotic Complexity of Solving LWE
    Gottfried Herold, Elena Kirshanova, Alexander May
    In Designs, Codes and Cryptography, Jan.'17
  • Parallel implementation of BDD enumeration for LWE [Source Code]
    Elena Kirshanova, Alexander May, Friedrich Wiemer
    In ACNS'16
  • Proxy re-encryption from lattices
    Elena Kirshanova
    In PKC'14

    (!) A bug in the proof is fixed by X.Fan and F.H.Liu

  • Thesis: Complexity of the Learning with Errors Problem and Memory-Efficient Lattice Sieving
    Advisor: Prof. Dr. Alexander May

Talks

Teaching