LEADER 00891nam0-22002891i-450- 001 990008439740403321 005 20061214151558.0 035 $a000843974 035 $aFED01000843974 035 $a(Aleph)000843974FED01 035 $a000843974 100 $a20061214d1925----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $ay-------001yy 200 1 $aRegolamento sugli alunni, gli esami e le tasse negli istituti medi d'istruzione$eapprovato con R. D. 4 maggio 1925, n. 653 ... 210 $aNapoli$cMajolo$d1925 215 $a24 p.$d25 cm 610 0 $aItalia$aIstruzione 710 02$aItalia$0423419 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990008439740403321 952 $aU-03a-004$bIst. 2557$fILFGE 959 $aILFGE 996 $aRegolamento sugli alunni, gli esami e le tasse negli istituti medi d'istruzione$9727645 997 $aUNINA LEADER 02714nam 2200601 450 001 996466661203316 005 20220629112320.0 010 $a3-540-47892-2 024 7 $a10.1007/BFb0091534 035 $a(CKB)1000000000437155 035 $a(SSID)ssj0000322555 035 $a(PQKBManifestationID)12131460 035 $a(PQKBTitleCode)TC0000322555 035 $a(PQKBWorkID)10289027 035 $a(PQKB)11141040 035 $a(DE-He213)978-3-540-47892-8 035 $a(MiAaPQ)EBC5590673 035 $a(Au-PeEL)EBL5590673 035 $a(OCoLC)1066179031 035 $a(MiAaPQ)EBC6742790 035 $a(Au-PeEL)EBL6742790 035 $a(OCoLC)1113569455 035 $a(PPN)155212095 035 $a(EXLCZ)991000000000437155 100 $a20220629d1993 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 04$aThe development of the number field sieve /$fA. K. Lenstra, H. W. Lenstra, Jr., editors 205 $a1st ed. 1993. 210 1$aBerlin ;$aHeidelberg :$cSpringer-Verlag,$d[1993] 210 4$dİ1993 215 $a1 online resource (VIII, 140 p.) 225 1 $aLecture Notes in Mathematics ;$vVolume 1554 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57013-6 327 $aThe number field sieve: An annotated bibliography -- Factoring with cubic integers -- The number field sieve -- The lattice sieve -- Factoring integers with the number field sieve -- Computing a square root for the number field sieve -- A general number field sieve implementation. 330 $aThe number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature. 410 0$aLecture notes in mathematics (Springer-Verlag) ;$vVolume 1554. 606 $aSieves (Mathematics) 615 0$aSieves (Mathematics) 676 $a512.73 702 $aLenstra$b A. K$g(Arjen K.),$f1956- 702 $aLenstra$b H. W.$cJr., 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466661203316 996 $aThe Development of the Number Field Sieve$92860385 997 $aUNISA