Ethical Hacking Learn to find vulnerabilities before the bad guys do! Gain real world hands on hacking experience in our state of the art hacking lab. Course designed and taught by expert instructors with years of penetration testing experience. 12 student maximum in every class. Certification attempt included in every package. | Computer Forensics Training at InfoSec Institute Gain the in-demand skills of a certified computer examiner, learn to recover trace data left behind by fraud, theft, and cybercrime perpetrators. Discover the source of computer crime and abuse at your organization so that it never happens again. All of our class sizes are guaranteed to be 12 students or less to facilitate one-on-one interaction with one of our expert instructors. |

| Subject: | Re: [Full-disclosure] Polynomials and factoring |
|---|---|
| Date: | Sun, 29 Apr 2007 11:24:32 -0400 |
On Sat, 28 Apr 2007 13:16:28 +0300, r ahead said:
It would be nice if nilpotent elements were efficiently computable - Mod(y,y^k) may find the degree of the lowest monomial, but k is large.
Yes, it would be nice. However, wishing doesn't make it so. http://www.scienceteecher.com/miracle.htm That's where you're sitting right now.
pgplsrIRd3YQz.pgp
Description: PGP signature
_______________________________________________ Full-Disclosure - We believe in it. Charter: http://lists.grok.org.uk/full-disclosure-charter.html Hosted and sponsored by Secunia - http://secunia.com/
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | [Full-disclosure] Subject: Bruce Schneier facts not so Factual?, Core Core |
|---|---|
| Next by Date: | [Full-disclosure] Cryptome is dead (at least for now), Line Noise |
| Previous by Thread: | [Full-disclosure] Polynomials and factoring, r ahead |
| Next by Thread: | [Full-disclosure] Subject: Bruce Schneier facts not so Factual?, Core Core |
| Indexes: | [Date] [Thread] [Top] [All Lists] |