Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving

Elena Kirshanova, Erik Mårtensson, Eamonn Postlethwaite, Subhayan Roy Moulik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

50 Downloads (Pure)
Original languageEnglish
Title of host publicationAdvances in Cryptology -- ASIACRYPT 2019
Subtitle of host publication25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings
PublisherSpringer
Pages521-551
Number of pages31
ISBN (Electronic)978-3-030-34578-5
ISBN (Print)978-3-030-34577-8
DOIs
Publication statusE-pub ahead of print - 25 Nov 2019

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11921

Keywords

  • approximate k-list problem
  • cryptanalysis
  • distributed computation
  • grover's algorithm
  • lattice sieving
  • nearest neighbour algorithms
  • quantum cryptography
  • shortest vector problem
  • svp

Cite this