Re: encryption with pi

From: Bob Silverman (pubkeybreaker_at_aol.comstuff)
Date: 07/30/04 

Date: 30 Jul 2004 21:30:49 GMT

Sigh.

I get tired of this. I am competent to judge.

The proposed cipher is easily broken. Computing the
n'th digit of Pi can be done in constant time (without
computing prior values) by an algorithm of
Simon Plouffe. The algorithm is quite fast.
 
Even if it were not constant time, generating 100
million digits of Pi is TRIVIAL.

I suggest searching the literature next time before
shooting your mouth off. You do know how to do
a Web search, don't you?

"You can lead a horse's ass to knowledge, but you can't make him think."

Relevant Pages

  • Re: encryption with pi
    ... The algorithm is quite fast. ... Could you clarify what you mean by "constant time"? ... in which case computing the n-th digit of pi is trivially ...
    (sci.crypt)
  • Re: encryption with pi
    ... Computing the ... > You can't even look at n in constant time (unless n is fixed or ... > for the n-th digit, but that would be a far way from constant. ... 1st bug in MS win2k source code found after 20 minutes: ...
    (sci.crypt)
  • Re: Paper & pencil password algorithm
    ... Computing something like mul, C) would be twice as much ... Testing if a digit is multiple of three is easy to remember. ... Look at the first empty slot from the left, ... *addKey: Add the key digitwise to the last row. ...
    (sci.crypt)
  • Re: Contradicrtion-free mathemattics (The new nonstandard analysis
    ... >>digit is known or computable. ... >>scheme for computing each digit or determining it uniquely from the basic ... algorithm for each natural and more than any finite number of naturals. ...
    (sci.math)
  • Re: Contradicrtion-free mathemattics (The new nonstandard analysis
    ... >>digit is known or computable. ... >>scheme for computing each digit or determining it uniquely from the basic ... algorithm for each natural and more than any finite number of naturals. ...
    (sci.math)