Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compression > #1017
| Newsgroups | comp.compression |
|---|---|
| From | stan <smoore@exis.net> |
| Subject | Re: Recursive Modulus and Factoring method |
| References | <ac5dca9e-654e-40f1-8d24-f226fbfeaac9@o4g2000pbc.googlegroups.com> |
| Message-ID | <cmta09-1ka.ln1@invalid.net> (permalink) |
| Organization | TeraNews.com |
| Date | 2012-02-08 14:06 -0500 |
Ernst wrote: > Friday, February 03 2012 > > Hello, my name is Ernst and I am sharing an unexpected observation I > had while designing a Hash code . I see a function that reports > factors of N. <snip factoring> Does this have anything to do with compression? The cryptography guys find this sort of thing fascinating, you might try posting where people who are actually interested in factoring might read it. As several have pointed out, factoring hasn't proved effective in compression and most information guys simply spend much time keeping up with the subject.
Back to comp.compression | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Recursive Modulus and Factoring method Ernst <Ernst_Berg@sbcglobal.net> - 2012-02-03 19:10 -0800
Re: Recursive Modulus and Factoring method stan <smoore@exis.net> - 2012-02-08 14:06 -0500
Re: Recursive Modulus and Factoring method Ernst <Ernst_Berg@sbcglobal.net> - 2012-06-19 11:23 -0700
csiph-web