ترغب بنشر مسار تعليمي؟ اضغط هنا

The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be mo delled in terms of size and root properties. In this paper, we describe some algorithms for selecting polynomials with very good root properties.
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا