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 22 papers between 2014 and 2023.

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

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

New NTRU Records with Improved Lattice Bases.
IACR Cryptol. ePrint Arch., 2023

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

Asymptotics and Improvements of Sieving for Codes.
IACR Cryptol. ePrint Arch., 2023

2022
Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything.
IACR Cryptol. ePrint Arch., 2022

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

2021
How to Find Ternary LWE Keys Using Locality Sensitive Hashing.
IACR Cryptol. ePrint Arch., 2021

Lower bounds on lattice sieving and information set decoding.
IACR Cryptol. ePrint Arch., 2021

Quantum Key Search for Ternary LWE.
IACR Cryptol. ePrint Arch., 2021

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

2020
On the smoothing parameter and last minimum of random orthogonal lattices.
Des. Codes Cryptogr., 2020

2019
Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving.
IACR Cryptol. ePrint Arch., 2019

The General Sieve Kernel and New Records in Lattice Reduction.
IACR Cryptol. ePrint Arch., 2019

2018
On the asymptotic complexity of solving LWE.
Des. Codes Cryptogr., 2018

Improved Quantum Information Set Decoding.
Proceedings of the Post-Quantum Cryptography - 9th International Conference, 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

Speed-ups and time-memory trade-offs for tuple lattice sieving.
IACR Cryptol. ePrint Arch., 2017

Improved Algorithms for the Approximate k-List Problem in Euclidean Norm.
IACR Cryptol. ePrint Arch., 2017

2016
Parallel Implementation of BDD enumeration for LWE.
IACR Cryptol. ePrint Arch., 2016

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


  Loading...