![]() |
Lattice Sieving - where do I start?
My python NFS implementation is now up and working, and mostly cleaned. I currently use line sieving, now I want to take it up a notch with lattice sieving. But where do I start? Is there an explicit example (like Briggs') I can work with?
The papers about lattice sieving are not accessible to me as I do not have a good understanding of lattices. There seems to be two definitions of lattices in wikipedia: [url]http://en.wikipedia.org/wiki/Lattice_(group[/url]) and [url]http://en.wikipedia.org/wiki/Lattice_(order[/url]). Which one is applicable? Also, please recommend books regarding lattices relevant to NFS. I've gotten this far, lattices should be doable, eventually. |
'The Development of the Number Field Sieve' contains a paper that gives a few details of lattice sieving, but it's not enough to implement the algorithm. I think you're going to have to look at existing code to get all the details you need.
|
How was the existing code written? By the same people who created the algorithm?
|
There is the paper by Franke and Kleinjung: "[URL="http://www.hyperelliptic.org/tanja/SHARCS/talks/FrankeKleinjung.pdf"]Continued Fractions and Lattice Sieving[/URL]". Probably also not enough detail to complete an implementation but it is the best (only?) reference out there for their algorithm that I know of, aside from their code.
|
| All times are UTC. The time now is 00:17. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.