"D. J. Bernstein" wrote in message
news:slrneorov5.qtk.dan@wessel.mat.dtu.dk...

Thanks for the explanation. I think with a 64-bit multiplier you can do a
multiply mod 2^127-1 just as fast as mod 2^107-1, but mod 2^127-1 allows you
to pack more message bytes into each polynomial coefficient.

Le Chaud Lapin wrote:

I would like to make a retraction of the statement in the line above.

I realized last night just before going to bed that my algorithm is not
as useless as I thought. My gut feeling is that it can be made to run
much faster than it is in the implementation I gave.

Just how fast remains a matter of exploration. I will explore.

-Le Chaud Lapin-

further to comment:

it is known that knowledge of \phi(n) is equivalent to the knowledge of
the factors of n.
So your method is the naive method of breaking the system by factoring.
I am trying to see if there is a faster method.

Hello,
The BBC news articles below address privacy concerns
over states' and corporations' use of personal data.
I think you will find the links useful.

Thanks,
Mashi

The basic summary is the following:
1. States collect personal info by various methods
(eg:CCTV/closed-circuit TV in roadways).
Corporations collect personal info by various means
(eg:credit card transactions...