Re: Breaking LFSR.

On May 31, 6:49 am, David Eather <eat...@xxxxxxxxxx> wrote:


The reference to primes was intended as an example of the properties of
numbers that don't change regardless of the number system used. It has
nothing to do (specifically) with cryptography. Hence, it is more likely
to provoke new thoughts in that area of number representations.

If you mention a prime like 13...that's in base 10, or is there a
presumption here that you are equating primes to pi status?

Sci.crypt is (almost) entirely about computer cryptography. In this
case, changing representations of numbers is cryptographically
pointless, providing only the illusion of secure complexity, but with no
real substance.

You have a narrow view that forgets computers are the slaves and not
the masters. Using characters makes it much easier to build things,
modules of content which don't always conveniently reduce to bits. One
of the great logical abuses is binary thinking, this or that and
nothing else. Mathematics and philosophers agree.

I don't think sci.crypt is supposed to be about selling watches per se
either.

Theory has every thing to do with cryptography and science has
everything to do with exploring and testing hypotheses. It is up to
you to disprove what you say in insecure and not to unscientifically
define away reality.

Your stop-the-world-I-want-to-get-off mentality gives you the option
of a clear exit if you can' stand open discussion.
.

Relevant Pages

  • Re: [newbie] example primes for blum-blum-shub
    ... library of PRNGs for a language. ... BBS is a cryptographically secure PRNG and library users will expect ... Cryptography: ... Section 8.8 talks extensively about what properties the BBS primes ...
    (sci.crypt)
  • Re: Breaking LFSR.
    ... Everyone else has been very helpful - so far all your posts have been ... (primes are still primes, "E" is still the most common letter, etc). ... many bases is that the elements, representing numbers, are not ... Sci.crypt is entirely about computer cryptography. ...
    (sci.crypt)
  • Re: prime numbers?
    ... When talking about primes in reference to cryptography, ... are used when generating the public and private keys. ... Exclusive dedication to necessitious chores without interludes of ...
    (comp.security.misc)
  • Re: Bug in Sun compiler WS6U2? - Crashes during compile phase with-fast.
    ... >> Now if someone can find a fast way of factoring large prime numbers, ... I know you can't factor primes - by definition. ... course is that if there was found a way of factorising large composite ... it would be the end of cryptography. ...
    (comp.unix.solaris)