Article View: sci.crypt
Article #496Re: New record non-networked factorization of difficult number
From: Nicol C. So
Date: Fri, 24 Jul 1992 15:09
Date: Fri, 24 Jul 1992 15:09
13 lines
1307 bytes
1307 bytes
In article <26250.Jul2400.28.0492@virtualnews.nyu.edu> brnstnd@nyu.edu (Dan Bernstein) writes: >Arjen Lenstra and I are pleased to announce the record non-networked >factorization of a difficult number (no prime factors under 40 digits). >The number is (2^488 + 1)/257. Its prime factors are p_49 and p_97, >... >This computation can be seen as a substantial step towards a practical >implementation of the general number field sieve (GNFS): it depended on >character columns and a square root inside the algebraic number field >rather than explicit generators of the unit group and of prime ideals of >the field. We are investigating the practical effectiveness of GNFS. Question: is the technique used here generally applicable to all composite numbers or is it applicable to composites of special forms?
Technical Details
Message-ID:
<BrwFFH.CAt@cs.psu.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!ogicse!uwm.edu!psuvax1!fortran.cs.psu.edu!soReferences:
<26250.Jul2400.28.0492@virtualnews.nyu.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!ogicse!uwm.edu!psuvax1!fortran.cs.psu.edu!so From: so@fortran.cs.psu.edu (Nicol C. So) Newsgroups: sci.crypt Subject: Re: New record non-networked factorization of difficult number Message-ID: <BrwFFH.CAt@cs.psu.edu> Date: 24 Jul 92 15:09:17 GMT Article-I.D.: cs.BrwFFH.CAt References: <26250.Jul2400.28.0492@virtualnews.nyu.edu> Sender: news@cs.psu.edu (Usenet) Organization: Penn State Computer Science Lines: 13 Nntp-Posting-Host: fortran.cs.psu.edu