On 28/12/06 3:56 PM, in article emvipi$hl6$1@ihnp4.ucsd.edu, "Carl
Lowenstein" deeptow.ucsd.edu> wrote:

Wow! Deja vue :-)

Sorry, but Galileo was pipped to the post by Nicole Oresme more than a
hundred years before, and perhaps by others whose work remains unknown.
There's no evidence that Galileo plagiarised his version of my favourite
thought experiment, though.

Jonathan Sturm
(Still the world's most famous Pompous Git according to Google)

I am interested in different versions of number theoretic functions
such as the pi() prime counting function and the Euler totient
function.

In particular with the totient function, I have found that it performs
terribly given a large prime, and marvelously given a highly composite
number. I wonder if it could be made more efficient by applying
MillerRabin followed by APR/CL to larger hunks to find out if they are
prime a-priori.

Web searches have not turned up anything particularly interesting.
Perhaps someone can give me a nudge in the right direction.

I've been thinking about this, but perhaps a fresh set of eyes might
help ... so I'm calling out to all ye enlightened folks...

I am using the following values for the well-known RSA cryptosystem

two primes p = 11 and q = 23 and so n = 253
exponent e, relatively prime to (p-1)(q-1) is 9
exponent d=5 since (ed-1) divides (p-1)(q-1)

But this doesn't work ... e.g. pick plaintext numbers from 1 to 10.

I think it's got something to do with the choice of e and d i.e. should
they be prime? (The literature doesn't quite say this.)

Thanks in advance

James,

I hope you had a merry and peaceful holiday season.

fucking morons ..for my fucking math discoveries ...another fucking
thing coming.

... for the fucking beauty of it now you fucking shits??!!!

am working on constructing diceware type of keyfiles for use with
truecrypt,
so that even when all the keyfiles are on the same usb drive as the
truecrypt volume,
the selection of keyfiles would still have the same complexity and
relative ease,
as the selection of a diceware passphrase

am preparing a folder of diceware .txt files, each one named with a
word from
the diceware wordlist,
(the content of each textfile is just the same word as the filename)

the problem is, that when truecrypt selects keyfiles,
the order of selection is *not* important

the question now, is how many more keyfiles are necessary
to achieve the complexity equivalent to a diceware passphrase?

the diceware list is 7776 (6^5)

a passphrase of 'r' diceware words has a complexity of (7776)^r

the same selection of diceware files for a truecrypt keyfile passphrase
only has a complexity of ( 7776^r / r! )

David Wagner wrote:

The site will be more like the various "crypto lounges" currently on
the web, like the block cipher lounge and the hash function lounge, but
based on a semantic wiki instead of static pages. (A semantic wiki is
essentially a wiki interface with a relational-like database backend
that allows structured data, queries and collaborative editing.) The
site will be focused on standardized data (such as key lengths and home
pages) and relational information between algorithms, papers, and
people. (Eventually there may be more categories like hardness
assumptions and proof techniques.)

Also, the notability requirement will be different from Wikipedia, so
that an algorithm can be listed as soon as a paper has been published
about it, rather then when it becomes popular enough to warrant an
encyclopedia entry.