Quantum algorithms for the subset-sum problem

D.J. Bernstein; S. Jeffery; T. Lange; A. Meurer

Quantum algorithms for the subset-sum problem

D.J. Bernstein
, S. Jeffery
, T. Lange
, A. Meurer

Onderzoeksoutput: Boek/rapport › Rapport › Academic

1 Downloads (Pure)

Samenvatting

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 streamlined data structure for quantum walks on Johnson graphs.

Originele taal-2	Engels
Uitgeverij	International Association for Cryptologic Research
Aantal pagina's	18
Status	Gepubliceerd - 2013

Publicatie series

Naam	Cryptology ePrint Archive
Volume	2013/199

Toegang tot document

http://eprint.iacr.org/2013/199

Citeer dit

@book{23dee8beb9574060bd804e7c205e9e68,

title = "Quantum algorithms for the subset-sum problem",

abstract = "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 streamlined data structure for quantum walks on Johnson graphs.",

author = "D.J. Bernstein and S. Jeffery and T. Lange and A. Meurer",

year = "2013",

language = "English",

series = "Cryptology ePrint Archive",

publisher = "International Association for Cryptologic Research",

}

TY - BOOK

T1 - Quantum algorithms for the subset-sum problem

AU - Bernstein, D.J.

AU - Jeffery, S.

AU - Lange, T.

AU - Meurer, A.

PY - 2013

Y1 - 2013

N2 - 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 streamlined data structure for quantum walks on Johnson graphs.

AB - 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 streamlined data structure for quantum walks on Johnson graphs.

M3 - Report

T3 - Cryptology ePrint Archive

BT - Quantum algorithms for the subset-sum problem

PB - International Association for Cryptologic Research

ER -

Quantum algorithms for the subset-sum problem

Samenvatting

Publicatie series

Toegang tot document

Vingerafdruk

Citeer dit