Re: Critiquing surrogate factoring
From: Pubkeybreaker (Robert_silverman_at_raytheon.com)
Date: 03/30/05
- Next message: quantumgecko: "Re: A very fast Fermat factoring algorithm"
- Previous message: deneb: "c2 block cipher as used in cppm"
- In reply to: David Kastrup: "Re: Critiquing surrogate factoring"
- Next in thread: Paul Leyland: "Re: Critiquing surrogate factoring"
- Reply: Paul Leyland: "Re: Critiquing surrogate factoring"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 30 Mar 2005 08:26:20 -0800
Actually, No.
Fermat's method factors N directly by representing it exactly as the
difference of two squares. N = x^2 - y^2.
- Next message: quantumgecko: "Re: A very fast Fermat factoring algorithm"
- Previous message: deneb: "c2 block cipher as used in cppm"
- In reply to: David Kastrup: "Re: Critiquing surrogate factoring"
- Next in thread: Paul Leyland: "Re: Critiquing surrogate factoring"
- Reply: Paul Leyland: "Re: Critiquing surrogate factoring"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
