Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

MOC
2016

favoriteEmaildiscussreport

72views Information Technology» more MOC 2016»

Better polynomials for GNFS

8 years 1 months ago

Better polynomials for GNFS

Download maths-people.anu.edu.au

Abstract. The general number ﬁeld sieve (GNFS) is the most eﬃcient algorithm known for factoring large integers. It consists of several stages, the ﬁrst one being polynomial selection. The quality of the selected polynomials can be modelled in terms of size and root properties. We propose a new kind of polynomials for GNFS: with a new degree of freedom, we further improve the size property. We demonstrate the eﬃciency of our algorithm by exhibiting a better polynomial than the one used for the factorization of RSA-768, and a polynomial for RSA-1024 that outperforms the best published one.

Shi Bai, Cyril Bouvier, Alexander Kruppa, Paul Zim

Real-time Traffic

Information Technology | MOC 2016 |

claim paper

Related Content

» Parameter choices and a better bound on the list size in the GuruswamiSudan algorithm for ...

» Better approximations for max TSP

» A Better Alternative to Piecewise Linear Time Series Segmentation

» Better Synchronous Binarization for Machine Translation

» Toward better wireload models in the presence of obstacles

» Better Polynomial Algorithms on Graphs of Bounded RankWidth

» Fast Message Authentication Using Efficient Polynomial Evaluation

» Automatic generation of polynomialbased hardware architectures for function evaluation

» A Better Algorithm for Random kSAT

» When eth Roots Become Easier Than Factoring

Post Info
More Details (n/a)

Added	08 Apr 2016
Updated	08 Apr 2016
Type	Journal
Year	2016
Where	MOC
Authors	Shi Bai, Cyril Bouvier, Alexander Kruppa, Paul Zimmermann

Comments (0)