Parallel Spooky Pebbling Makes Regev Factoring More Practical

Lecture notes in computer science 2026 Open access

Read full text
Authors: Gregory D. Kahanamoku–Meyer, Seyoon Ragavan, Katherine Van Kirk
DOI: 10.1007/978-3-032-25291-3_14
Cited by: 1
References: 45

Fields of Study & Subjects

Quantum Computing Algorithms and Architecture Complexity and Algorithms in Graphs Cryptography and Data Security

Publication details

Journal / source
Lecture notes in computer science
Publisher
Springer Nature Switzerland
Pages
402–430
Publication date
1 January 2026
Language
EN