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

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

doi:10.1007/978-3-030-34578-5_19

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 proceeding › Conference contribution

55 Downloads (Pure)

Original language	English
Title of host publication	Advances in Cryptology -- ASIACRYPT 2019
Subtitle of host publication	25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings
Publisher	Springer
Pages	521-551
Number of pages	31
ISBN (Electronic)	978-3-030-34578-5
ISBN (Print)	978-3-030-34577-8
DOIs	https://doi.org/10.1007/978-3-030-34578-5_19
Publication status	E-pub ahead of print - 25 Nov 2019

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	11921

Keywords

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

Access to Document

10.1007/978-3-030-34578-5_19

Accepted ManuscriptAccepted author manuscript, 539 KB

Cite this

Kirshanova, E., Mårtensson, E., Postlethwaite, E., & Roy Moulik, S. (2019). Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving. In Advances in Cryptology -- ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings (pp. 521-551). (Lecture Notes in Computer Science; Vol. 11921). Springer. Advance online publication. https://doi.org/10.1007/978-3-030-34578-5_19

Kirshanova, Elena ; Mårtensson, Erik ; Postlethwaite, Eamonn et al. / Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving. Advances in Cryptology -- ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings. Springer, 2019. pp. 521-551 (Lecture Notes in Computer Science).

@inproceedings{192192ade30d42519f001ea6e371fea5,

title = "Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving",

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

author = "Elena Kirshanova and Erik M{\aa}rtensson and Eamonn Postlethwaite and {Roy Moulik}, Subhayan",

year = "2019",

month = nov,

day = "25",

doi = "10.1007/978-3-030-34578-5_19",

language = "English",

isbn = "978-3-030-34577-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "521--551",

booktitle = "Advances in Cryptology -- ASIACRYPT 2019",

}

Kirshanova, E, Mårtensson, E, Postlethwaite, E & Roy Moulik, S 2019, Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving. in Advances in Cryptology -- ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11921, Springer, pp. 521-551. https://doi.org/10.1007/978-3-030-34578-5_19

Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving. / Kirshanova, Elena; Mårtensson, Erik; Postlethwaite, Eamonn et al.
Advances in Cryptology -- ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings. Springer, 2019. p. 521-551 (Lecture Notes in Computer Science; Vol. 11921).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Kirshanova, Elena

AU - Mårtensson, Erik

AU - Postlethwaite, Eamonn

AU - Roy Moulik, Subhayan

PY - 2019/11/25

Y1 - 2019/11/25

KW - approximate k-list problem

KW - cryptanalysis

KW - distributed computation

KW - grover's algorithm

KW - lattice sieving

KW - nearest neighbour algorithms

KW - quantum cryptography

KW - shortest vector problem

KW - svp

U2 - 10.1007/978-3-030-34578-5_19

DO - 10.1007/978-3-030-34578-5_19

M3 - Conference contribution

SN - 978-3-030-34577-8

T3 - Lecture Notes in Computer Science

SP - 521

EP - 551

BT - Advances in Cryptology -- ASIACRYPT 2019

PB - Springer

ER -

Kirshanova E, Mårtensson E, Postlethwaite E, Roy Moulik S. Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving. In Advances in Cryptology -- ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings. Springer. 2019. p. 521-551. (Lecture Notes in Computer Science). Epub 2019 Nov 25. doi: 10.1007/978-3-030-34578-5_19