Re: A very fast Fermat factoring algorithm
From: Pubkeybreaker (Robert_silverman_at_raytheon.com)
Date: 03/30/05
- Next message: Tom St Denis: "Re: Disk/Partition level encryption."
- Previous message: jstevh_at_msn.com: "Re: Critiquing surrogate factoring"
- In reply to: quantumgecko: "A very fast Fermat factoring algorithm"
- Next in thread: Pubkeybreaker: "Re: A very fast Fermat factoring algorithm"
- Reply: Pubkeybreaker: "Re: A very fast Fermat factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 30 Mar 2005 04:21:45 -0800
Please explain what you mean by "identical to Fermat" by 10^9 times
faster?
faster how? what is different? explain your method. I am curious.
How was it applied in QS? To split the large primes?
The answer to your final question is no. It has no significance at all.
- Next message: Tom St Denis: "Re: Disk/Partition level encryption."
- Previous message: jstevh_at_msn.com: "Re: Critiquing surrogate factoring"
- In reply to: quantumgecko: "A very fast Fermat factoring algorithm"
- Next in thread: Pubkeybreaker: "Re: A very fast Fermat factoring algorithm"
- Reply: Pubkeybreaker: "Re: A very fast Fermat factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
