Quantum Algorithms for the Subset-Sum Problem

被引：0
|
作者：
Bernstein, Daniel J. [1 ,2 ]
Jeffery, Stacey [3 ]
Lange, Tanja [2 ]
Meurer, Alexander [4 ]
机构：
[1] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
[2] Tech Univ Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[3] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1, Canada
[4] Ruhr Univ Bochum, Horst Gortz Inst IT Secur, Bochum, Germany
来源：
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2013 | 2013年 / 7932卷
关键词：
subset sum; quantum search; quantum walks; radix trees; decoding; SVP; CVP; DISCRETE LOGARITHMS;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper introduces a subset-sum algorithm with heuristic asymptotic cost exponent below 0.25. The new algorithm combines the 2010 Howgrave-Graham-Joux subset-sum algorithm with a new stream-lined data structure for quantum walks on Johnson graphs.
引用
收藏
页码：16 / 33
页数：18
相关论文
共 50 条
  • [21] Solving the subset-sum problem with a light-based device
    Oltean M.
    Muntean O.
    Natural Computing, 2009, 8 (2) : 321 - 331
  • [22] Solving the Subset-Sum problem by P systems with active membranes
    Mario J. Pérez Jiménez
    Agustín Riscos Núñez
    New Generation Computing, 2005, 23 : 339 - 356
  • [23] Solving the subset-sum problem by P systems with active membranes
    Jiménez, MJP
    Núñez, AR
    NEW GENERATION COMPUTING, 2005, 23 (04) : 339 - 356
  • [24] On the expressiveness of subset-sum representations
    Lucian Ilie
    Arto Salomaa
    Acta Informatica, 2000, 36 : 665 - 672
  • [25] An efficient fully polynomial approximation scheme for the Subset-Sum Problem
    Kellerer, H
    Mansini, R
    Pferschy, U
    Speranza, MG
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (02) : 349 - 370
  • [26] A low-space algorithm for the subset-sum problem on GPU
    Curtis, V. V.
    Sanches, C. A. A.
    COMPUTERS & OPERATIONS RESEARCH, 2017, 83 : 120 - 124
  • [27] On the expressiveness of subset-sum representations
    Ilie, L
    Salomaa, A
    ACTA INFORMATICA, 2000, 36 (08) : 665 - 672
  • [28] Molecular solutions for the subset-sum problem on DNA-based supercomputing
    Chang, WL
    Ho, MSH
    Guo, M
    BIOSYSTEMS, 2004, 73 (02) : 117 - 130
  • [29] Subset-Sum Representations of Domination Polynomials
    Kotek, Tomer
    Preen, James
    Tittmann, Peter
    GRAPHS AND COMBINATORICS, 2014, 30 (03) : 647 - 660
  • [30] AN ALMOST LINEAR-TIME ALGORITHM FOR THE DENSE SUBSET-SUM PROBLEM
    GALIL, Z
    MARGALIT, O
    SIAM JOURNAL ON COMPUTING, 1991, 20 (06) : 1157 - 1189
12345