I am currently doing a PhD at IRIF, Université de Paris under the supervision of Frédéric Magniez. Previously I studied at École polytechnique, at Télécom ParisTech and at Parisian Master of Research in Computer Science (MPRI).
You can download my CV here.
I mainly study quantum algorithms in the context of cryptanalysis. I am particularly interested in problems related to lattice-based cryptography.
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), to appear.
[arXiv]
Fast Classical and Quantum Algorithms for Online k-server Problem on Trees
Ruslan Kapralov, Kamil Khadiev, Joshua Mokut, Yixin Shen, Maxim Yagafarov
Preprint (2020).
[arXiv]
Improved Classical and Quantum Algorithms for Subset-Sum
Xavier Bonnetain, Rémi Bricout, André Schrottenloher, Yixin Shen
Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security
[PDF] [arXiv]
Quantum Query Complexity of Dyck Languages with Bounded Height
Kamil Khadiev, Yixin Shen
Preprint (2019).
[arXiv]
Merged with Quantum Lower Bounds for 2D-Grid and Dyck Language
Andris Ambainis, Kaspars Balodis, Jānis Iraids, Krišjānis Prūsis, Juris Smotrovs
[arXiv]
Merged version: Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
[PDF]
45th International Symposium on
Mathematical Foundations of Computer Science (MFCS 2020)
Quantum lattice enumeration and tweaking discrete pruning
Yoshinori Aono, Phong Nguyen, Yixin Shen
Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security
[PDF] [eprint]
I have been a subreviewer for: TQC 2019, ANTS 2020, SODA 2021.