Elena Kirshanova

Orcid: 0000-0001-8924-7605

Affiliations:
  • Technology Innovation Institute, Abu Dhabi, UAE
  • Immanuel Kant Baltic Federal University, Kaliningrad, Russia
  • ENS Lyon, Laboratoire LIP, France
  • Ruhr University Bochum, Horst Görtz Institute for IT-Security, Germany (PhD 2016)


According to our database1, Elena Kirshanova authored at least 30 papers between 2014 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Cool + Cruel = Dual.
IACR Cryptol. ePrint Arch., 2025

Fast Slicer for Batch-CVP: Making Lattice Hybrid Attacks Practical.
IACR Cryptol. ePrint Arch., 2025

Constant time lattice reduction in dimension 4 with application to SQIsign.
IACR Cryptol. ePrint Arch., 2025

A Quasi-polynomial Time Algorithm for the Extrapolated Dihedral Coset Problem over Power-of-Two Moduli.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
How to Lose Some Weight - A Practical Template Syndrome Decoding Attack.
IACR Cryptol. ePrint Arch., 2024

A Tool for Fast and Secure LWE Parameter Selection: the FHE case.
IACR Cryptol. ePrint Arch., 2024

Asymptotics and Improvements of Sieving for Codes.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Guidance for Efficient Selection of Secure Parameters for Fully Homomorphic Encryption.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2024, 2024

Finding Dense Submodules with Algebraic Lattice Reduction.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2024, 2024

2023
Breaking Goppa-based McEliece with hints.
Inf. Comput., August, 2023

Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography.
IET Inf. Secur., March, 2023

Construction-D lattice from Garcia-Stichtenoth tower code.
IACR Cryptol. ePrint Arch., 2023

New NTRU Records with Improved Lattice Bases.
Proceedings of the Post-Quantum Cryptography - 14th International Workshop, 2023

2022
Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Practical, Round-Optimal Lattice-Based Blind Signatures.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Can Round-Optimal Lattice-Based Blind Signatures be Practical?
IACR Cryptol. ePrint Arch., 2021

Quantum Key Search for Ternary LWE.
Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

How to Find Ternary LWE Keys Using Locality Sensitive Hashing.
Proceedings of the Cryptography and Coding - 18th IMA International Conference, 2021

Lower Bounds on Lattice Sieving and Information Set Decoding.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
On the smoothing parameter and last minimum of random orthogonal lattices.
IACR Cryptol. ePrint Arch., 2020

2019
The General Sieve Kernel and New Records in Lattice Reduction.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Improved Quantum Information Set Decoding.
Proceedings of the Post-Quantum Cryptography - 9th International Conference, 2018

Speed-Ups and Time-Memory Trade-Offs for Tuple Lattice Sieving.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Learning with Errors and Extrapolated Dihedral Cosets.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2017
Complexity of the learning with errors problem and memory-efficient lattice sieving
PhD thesis, 2017

Improved Algorithms for the Approximate k-List Problem in Euclidean Norm.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

2016
Parallel Implementation of BDD Enumeration for LWE.
Proceedings of the Applied Cryptography and Network Security, 2016

2015
On the Asymptotic Complexity of Solving LWE.
IACR Cryptol. ePrint Arch., 2015

2014
Proxy Re-encryption from Lattices.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014


  Loading...