Advances in Cryptology - ASIACRYPT 2003

DOI10.1007/b94617zbMath1205.11134OpenAlexW2899867281MaRDI QIDQ5902388

Jason E. Gower

Publication date: 5 January 2010

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08)

Related Items (3)

On the coefficients of the polynomial in the number field sieve ⋮ On polynomial selection for the general number field sieve ⋮ Root optimization of polynomials in the number field sieve

This page was built for publication: Advances in Cryptology - ASIACRYPT 2003