Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!gegeweb.org!news.glorb.com!npeer02.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!post01.iad.highwinds-media.com!newsfe02.iad.POSTED!aa923de6!not-for-mail
Newsgroups: comp.compression
From: stan <smoore@exis.net>
Subject: Re: Modulus, Factoring and Compressing random data
References: <e468319d-5350-4448-8238-be64c676ae68@n7g2000pbd.googlegroups.com> <21290873.828.1327573218668.JavaMail.geo-discussion-forums@prdv33> <9505b21a-5fe4-4bae-8f9c-4b92b54bfc69@f11g2000yql.googlegroups.com> <20086931.544.1327632761300.JavaMail.geo-discussion-forums@prlv30> <jftn2b$acu$1@news.belwue.de> <25445276.18.1327695177390.JavaMail.geo-discussion-forums@prez15> <16309604.72.1327709609752.JavaMail.geo-discussion-forums@prmu37> <jg0i9g$a77$1@news.belwue.de> <1309622.345.1327787969010.JavaMail.geo-discussion-forums@prdh15> <jg5lje$4uj$1@news.belwue.de> <b4c6fd01-439b-4e71-bca6-374f5be368d0@pk8g2000pbb.googlegroups.com> <vjmjv8-138.ln1@invalid.net> <ef0ac939-2719-4e6f-925e-efa8c7c57dbf@ov1g2000pbb.googlegroups.com> <bq5lv8-ada.ln1@invalid.net> <fc603caa-8890-401c-9890-7bf5f36ca846@x19g2000yqh.googlegroups.com> <jgdngj$m65$1@dont-email.me> <9bee30a4-0fbd-4027-8877-8a89e3e57029@kg1g2000pbb.googlegroups.com>
User-Agent: slrn/0.9.8.1pl1 (Linux)
Message-ID: <dtra09-1ka.ln1@invalid.net>
Lines: 10
X-Complaints-To: abuse@teranews.com
NNTP-Posting-Date: Wed, 08 Feb 2012 18:40:04 UTC
Organization: TeraNews.com
Date: Wed, 8 Feb 2012 13:35:57 -0500
Xref: x330-a1.tempe.blueboxinc.net comp.compression:1016

Ernst wrote:
>
> James there is a time problem for non-quantum methods.  This Recursive
> Modulus is no better than others because of that however, it is a
> simple thing to set the M of M mod N to the factor plus a little more
> and watch as it ticks off with the iteration of M = M-1 and then
> "finds" the factor.  

Actually the existence of better methods (less resources) makes
recursive modulus worse.