About
I received my PhD from Ruhr University Bochum at the Chair of Cryptology and IT Security, advised by Alexander May. I was then a postdoc at ENS Lyon in the AriC team, working with Damien Stehlé.
Email: elenakirshanova [at] gmail [dot] com
Recent
- Invited talk at AfricaCrypt 2026, PQCrypto 2026.
Publications
- A Tool for Fast and Secure LWE Parameter Selection: the FHE case JoC (to appear)
- Cool + Cruel = Dual, and New Benchmarks for Sparse LWE EuroCrypt 2026
- Fast Slicer for Batch-CVP: Making Lattice Hybrid Attacks Practical AsiaCrypt 2025
- A quasi-polynomial time algorithm for the extrapolated dihedral coset problem over power-of-two moduli Crypto 2025 [slides]
- How to lose some weight: a practical template syndrome decoding attack Designs, Codes and Cryptography
- Constant time lattice reduction in dimension 4 with application to SQIsign CHES 2024
- Guidance for efficient selection of secure parameters for fully homomorphic encryption AfricaCrypt 2024
- Finding dense submodules with algebraic lattice reduction AfricaCrypt 2024
- Asymptotics and Improvements of Sieving for Codes EuroCrypt 2024
- Construction-D lattice from Garcia-Stichtenoth tower code Designs, Codes and Cryptography [journal] [slides]
- New NTRU Records with Improved Lattice Bases PQCrypto 2023
- Practical, Round-Optimal Lattice-Based Blind Signatures ACM CCS 2022
- Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography IET Information Security
- Decoding McEliece with a Hint: Secret Goppa Key Parts Reveal Everything SCN 2022 [code] [slides] Extended version: Breaking Goppa-Based McEliece with Hints, Information and Computation, vol. 293, 2023.
- How to Find Ternary LWE Keys Using Locality Sensitive Hashing IMACC 2021 [slides]
- Quantum Key Search for Ternary LWE PQCrypto 2021
- Lower bounds for nearest neighbor searching and post-quantum cryptanalysis Crypto 2021
- An algorithm for computing the Stickelberger ideal of multiquadratic number fields (in Russian) Prikladnaya Diskretnaya Matematika [short version, supplement] [journal submission]
- On the smoothing parameter and last minimum of random orthogonal lattices Designs, Codes and Cryptography
- Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving AsiaCrypt 2019
- The General Sieve Kernel and New Records in Lattice Reduction EuroCrypt 2019 [code] [slides]
- Improved Quantum Information Set Decoding PQCrypto 2018 [arXiv]
- Speed-ups and Time–Memory Trade-Offs for Tuple Lattice Sieving PKC 2018 [slides]
- Learning With Errors and Extrapolated Dihedral Cosets PKC 2018 [slides]
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm PKC 2017
- On the Asymptotic Complexity of Solving LWE Designs, Codes and Cryptography, 2017
- Parallel implementation of BDD enumeration for LWE ACNS 2016 [code]
- Proxy re-encryption from lattices PKC 2014 A bug in the proof was fixed by X. Fan and F.-H. Liu: eprint 2017/456.
- Complexity of the Learning with Errors Problem and Memory-Efficient Lattice Sieving Ruhr University Bochum
Talks
- One-more (I)SIS Workshop Novel Lattice Assumptions. Edinburgh 2026
- Near Neighbour techniques in cryptanalysis Invited talk, AfricaCrypt 2026
- Advances and Open Challenges in Quantum Algorithms for Lattice Problems Invited talk, PQCrypto 2026
- Lattice algorithms for sparse secret LWE ACCESS seminar
- A quasi-polynomial time quantum algorithm for the extrapolated dihedral coset problem Inria Paris seminar
- Cool + Cruel = Dual CHARM workshop on algebraic lattices in cryptography, 2025
- Lattices & Codes: Algorithmic Connections and New Constructions MWCC 2024
- Construction-D lattice from Garcia-Stichtenoth tower code AGC²T 2023
- Decoding McEliece with a Hint ACCESS seminar
- How to Find Ternary LWE Keys Using Locality Sensitive Hashing IMACC 2021
- Sidelnikov–Shestakov attack on Reed–Solomon codes in McEliece RUB seminar
- Goppa codes in Classic McEliece RUB seminar
- The Short Integer Solution Problem MPI quantum reading group
- Lower bounds on lattice sieving and information set decoding 3rd NIST PQC Standardization Conference
- Lattice-based crypto: constructions and cryptanalysis (in Russian) Seminar "Mathematical methods of cryptographic analysis", MSU
- Open questions in lattice-based cryptanalysis Workshop on the Mathematics of Post-Quantum Crypto, ANTS 2020
- Quantum speed-ups for sieving algorithms for the shortest vector problem TQC 2020 [video]
- Lattice- and code-based cryptographic constructions (in Russian) Seminar "Industrial mathematics", St Petersburg State University
- Sieving in practice: The General Sieve Kernel (G6K) Simons Institute [video]
- Quantum Cryptanalysis of Post-Quantum Cryptography Simons Institute [video]
- A k-List Algorithm for LWE Simons Institute [video]
- On Crypto (in Russian) Women in IT meetup, Kaliningrad [Keynote]
- Quantum time-memory trade-offs for lattice sieving Quantum Cryptanalysis, Dagstuhl
- Введение в криптоанализ систем на евклидовых решётках SibeCrypt 2019, Tomsk
- Introduction to lattice-based cryptography Quantum Cryptanalysis of PKE, AIM, San Jose
Teaching
PhD supervision
- Alexander Karenin 2023–2026, TII and Ruhr University Bochum. Defended July 2026.
Lecturer
- Post-Quantum Cryptography Summer School AfricaCrypt 2026
- CIMPA Summer School Université Mohammed V de Rabat, 2023
- Lattice-based cryptography 2021, 2022, 2023, 2024 I. Kant Baltic Federal University
- Introduction to cryptography 2020, 2021, 2022, 2023 I. Kant Baltic Federal University
- Coding theory 2019, 2020, 2021, 2022, 2023 I. Kant Baltic Federal University
- Scientific tools, short summer course 2020 (Git, LaTeX, Sage), 2021, 2024 I. Kant Baltic Federal University, with Semyon Novoselov (2020, 2021)
- Algorithms for elliptic curve cryptography I. Kant Baltic Federal University, 2019
- Cryptanalysis ENS de Lyon, 2018, with Guillaume Hanrot
- Introduction to Cybersecurity Online course, Stepik
Teaching assistant
- Computer Algebra ENS de Lyon, 2019 (Guillaume Hanrot, Stéphan Thomassé)
- Computer Algebra ENS de Lyon, 2018 (Guillaume Hanrot)
- Probability for Computer Science ENS de Lyon, 2017 (Omar Fawzi)
- Cryptanalysis I, II Ruhr University Bochum, 2015–2016 (Alexander May)
- Quantum Algorithms Ruhr University Bochum, 2014 (Alexander May)
Service
Editorial board
I serve on the editorial board of Designs, Codes and Cryptography.