Re: RSA encryption on Win32

I tried it (I think) and get "out of memory". Is there some reason for the obfusticated code? What does:

($r,$t)=&bdiv($r,256),$_=pack(C,$t).$_ while$w--+1-2*$d;
[download]

become? ($w--)+1-(2*$d)??

Comment on Re: RSA encryption on Win32 Download Code

Replies are listed 'Best First'.
(tye)Re: RSA encryption on Win32 by tye (Sage) on Feb 27, 2001 at 12:54 UTC
Yeah, it is a bit obfuscated, but not too much. The `$w--+1-2*$d` means that it outputs one extra byte per group when encrypting ($d==0) and then strips that extra byte per group when decrypting ($d==1 because the script specified -s to perl and you specified -d to the script). Stepping through the algorythm, it appears at least close. I haven't had time to debug the problem, though. If I could find a better all-Perl implementation of this, I might be able to compare the behavior of the two and figure out the problem. - tye (but my friends call me "Tye")	[reply] [d/l]

Replies are listed 'Best First'.

(tye)Re: RSA encryption on Win32
by tye (Sage) on Feb 27, 2001 at 12:54 UTC

Yeah, it is a bit obfuscated, but not too much. The $w--+1-2*$d means that it outputs one extra byte per group when encrypting ($d==0) and then strips that extra byte per group when decrypting ($d==1 because the script specified -s to perl and you specified -d to the script).

Stepping through the algorythm, it appears at least close. I haven't had time to debug the problem, though. If I could find a better all-Perl implementation of this, I might be able to compare the behavior of the two and figure out the problem.

tye

[reply]
[d/l]