default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElena Kirshanova
Person information
- affiliation: Technology Innovation Institute, Abu Dhabi, UAE
- affiliation: Immanuel Kant Baltic Federal University, Kaliningrad, Russia
- affiliation: ENS Lyon, Laboratoire LIP, France
- affiliation (PhD 2016): Ruhr University Bochum, Horst Görtz Institute for IT-Security, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c20]Alexander Karenin, Elena Kirshanova, Julian Nowakowski, Eamonn W. Postlethwaite
, Ludo N. Pulles, Fernando Virdia, Paul Vié:
Cool + Cruel = Dual, and New Benchmarks for Sparse LWE. EUROCRYPT (4) 2026: 304-333- 2025
- [j7]Sebastian Bitzer, Jeroen Delvaux, Elena Kirshanova, Sebastian Maaßen, Alexander May, Antonia Wachter-Zeh:
How to lose some weight: a practical template syndrome decoding attack. Des. Codes Cryptogr. 93(7): 2503-2519 (2025) - [j6]Ottó Hanyecz, Alexander Karenin, Elena Kirshanova, Péter Kutas, Sina Schaeffler:
Constant time lattice reduction in dimension 4 with application to SQIsign. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2025(2): 511-534 (2025) - [c19]Alexander Karenin, Elena Kirshanova, Julian Nowakowski, Alexander May:
Fast Slicer for Batch-CVP: Making Lattice Hybrid Attacks Practical. ASIACRYPT (3) 2025: 100-132 - [c18]Shi Bai, Hansraj Jangir, Elena Kirshanova, Tran Ngo, William Youmans:
A Quasi-polynomial Time Algorithm for the Extrapolated Dihedral Coset Problem over Power-of-Two Moduli. CRYPTO (2) 2025: 416-448 - [i25]Ottó Hanyecz, Alexander Karenin, Elena Kirshanova, Péter Kutas, Sina Schaeffler:
Constant time lattice reduction in dimension 4 with application to SQIsign. IACR Cryptol. ePrint Arch. 2025: 27 (2025) - [i24]Alexandr Karenin, Elena Kirshanova, Julian Nowakowski, Eamonn W. Postlethwaite, Fernando Virdia:
Cool + Cruel = Dual. IACR Cryptol. ePrint Arch. 2025: 1002 (2025) - [i23]Shi Bai, Hansraj Jangir, Elena Kirshanova, Tran Ngo, William Youmans:
A Quasi-polynomial Time Algorithm for the Extrapolated Dihedral Coset Problem over Power-of-Two Moduli. IACR Cryptol. ePrint Arch. 2025: 1046 (2025) - [i22]Alexander Karenin, Elena Kirshanova, Alexander May, Julian Nowakowski:
Fast Slicer for Batch-CVP: Making Lattice Hybrid Attacks Practical. IACR Cryptol. ePrint Arch. 2025: 1910 (2025) - 2024
- [j5]Elena Kirshanova, Ekaterina Malygina:
Construction-D lattice from Garcia-Stichtenoth tower code. Des. Codes Cryptogr. 92(5): 1127-1142 (2024) - [c17]Elena Kirshanova, Chiara Marcolla, Sergi Rovira:
Guidance for Efficient Selection of Secure Parameters for Fully Homomorphic Encryption. AFRICACRYPT 2024: 376-400 - [c16]Alexander Karenin, Elena Kirshanova:
Finding Dense Submodules with Algebraic Lattice Reduction. AFRICACRYPT 2024: 403-427 - [c15]Léo Ducas, Andre Esser, Simona Etinski, Elena Kirshanova:
Asymptotics and Improvements of Sieving for Codes. EUROCRYPT (6) 2024: 151-180 - [i21]Sebastian Bitzer, Jeroen Delvaux, Elena Kirshanova, Sebastian Maaßen, Alexander May, Antonia Wachter-Zeh:
How to Lose Some Weight - A Practical Template Syndrome Decoding Attack. IACR Cryptol. ePrint Arch. 2024: 621 (2024) - [i20]Alexander Karenin, Elena Kirshanova:
Finding Dense Submodules with Algebraic Lattice Reduction. IACR Cryptol. ePrint Arch. 2024: 844 (2024) - [i19]Elena Kirshanova, Chiara Marcolla, Sergi Rovira:
Guidance for Efficient Selection of Secure Parameters for Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2024: 1001 (2024) - [i18]Beatrice Biasioli, Elena Kirshanova, Chiara Marcolla, Sergi Rovira:
A Tool for Fast and Secure LWE Parameter Selection: the FHE case. IACR Cryptol. ePrint Arch. 2024: 1895 (2024) - 2023
- [j4]Elena Kirshanova, Alexander May:
Breaking Goppa-based McEliece with hints. Inf. Comput. 293: 105045 (2023) - [j3]Jean-François Biasse, Xavier Bonnetain, Elena Kirshanova, André Schrottenloher, Fang Song:
Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography. IET Inf. Secur. 17(2): 171-209 (2023) - [c14]Elena Kirshanova, Alexander May, Julian Nowakowski:
New NTRU Records with Improved Lattice Bases. PQCrypto 2023: 167-195 - [i17]Elena Kirshanova, Alexander May, Julian Nowakowski:
New NTRU Records with Improved Lattice Bases. IACR Cryptol. ePrint Arch. 2023: 582 (2023) - [i16]Léo Ducas, Andre Esser, Simona Etinski, Elena Kirshanova:
Asymptotics and Improvements of Sieving for Codes. IACR Cryptol. ePrint Arch. 2023: 1577 (2023) - [i15]Elena Kirshanova, Ekaterina Malygina:
Construction-D lattice from Garcia-Stichtenoth tower code. IACR Cryptol. ePrint Arch. 2023: 1730 (2023) - 2022
- [c13]Shweta Agrawal, Elena Kirshanova, Damien Stehlé, Anshu Yadav:
Practical, Round-Optimal Lattice-Based Blind Signatures. CCS 2022: 39-53 - [c12]Elena Kirshanova, Alexander May:
Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything. SCN 2022: 3-20 - [i14]Elena Kirshanova, Alexander May:
Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything. IACR Cryptol. ePrint Arch. 2022: 525 (2022) - 2021
- [c11]Elena Kirshanova, Thijs Laarhoven:
Lower Bounds on Lattice Sieving and Information Set Decoding. CRYPTO (2) 2021: 791-820 - [c10]Elena Kirshanova, Alexander May:
How to Find Ternary LWE Keys Using Locality Sensitive Hashing. IMACC 2021: 247-264 - [c9]Iggy van Hoof, Elena Kirshanova, Alexander May:
Quantum Key Search for Ternary LWE. PQCrypto 2021: 117-132 - [i13]Elena Kirshanova, Thijs Laarhoven:
Lower bounds on lattice sieving and information set decoding. IACR Cryptol. ePrint Arch. 2021: 785 (2021) - [i12]Iggy van Hoof, Elena Kirshanova, Alexander May:
Quantum Key Search for Ternary LWE. IACR Cryptol. ePrint Arch. 2021: 865 (2021) - [i11]Elena Kirshanova, Alexander May:
How to Find Ternary LWE Keys Using Locality Sensitive Hashing. IACR Cryptol. ePrint Arch. 2021: 1255 (2021) - [i10]Shweta Agrawal, Elena Kirshanova, Damien Stehlé, Anshu Yadav:
Can Round-Optimal Lattice-Based Blind Signatures be Practical? IACR Cryptol. ePrint Arch. 2021: 1565 (2021) - 2020
- [j2]Elena Kirshanova, Huyen Nguyen, Damien Stehlé, Alexandre Wallet:
On the smoothing parameter and last minimum of random orthogonal lattices. Des. Codes Cryptogr. 88(5): 931-950 (2020) - [i9]Elena Kirshanova, Huyen Nguyen, Damien Stehlé, Alexandre Wallet:
On the smoothing parameter and last minimum of random orthogonal lattices. IACR Cryptol. ePrint Arch. 2020: 57 (2020)
2010 – 2019
- 2019
- [c8]Elena Kirshanova, Erik Mårtensson, Eamonn W. Postlethwaite, Subhayan Roy Moulik:
Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving. ASIACRYPT (1) 2019: 521-551 - [c7]Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Postlethwaite, Marc Stevens:
The General Sieve Kernel and New Records in Lattice Reduction. EUROCRYPT (2) 2019: 717-746 - [i8]Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Postlethwaite, Marc Stevens:
The General Sieve Kernel and New Records in Lattice Reduction. IACR Cryptol. ePrint Arch. 2019: 89 (2019) - [i7]Elena Kirshanova, Erik Mårtensson, Eamonn W. Postlethwaite, Subhayan Roy Moulik:
Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving. IACR Cryptol. ePrint Arch. 2019: 1016 (2019) - 2018
- [j1]Gottfried Herold, Elena Kirshanova, Alexander May:
On the asymptotic complexity of solving LWE. Des. Codes Cryptogr. 86(1): 55-83 (2018) - [c6]Gottfried Herold, Elena Kirshanova, Thijs Laarhoven:
Speed-Ups and Time-Memory Trade-Offs for Tuple Lattice Sieving. Public Key Cryptography (1) 2018: 407-436 - [c5]Zvika Brakerski, Elena Kirshanova, Damien Stehlé, Weiqiang Wen:
Learning with Errors and Extrapolated Dihedral Cosets. Public Key Cryptography (2) 2018: 702-727 - [c4]Elena Kirshanova:
Improved Quantum Information Set Decoding. PQCrypto 2018: 507-527 - [i6]Elena Kirshanova:
Improved Quantum Information Set Decoding. CoRR abs/1808.00714 (2018) - 2017
- [b1]Elena Kirshanova:
Complexity of the learning with errors problem and memory-efficient lattice sieving. Bochum University, Germany, 2017 - [c3]Gottfried Herold, Elena Kirshanova:
Improved Algorithms for the Approximate k-List Problem in Euclidean Norm. Public Key Cryptography (1) 2017: 16-40 - [i5]Zvika Brakerski, Elena Kirshanova, Damien Stehlé, Weiqiang Wen:
Learning With Errors and Extrapolated Dihedral Cosets. CoRR abs/1710.08223 (2017) - [i4]Gottfried Herold, Elena Kirshanova:
Improved Algorithms for the Approximate k-List Problem in Euclidean Norm. IACR Cryptol. ePrint Arch. 2017: 17 (2017) - [i3]Gottfried Herold, Elena Kirshanova, Thijs Laarhoven:
Speed-ups and time-memory trade-offs for tuple lattice sieving. IACR Cryptol. ePrint Arch. 2017: 1228 (2017) - 2016
- [c2]Elena Kirshanova, Alexander May, Friedrich Wiemer:
Parallel Implementation of BDD Enumeration for LWE. ACNS 2016: 580-591 - [i2]Elena Kirshanova, Alexander May, Friedrich Wiemer:
Parallel Implementation of BDD enumeration for LWE. IACR Cryptol. ePrint Arch. 2016: 380 (2016) - 2015
- [i1]Gottfried Herold, Elena Kirshanova, Alexander May:
On the Asymptotic Complexity of Solving LWE. IACR Cryptol. ePrint Arch. 2015: 1222 (2015) - 2014
- [c1]Elena Kirshanova:
Proxy Re-encryption from Lattices. Public Key Cryptography 2014: 77-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-04 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
