OSEC

Neohapsis is currently accepting applications for employment. For more information, please visit our website www.neohapsis.com or email hr@neohapsis.com
 
From: Ian Goldberg (iangpaip.net)
Date: Mon May 28 2001 - 17:51:08 CDT

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    In article <167177451224.20010518145344accessdata.com>,
    Mike Stay <staymaccessdata.com> wrote:
    >Here's an idea:
    >
    >We know that for n other than 0,1 when n^2 = n mod m then gcd(n-1,m)=
    >factor of m.
    >
    >n^2-n-km=0
    >
    >n = (sqrt(4km+1) +/- 1)/2 by quadratic equation
    >
    >find k such that 4km+1 is a perfect square
    >
    >That last step doesn't seem as hard as factoring.

    But your very argument shows that it *is* as hard as factoring!

       - Ian