full-disclosure - Re: Polynomials and factoring

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Date: Sun, 29 Apr 2007 11:24:32 -0400
From: Valdis.Kletnieks@...edu
To: r ahead <aheadr@...glemail.com>
Cc: full-disclosure@...ts.grok.org.uk
Subject: Re: Polynomials and factoring

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.

Content of type "application/pgp-signature" skipped

_______________________________________________
Full-Disclosure - We believe in it.
Charter: http://lists.grok.org.uk/full-disclosure-charter.html
Hosted and sponsored by Secunia - http://secunia.com/