Algorithmic Number Theory

DOI10.1007/b98210zbMath1125.11348OpenAlexW2791103999WikidataQ29036695 ScholiaQ29036695MaRDI QIDQ5465628

N. A. Howgrave-Graham, Mike Szydlo

Publication date: 12 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98210

zbMATH Keywords

Gentry-Szydlo polynomial time algorithmsubexponential sieve algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Cyclotomic extensions (11R18) Multiplicative and norm form equations (11D57)

Related Items (1)

On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\)

This page was built for publication: Algorithmic Number Theory