On Wed, 14 Nov 2007, gandlf wrote:
> 1) m = p*q-> RSA modulus
>
> [...]
>
> Algorithm
> -
>
> - Repeat "a = a^n mod m" with n from 2 to m, saving all the results
> in a table until a == 1 (Statement 4).
:-)
So what is the expected running time of your algorithm? For example,
On Mon, 2 Apr 2007, Bob Fiero wrote:
> RBLs such as SpamCop gave me an idea a few years back. We should
> build a virtual wall around the country.
In theory it is a good idea, but in practice it is not clear if
the rate of false positives or false negatives will not ruin the
system. Even if you pr
On Sat, 27 Jan 2007 [EMAIL PROTECTED] wrote:
> The detailed article (including sample images) is online here:
> http://www.cip.physik.uni-muenchen.de/~wwieser/misc/captcha/
>
>> To extract a series of captchas with the same information (number)
>> in them, it is sufficient to repeatedly call their
On Wed, 24 May 2006 [EMAIL PROTECTED] wrote:
> Steps to access PGP Encrypted Disk (Passphrase) using a Backdoor type attack
> [...]
> * Now say you give that disk to someone and they changed the
> passphrase on it. You can still access it
Intuitively, the system works as follows: a rando
On Mon, 17 Apr 2006, Felix von Leitner wrote:
> static inline int range_ptrinbuf(const void* buf,unsigned long len,const
> void* ptr) {
> register const char* c=(const char*)buf; /* no pointer arithmetic on
> void* */
> return (c && c+len>c && (const char*)ptr-c }
>
> [...]
>
> assert(
