Full Disclosure mailing list archives
Re: Time Expiry Alogorithm??
From: Anders Langworthy <hades () psilanthropy org>
Date: Sat, 20 Nov 2004 05:44:37 -0600
Andrew Farmer wrote:
<nitpick>Factoring primes is a solved problem. You probably mean "factoring the product of two large primes".</nitpick>
Oops.Andrew is absolutely correct. I apologize if anybody was confused about the distinction. I should have proofread.
//Anders _______________________________________________ Full-Disclosure - We believe in it. Charter: http://lists.netsys.com/full-disclosure-charter.html
Current thread:
- Time Expiry Alogorithm?? Gautam R. Singh (Nov 18)
- Re: Time Expiry Alogorithm?? Michael Simpson (Nov 19)
- Re: Time Expiry Alogorithm?? Andrew Farmer (Nov 20)
- Re: [Full-Dev-Server] Time Expiry Alogorithm?? Michael Simpson (Nov 19)
- Re: Time Expiry Alogorithm?? Pavel Kankovsky (Nov 19)
- Re: Time Expiry Alogorithm?? Anders Langworthy (Nov 19)
- Re: Time Expiry Alogorithm?? Andrew Farmer (Nov 20)
- Re: Time Expiry Alogorithm?? Anders Langworthy (Nov 20)
- Re: Time Expiry Alogorithm?? Anders Langworthy (Nov 20)
- Re: Time Expiry Alogorithm?? Pavel Kankovsky (Nov 21)
- RE: Time Expiry Alogorithm?? Tiago Halm (Nov 21)
- Re: Time Expiry Alogorithm?? Andrew Farmer (Nov 21)
- Re: Time Expiry Alogorithm?? Anders Langworthy (Nov 19)
- Re: Time Expiry Alogorithm?? Georgi Guninski (Nov 22)
- Re: Time Expiry Alogorithm?? Florian Weimer (Nov 22)
- Re: Time Expiry Alogorithm?? Andrew Farmer (Nov 23)
- Re: Time Expiry Alogorithm?? Florian Weimer (Nov 23)
- Re: Time Expiry Alogorithm?? Andrew Farmer (Nov 23)
- Re: Time Expiry Alogorithm?? Florian Weimer (Nov 29)
- Re: Time Expiry Alogorithm?? Michael Simpson (Nov 19)