| The general sieve kernel and new records in lattice reduction MR Albrecht, L Ducas, G Herold, E Kirshanova, EW Postlethwaite, ... Annual International Conference on the Theory and Applications of …, 2019 | 193 | 2019 |
| Proxy re-encryption from lattices E Kirshanova Public-Key Cryptography–PKC 2014: 17th International Conference on Practice …, 2014 | 121 | 2014 |
| Improved Algorithms for the Approximate k-List Problem in Euclidean Norm G Herold, E Kirshanova IACR International Workshop on Public Key Cryptography, 16-40, 2017 | 67 | 2017 |
| On the asymptotic complexity of solving LWE G Herold, E Kirshanova, A May Designs, Codes and Cryptography 86 (1), 55-83, 2018 | 56 | 2018 |
| Speed-ups and time–memory trade-offs for tuple lattice sieving G Herold, E Kirshanova, T Laarhoven Public-Key Cryptography–PKC 2018: 21st IACR International Conference on …, 2018 | 51 | 2018 |
| Improved quantum information set decoding E Kirshanova International Conference on Post-Quantum Cryptography, 507-527, 2018 | 36 | 2018 |
| Practical, round-optimal lattice-based blind signatures S Agrawal, E Kirshanova, D Stehlé, A Yadav Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022 | 31 | 2022 |
| Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving E Kirshanova, E Mårtensson, EW Postlethwaite, SR Moulik International Conference on the Theory and Application of Cryptology and …, 2019 | 27 | 2019 |
| Parallel implementation of BDD enumeration for LWE E Kirshanova, A May, F Wiemer International Conference on Applied Cryptography and Network Security, 580-591, 2016 | 18 | 2016 |
| Learning with errors and extrapolated dihedral cosets Z Brakerski, E Kirshanova, D Stehlé, W Wen IACR international workshop on public key cryptography, 702-727, 2018 | 17 | 2018 |
| Can round-optimal lattice-based blind signatures be practical? S Agrawal, E Kirshanova, D Stehle, A Yadav IACR Cryptol. ePrint Arch. 2021, 1565, 2021 | 14 | 2021 |
| Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography JF Biasse, X Bonnetain, E Kirshanova, A Schrottenloher, F Song IET Information Security 17 (2), 171-209, 2023 | 13 | 2023 |
| Asymptotics and improvements of sieving for codes L Ducas, A Esser, S Etinski, E Kirshanova Annual International Conference on the Theory and Applications of …, 2024 | 10 | 2024 |
| Quantum key search for ternary LWE I van Hoof, E Kirshanova, A May International Conference on Post-Quantum Cryptography, 117-132, 2021 | 9 | 2021 |
| Lower bounds on lattice sieving and information set decoding E Kirshanova, T Laarhoven Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 9 | 2021 |
| Decoding McEliece with a Hint–Secret Goppa Key Parts Reveal Everything E Kirshanova, A May International Conference on Security and Cryptography for Networks, 3-20, 2022 | 8 | 2022 |
| On the smoothing parameter and last minimum of random orthogonal lattices E Kirshanova, H Nguyen, D Stehlé, A Wallet Designs, Codes and Cryptography 88 (5), 931-950, 2020 | 7 | 2020 |
| How to find ternary LWE keys using locality sensitive hashing E Kirshanova, A May Cryptography and Coding: 18th IMA International Conference, IMACC 2021 …, 2021 | 6 | 2021 |
| New NTRU Records with Improved Lattice Bases E Kirshanova, A May, J Nowakowski International Conference on Post-Quantum Cryptography, 167-195, 2023 | 2 | 2023 |
| Breaking Goppa-based McEliece with hints E Kirshanova, A May Information and Computation 293, 105045, 2023 | 2 | 2023 |
