Lattice sieving
id:
lattice-sieving-271-3265045
title:
Lattice sieving
text:
Lattice sieving is a technique for finding smooth values of a bivariate polynomial f over a large region. It is almost exclusively used in conjunction with the number field sieve. The original idea of the lattice sieve came from John Pollard. The algorithm implicitly involves the ideal structure of the number field of the polynomial; it takes advantage of the theoremWhich one? that any prime ideal above some rational prime p can be written as p Z [ α ] + Z [ α ] . One then picks many prime numbe
brand slug:
wiki
category slug:
encyclopedia
description:
Integer factorization algorithm
original url:
https://en.wikipedia.org/wiki/Lattice_sieving
date created:
date modified:
2023-10-24T20:24:03Z
main entity:
{"identifier":"Q17079625","url":"https://www.wikidata.org/entity/Q17079625"}
image:
fields total:
13
integrity:
14