Re: crypto challenge
- From: "Amit" <amitabh123@xxxxxxxxx>
- Date: 23 Dec 2006 06:47:16 -0800
further to comment:
you'll find the order of the group after some time, depending on the
size of \phi(n).
If the order is known, you can calculate the inverse using the oracle.
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.
- Prev by Date: Re: Dividing 512 bit number by 128 bit number in C program
- Next by Date: Re: Dividing 512 bit number by 128 bit number in C program
- Previous by thread: Re: crypto challenge
- Next by thread: So, what is it about OpenSSL and sci.crypt?